Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data
PKDD '00 Proceedings of the 4th European Conference on Principles of Data Mining and Knowledge Discovery
Mining Molecular Fragments: Finding Relevant Substructures of Molecules
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
Efficient Mining of Frequent Subgraphs in the Presence of Isomorphism
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
CloseGraph: mining closed frequent graph patterns
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
State of the art of graph-based data mining
ACM SIGKDD Explorations Newsletter
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
Substructure discovery using minimum description length and background knowledge
Journal of Artificial Intelligence Research
The predictive toxicology evaluation challenge
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Graph-Based Procedural Abstraction
Proceedings of the International Symposium on Code Generation and Optimization
Taxonomy-superimposed graph mining
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Mining Frequent Connected Subgraphs Reducing the Number of Candidates
ECML PKDD '08 Proceedings of the 2008 European Conference on Machine Learning and Knowledge Discovery in Databases - Part I
Large-scale graph mining using backbone refinement classes
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Discovering Emerging Graph Patterns from Chemicals
ISMIS '09 Proceedings of the 18th International Symposium on Foundations of Intelligent Systems
Preserving Privacy in Social Networks: A Structure-Aware Approach
WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 01
Independent informative subgraph mining for graph information retrieval
Proceedings of the 18th ACM conference on Information and knowledge management
gRegress: extracting features from graph transactions for regression
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Duplicate candidate elimination and fast support calculation for frequent subgraph mining
IDEAL'09 Proceedings of the 10th international conference on Intelligent data engineering and automated learning
Model clone detection in practice
Proceedings of the 4th International Workshop on Software Clones
A new algorithm for mining frequent connected subgraphs based on adjacency matrices
Intelligent Data Analysis
Full duplicate candidate pruning for frequent connected subgraph mining
Integrated Computer-Aided Engineering
iGraph: a framework for comparisons of disk-based graph indexing techniques
Proceedings of the VLDB Endowment
GRAONTO: A graph-based approach for automatic construction of domain ontology
Expert Systems with Applications: An International Journal
Extracting and summarizing the frequent emerging graph patterns from a dataset of graphs
Journal of Intelligent Information Systems
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
Graph-Based relational learning with a polynomial time projection algorithm
ILP'11 Proceedings of the 21st international conference on Inductive Logic Programming
Nearly exact mining of frequent trees in large networks
ECML PKDD'12 Proceedings of the 2012 European conference on Machine Learning and Knowledge Discovery in Databases - Volume Part I
Structure-aware graph anonymization
Web Intelligence and Agent Systems
| Hi-index | 0.00 |
Several new miners for frequent subgraphs have been published recently. Whereas new approaches are presented in detail, the quantitative evaluations are often of limited value: only the performance on a small set of graph databases is discussed and the new algorithm is often only compared to a single competitor based on an executable. It remains unclear, how the algorithms work on bigger/other graph databases and which of their distinctive features is best suited for which database. We have re-implemented the subgraph miners MoFa, gSpan, FFSM, and Gaston within a common code base and with the same level of programming expertise and optimization effort. This paper presents the results of a comparative benchmarking that ran the algorithms on a comprehensive set of graph databases.