@article{ART001611513},
author={노영상 and 윤은일 and 편광범 and 양흥모 and 이강인 and Ryu, Keun Ho and 이경민},
title={An efficient approach of avoiding extensions of duplicated graph patterns in cyclic graph mining},
journal={Journal of The Korea Society of Computer and Information},
issn={1598-849X},
year={2011},
volume={16},
number={12},
pages={33-42}
TY - JOUR
AU - 노영상
AU - 윤은일
AU - 편광범
AU - 양흥모
AU - 이강인
AU - Ryu, Keun Ho
AU - 이경민
TI - An efficient approach of avoiding extensions of duplicated graph patterns in cyclic graph mining
JO - Journal of The Korea Society of Computer and Information
PY - 2011
VL - 16
IS - 12
PB - The Korean Society Of Computer And Information
SP - 33
EP - 42
SN - 1598-849X
AB - From Complicated graph structures, duplicated operations can be executed and the operations give low efficiency. In this paper, we propose an efficient graph mining algorithm of minimizing the extension of duplicated graph patterns in which the priorities of cyclic edges are considered. In our approach, the cyclic edges with lower priorities are first extended and so duplicated extensions can be reduced. For performance test, we implement our algorithm and compare our algorithm with a state of the art, Gaston algorithm. Finally, We show that ours outperforms Gaston algorithm.
KW - Cyclic graph;duplication estimation;Subgraph mining;pattern extension
DO -
UR -
ER -
노영상, 윤은일, 편광범, 양흥모, 이강인, Ryu, Keun Ho and 이경민. (2011). An efficient approach of avoiding extensions of duplicated graph patterns in cyclic graph mining. Journal of The Korea Society of Computer and Information, 16(12), 33-42.
노영상, 윤은일, 편광범, 양흥모, 이강인, Ryu, Keun Ho and 이경민. 2011, "An efficient approach of avoiding extensions of duplicated graph patterns in cyclic graph mining", Journal of The Korea Society of Computer and Information, vol.16, no.12 pp.33-42.
노영상, 윤은일, 편광범, 양흥모, 이강인, Ryu, Keun Ho, 이경민 "An efficient approach of avoiding extensions of duplicated graph patterns in cyclic graph mining" Journal of The Korea Society of Computer and Information 16.12 pp.33-42 (2011) : 33.
노영상, 윤은일, 편광범, 양흥모, 이강인, Ryu, Keun Ho, 이경민. An efficient approach of avoiding extensions of duplicated graph patterns in cyclic graph mining. 2011; 16(12), 33-42.
노영상, 윤은일, 편광범, 양흥모, 이강인, Ryu, Keun Ho and 이경민. "An efficient approach of avoiding extensions of duplicated graph patterns in cyclic graph mining" Journal of The Korea Society of Computer and Information 16, no.12 (2011) : 33-42.
노영상; 윤은일; 편광범; 양흥모; 이강인; Ryu, Keun Ho; 이경민. An efficient approach of avoiding extensions of duplicated graph patterns in cyclic graph mining. Journal of The Korea Society of Computer and Information, 16(12), 33-42.
노영상; 윤은일; 편광범; 양흥모; 이강인; Ryu, Keun Ho; 이경민. An efficient approach of avoiding extensions of duplicated graph patterns in cyclic graph mining. Journal of The Korea Society of Computer and Information. 2011; 16(12) 33-42.
노영상, 윤은일, 편광범, 양흥모, 이강인, Ryu, Keun Ho, 이경민. An efficient approach of avoiding extensions of duplicated graph patterns in cyclic graph mining. 2011; 16(12), 33-42.
노영상, 윤은일, 편광범, 양흥모, 이강인, Ryu, Keun Ho and 이경민. "An efficient approach of avoiding extensions of duplicated graph patterns in cyclic graph mining" Journal of The Korea Society of Computer and Information 16, no.12 (2011) : 33-42.
