Complete Mining of Frequent Patterns from Graphs: Mining Graph Data
Machine Learning
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
Efficient Discovery of Common Substructures in Macromolecules
ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
gSpan: Graph-Based Substructure Pattern Mining
ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
SPIN: mining maximal frequent subgraphs from graph databases
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
A quickstart in frequent structure mining can make a difference
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Large scale mining of molecular fragments with wildcards
Intelligent Data Analysis
The predictive toxicology evaluation challenge
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Fast best-effort pattern matching in large attributed graphs
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Mining frequent trajectory patterns in spatial-temporal databases
Information Sciences: an International Journal
TANGENT: a novel, 'Surprise me', recommendation algorithm
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Mining frequent closed patterns in pointset databases
Information Systems
Efficient algorithms for node disjoint subgraph homeomorphism determination
DASFAA'08 Proceedings of the 13th international conference on Database systems for advanced applications
OddBall: spotting anomalies in weighted graphs
PAKDD'10 Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part II
Using and learning semantics in frequent subgraph mining
WebKDD'05 Proceedings of the 7th international conference on Knowledge Discovery on the Web: advances in Web Mining and Web Usage Analysis
Gateway finder in large graphs: problem definitions and fast solutions
Information Retrieval
| Hi-index | 0.00 |
The problem of finding frequent patterns from graph-based datasets is an important one that finds applications in drug discovery, protein structure analysis, XML querying, and social network analysis among others. In this paper we propose a framework to mine frequent large-scale structures, formally defined as frequent topological structures, from graph datasets. Key elements of our framework include, fast algorithms for discovering frequent topological patterns based on the well known notion of a topological minor, algorithms for specifying and pushing constraints deep into the mining process for discovering constrained topological patterns, and mechanisms for specifying approximate matches when discovering frequent topological patterns in noisy datasets. We demonstrate the viability and scalability of the proposed algorithms on real and synthetic datasets and also discuss the use of the framework to discover meaningful topological structures from protein structure data.