Complete Mining of Frequent Patterns from Graphs: Mining Graph Data
Machine Learning
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
Efficiently mining frequent trees in a forest
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and 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
Frequent free tree discovery in graph data
Proceedings of the 2004 ACM symposium on Applied computing
SSDBM '04 Proceedings of the 16th International Conference on Scientific and Statistical Database Management
The levelwise version space algorithm and its application to molecular fragment finding
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
Efficiently Mining Frequent Trees in a Forest: Algorithms and Applications
IEEE Transactions on Knowledge and Data Engineering
Frequent Substructure-Based Approaches for Classifying Chemical Compounds
IEEE Transactions on Knowledge and Data Engineering
Discovering frequent topological structures from graph datasets
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Comparison of graph-based and logic-based multi-relational data mining
ACM SIGKDD Explorations Newsletter
MoSS: a program for molecular substructure mining
Proceedings of the 1st international workshop on open source data mining: frequent pattern mining implementations
Subdue: compression-based frequent pattern discovery in graph data
Proceedings of the 1st international workshop on open source data mining: frequent pattern mining implementations
Proceedings of the 2006 workshop on Memory system performance and correctness
TRIPS and TIDES: new algorithms for tree mining
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Frequent Subtree Mining - An Overview
Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
Mining unconnected patterns in workflows
Information Systems
Entire regularization paths for graph data
Proceedings of the 24th international conference on Machine learning
Correlation search in graph databases
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Graph-Based Analysis of Human Transfer Learning Using a Game Testbed
IEEE Transactions on Knowledge and Data Engineering
Towards graph containment search and indexing
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Graph mining based on a data partitioning approach
ADC '08 Proceedings of the nineteenth conference on Australasian database - Volume 75
Partial least squares regression for graph mining
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Inductive Logic Programming
RAM: Randomized Approximate Graph Mining
SSDBM '08 Proceedings of the 20th international conference on Scientific and Statistical Database Management
Mining Edge-Weighted Call Graphs to Localise Software Bugs
ECML PKDD '08 Proceedings of the 2008 European Conference on Machine Learning and Knowledge Discovery in Databases - Part I
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
An integrated, generic approach to pattern mining: data mining template library
Data Mining and Knowledge Discovery
On effective presentation of graph patterns: a structural representative approach
Proceedings of the 17th ACM conference on Information and knowledge management
Mining Intervals of Graphs to Extract Characteristic Reaction Patterns
DS '08 Proceedings of the 11th International Conference on Discovery Science
Discovering frequent work procedures from resource connections
Proceedings of the 14th international conference on Intelligent user interfaces
GADDI: distance index based subgraph matching in biological networks
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Large-scale graph mining using backbone refinement classes
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
A Method for Classifying Vertices of Labeled Graphs Applied to Knowledge Discovery from Molecules
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Identifying bug signatures using discriminative graph mining
Proceedings of the eighteenth international symposium on Software testing and analysis
Mining globally distributed frequent subgraphs in a single labeled graph
Data & Knowledge Engineering
ECML PKDD '09 Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part II
Independent informative subgraph mining for graph information retrieval
Proceedings of the 18th ACM conference on Information and knowledge management
Frequent subgraph pattern mining on uncertain graph data
Proceedings of the 18th ACM conference on Information and knowledge management
Learning to rank graphs for online similar graph search
Proceedings of the 18th ACM conference on Information and knowledge management
Output space sampling for graph patterns
Proceedings of the VLDB Endowment
gPrune: a constraint pushing framework for graph pattern mining
PAKDD'07 Proceedings of the 11th Pacific-Asia conference on Advances in knowledge discovery and data mining
A method of improving the efficiency of mining sub-structures in molecular structure databases
BNCOD'07 Proceedings of the 24th British national conference on Databases
Mining closed frequent free trees in graph databases
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
Discovery of frequent graph patterns that consist of the vertices with the complex structures
MCD'07 Proceedings of the 3rd ECML/PKDD international conference on Mining complex data
Mining correlated subgraphs in graph databases
PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining
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
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
JPMiner: mining frequent jump patterns from graph databases
FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 5
Towards proximity pattern mining in large graphs
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Connected substructure similarity search
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
IEEE Computational Intelligence Magazine
Semi-supervised feature selection for graph classification
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
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
Frequent subgraph mining in outerplanar graphs
Data Mining and Knowledge Discovery
POTMiner: mining ordered, unordered, and partially-ordered trees
Knowledge and Information Systems
DESSIN: mining dense subgraph patterns in a single graph
SSDBM'10 Proceedings of the 22nd international conference on Scientific and statistical database management
Mining for paths in flow graphs
ICDM'10 Proceedings of the 10th industrial conference on Advances in data mining: applications and theoretical aspects
Latent structure pattern mining
ECML PKDD'10 Proceedings of the 2010 European conference on Machine learning and knowledge discovery in databases: Part II
Frequent tree pattern mining: A survey
Intelligent Data Analysis
An efficient distributed subgraph mining algorithm in extreme large graphs
AICI'10 Proceedings of the 2010 international conference on Artificial intelligence and computational intelligence: Part I
Efficient discovery of frequent subgraph patterns in uncertain graph databases
Proceedings of the 14th International Conference on Extending Database Technology
Dynamic network motifs: evolutionary patterns of substructures in complex networks
APWeb'11 Proceedings of the 13th Asia-Pacific web conference on Web technologies and applications
Dual active feature and sample selection for graph classification
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Using graphs to improve activity prediction in smart environments based on motion sensor data
ICOST'11 Proceedings of the 9th international conference on Toward useful services for elderly and people with disabilities: smart homes and health telematics
From connected frequent graphs to unconnected frequent graphs
ISMIS'11 Proceedings of the 19th international conference on Foundations of intelligent systems
How to use "classical" tree mining algorithms to find complex spatio-temporal patterns?
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part II
Extracting and summarizing the frequent emerging graph patterns from a dataset of graphs
Journal of Intelligent Information Systems
Don't be afraid of simpler patterns
PKDD'06 Proceedings of the 10th European conference on Principle and Practice of Knowledge Discovery in Databases
A quantitative comparison of the subgraph miners mofa, gspan, FFSM, and gaston
PKDD'05 Proceedings of the 9th European conference on Principles and Practice of Knowledge Discovery in Databases
Knowledge hiding from tree and graph databases
Data & Knowledge Engineering
Frequent approximate subgraphs as features for graph-based image classification
Knowledge-Based Systems
To see the wood for the trees: mining frequent tree patterns
Proceedings of the 2004 European conference on Constraint-Based Mining and Inductive Databases
GTRACE2: improving performance using labeled union 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
TreeSpan: efficiently computing similarity all-matching
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Semi-supervised clustering of graph objects: a subgraph mining approach
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part I
Effective graph classification based on topological and label attributes
Statistical Analysis and Data Mining
Frequent Subtree Mining - An Overview
Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
Discovering geometric patterns in genomic data
Proceedings of the ACM Conference on Bioinformatics, Computational Biology and Biomedicine
Graph classification: a diversified discriminative feature selection approach
Proceedings of the 21st ACM international conference on Information and knowledge management
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
Mining frequent subgraphs over uncertain graph databases under probabilistic semantics
The VLDB Journal — The International Journal on Very Large Data Bases
NODAR: mining globally distributed substructures from a single labeled graph
Journal of Intelligent Information Systems
Efficient mining of top-k breaker emerging subgraph patterns from graph datasets
AusDM '09 Proceedings of the Eighth Australasian Data Mining Conference - Volume 101
A multiobjective evolutionary programming framework for graph-based data mining
Information Sciences: an International Journal
Mining frequent neighborhood patterns in a large labeled graph
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Frequent subgraph summarization with error control
WAIM'13 Proceedings of the 14th international conference on Web-Age Information Management
A new proposal for graph classification using frequent geometric subgraphs
Data & Knowledge Engineering
Para Miner: a generic pattern mining algorithm for multi-core architectures
Data Mining and Knowledge Discovery
Analysis of Textual Data Based on Inductive Learning Techniques
International Journal of Information Retrieval Research
International Journal of Knowledge Discovery in Bioinformatics
Annals of Mathematics and Artificial Intelligence
Mining spatiotemporal patterns in dynamic plane graphs
Intelligent Data Analysis - Dynamic Networks and Knowledge Discovery
| Hi-index | 0.01 |
Given a database, structure mining algorithms search for substructures that satisfy constraints such as minimum frequency, minimum confidence, minimum interest and maximum frequency. Examples of substructures include graphs, trees and paths. For these substructures many mining algorithms have been proposed. In order to make graph mining more efficient, we investigate the use of the "quickstart principle", which is based on the fact that these classes of structures are contained in each other, thus allowing for the development of structure mining algorithms that split the search into steps of increasing complexity. We introduce the GrAph/Sequence/Tree extractiON (Gaston) algorithm that implements this idea by searching first for frequent paths, then frequent free trees and finally cyclic graphs. We investigate two alternatives for computing the frequency of structures and present experimental results to relate these alternatives.