MARGIN
- 22 October 2010
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Knowledge Discovery From Data
- Vol. 4 (3), 1-42
- https://doi.org/10.1145/1839490.1839491
Abstract
The exponential number of possible subgraphs makes the problem of frequent subgraph mining a challenge. The set of maximal frequent subgraphs is much smaller to that of the set of frequent subgraphs providing ample scope for pruning. MARGIN is a maximal subgraph mining algorithm that moves among promising nodes of the search space along the “border” of the infrequent and frequent subgraphs. This drastically reduces the number of candidate patterns in the search space. The proof of correctness of the algorithm is presented. Experimental results validate the efficiency and utility of the technique proposed.Keywords
This publication has 24 references indexed in Scilit:
- Fast best-effort pattern matching in large attributed graphsPublished by Association for Computing Machinery (ACM) ,2007
- Correlation search in graph databasesPublished by Association for Computing Machinery (ACM) ,2007
- Finding Frequent Patterns in a Large Sparse Graph*Data Mining and Knowledge Discovery, 2005
- An efficient algorithm for detecting frequent subgraphs in biological networksBioinformatics, 2004
- State of the art of graph-based data miningACM SIGKDD Explorations Newsletter, 2003
- Discovering all most specific sentencesACM Transactions on Database Systems, 2003
- Efficiently mining frequent trees in a forestPublished by Association for Computing Machinery (ACM) ,2002
- CHARM: An Efficient Algorithm for Closed Itemset MiningPublished by Society for Industrial & Applied Mathematics (SIAM) ,2002
- An Apriori-Based Algorithm for Mining Frequent Substructures from Graph DataLecture Notes in Computer Science, 2000
- Graph-based induction as a unified learning frameworkApplied Intelligence, 1994