A survey of frequent subgraph mining algorithms
- 20 November 2012
- journal article
- research article
- Published by Cambridge University Press (CUP) in The Knowledge Engineering Review
- Vol. 28 (1), 75-105
- https://doi.org/10.1017/s0269888912000331
Abstract
Graph mining is an important research area within the domain of data mining. The field of study concentrates on the identification of frequent subgraphs within graph data sets. The research goals are directed at: (i) effective mechanisms for generating candidate subgraphs (without generating duplicates) and (ii) how best to process the generated candidate subgraphs so as to identify the desired frequent subgraphs in a way that is computationally efficient and procedurally effective. This paper presents a survey of current research in the field of frequent subgraph mining and proposes solutions to address the main research issues.Keywords
This publication has 47 references indexed in Scilit:
- TRIPS and TIDESPublished by Association for Computing Machinery (ACM) ,2006
- Link miningACM SIGKDD Explorations Newsletter, 2005
- Canonical forms for labelled trees and their applications in frequent subtree miningKnowledge and Information Systems, 2005
- Efficiently mining frequent trees in a forest: algorithms and applicationsIEEE Transactions on Knowledge and Data Engineering, 2005
- Aggregated Multicast ? A Comparative StudyCluster Computing, 2005
- Detecting community structure in networksZeitschrift für Physik B Condensed Matter, 2004
- Biological networksCurrent Opinion in Structural Biology, 2003
- Algorithms on Trees and GraphsPublished by Springer Science and Business Media LLC ,2002
- A Tree Projection Algorithm for Generation of Frequent Item SetsJournal of Parallel and Distributed Computing, 2001
- On the complexity of comparing evolutionary treesDiscrete Applied Mathematics, 1996