Journal
INTEGRATED COMPUTER-AIDED ENGINEERING
Volume 17, Issue 3, Pages 211-225Publisher
IOS PRESS
DOI: 10.3233/ICA-2010-0342
Keywords
Data mining; graph mining; frequent subgraph; labeled graph; DFS code
Ask authors/readers for more resources
Support calculation and duplicate detection are the most challenging and unavoidable subtasks in frequent connected subgraph (FCS) mining. The most successful FCS mining algorithms have focused on optimizing these subtasks since the existing solutions for both subtasks have high computational complexity. In this paper, we propose two novel properties that allow removing all duplicate candidates before support calculation. Besides, we introduce a fast support calculation strategy based on embedding structures. Both properties and the new embedding structure are used for designing two new algorithms: gdFil for mining all FCSs; and gdClosed for mining all closed FCSs. The experimental results show that our proposed algorithms get the best performance in comparison with other well known algorithms.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available