Mining frequent patterns without candidate generation
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Introduction to Algorithms
MAFIA: A Maximal Frequent Itemset Algorithm for Transactional Databases
Proceedings of the 17th International Conference on Data Engineering
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Efficiently mining frequent trees in a forest
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Mining Molecular Fragments: Finding Relevant Substructures of Molecules
ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
Discovering Frequent Geometric Subgraphs
ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
Computing Frequent Graph Patterns from Semistructured Data
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
TSP: Mining Top-K Closed Sequential Patterns
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
Biological applications of multi-relational data mining
ACM SIGKDD Explorations Newsletter
Substructure Clustering on Sequential 3d Object Datasets
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Unordered Tree Mining with Applications to Phylogeny
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
BIDE: Efficient Mining of Frequent Closed Sequences
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Graph indexing: a frequent structure-based approach
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Scalable mining of large disk-based graph databases
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
IncSpan: incremental mining of sequential patterns in large database
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and 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
From sequential pattern mining to structured pattern mining: a pattern-growth approach
Journal of Computer Science and Technology
Mining Sequential Patterns by Pattern-Growth: The PrefixSpan Approach
IEEE Transactions on Knowledge and Data Engineering
Mining Closed and Maximal Frequent Subtrees from Databases of Labeled Rooted Trees
IEEE Transactions on Knowledge and Data Engineering
Mining and Reasoning on Workflows
IEEE Transactions on Knowledge and Data Engineering
Mining Closed Relational Graphs with Connectivity Constraints
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
TSP: Mining top-k closed sequential patterns
Knowledge and Information Systems
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Efficiently Mining Frequent Trees in a Forest: Algorithms and Applications
IEEE Transactions on Knowledge and Data Engineering
On mining cross-graph quasi-cliques
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Mining closed relational graphs with connectivity constraints
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Parallel mining of closed sequential patterns
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Finding Frequent Patterns in a Large Sparse Graph*
Data Mining and Knowledge Discovery
Graph indexing based on discriminative frequent structure analysis
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2004
Discovering informative connection subgraphs in multi-relational graphs
ACM SIGKDD Explorations Newsletter
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
Privacy-preserving SVM using nonlinear kernels on horizontally partitioned data
Proceedings of the 2006 ACM symposium on Applied computing
Clustering graphs by weighted substructure mining
ICML '06 Proceedings of the 23rd international conference on Machine learning
GPLAG: detection of software plagiarism by program dependence graph analysis
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Discovering Frequent Graph Patterns Using Disjoint Paths
IEEE Transactions on Knowledge and Data Engineering
Discovering Frequent Closed Partial Orders from Strings
IEEE Transactions on Knowledge and Data Engineering
Computational aspects of mining maximal frequent patterns
Theoretical Computer Science
Horn axiomatizations for sequential data
Theoretical Computer Science
Efficiently Mining Frequent Embedded Unordered Trees
Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
A General Framework for Mining Frequent Subgraphs from Labeled Graphs
Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
Frequent Subtree Mining - An Overview
Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
XML structural delta mining: issues and challenges
Data & Knowledge Engineering - Special issue: ER 2003
Mining unconnected patterns in workflows
Information Systems
Out-of-core coherent closed quasi-clique mining from large dense graph databases
ACM Transactions on Database Systems (TODS)
Fg-index: towards verification-free query processing on graph databases
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
CP-Miner: a tool for finding copy-paste and related bugs in operating system code
OSDI'04 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6
Graph-Based Procedural Abstraction
Proceedings of the International Symposium on Code Generation and Optimization
Efficient mining of iterative patterns for software specification discovery
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Discovering frequent geometric subgraphs
Information Systems
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
Discovering Frequent Agreement Subtrees from Phylogenetic Data
IEEE Transactions on Knowledge and Data Engineering
A new framework for detecting weighted sequential patterns in large sequence databases
Knowledge-Based Systems
Taxonomy-superimposed graph mining
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Fast mining maximal sequential patterns
SMO'07 Proceedings of the 7th WSEAS International Conference on Simulation, Modelling and Optimization
Mining, indexing, and searching for textual chemical molecule information on the web
Proceedings of the 17th international conference on World Wide Web
Mining significant graph patterns by leap search
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Mining adaptively frequent closed unlabeled rooted trees in data streams
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Direct mining of discriminative and essential frequent patterns via model-based search tree
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Mining Frequent Closed Unordered Trees Through Natural Representations
ICCS '07 Proceedings of the 15th international conference on Conceptual Structures: Knowledge Architectures for Smart Applications
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
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
Structure feature selection for graph classification
Proceedings of the 17th ACM conference on Information and knowledge management
Mining frequent cross-graph quasi-cliques
ACM Transactions on Knowledge Discovery from Data (TKDD)
Discovering frequent work procedures from resource connections
Proceedings of the 14th international conference on Intelligent user interfaces
Efficient query processing on graph databases
ACM Transactions on Database Systems (TODS)
A novel approach for efficient supergraph query processing on graph databases
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
FOGGER: an algorithm for graph generator discovery
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
Cross-domain knowledge transfer using structured representations
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Data & Knowledge Engineering
Discovery of Correlated Sequential Subgraphs from a Sequence of Graphs
ADMA '09 Proceedings of the 5th International Conference on Advanced Data Mining and Applications
APPT '09 Proceedings of the 8th International Symposium on Advanced Parallel Processing Technologies
Selecting Computer Architectures by Means of Control-Flow-Graph Mining
IDA '09 Proceedings of the 8th International Symposium on Intelligent Data Analysis: Advances in Intelligent Data Analysis VIII
Adaptive XML Tree Classification on Evolving Data Streams
ECML PKDD '09 Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part I
On mining closed sets in multi-relational data
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
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
Partitioning and scheduling of task graphs on partially dynamically reconfigurable FPGAs
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Output space sampling for graph patterns
Proceedings of the VLDB Endowment
GConnect: a connectivity index for massive disk-resident graphs
Proceedings of the VLDB Endowment
Mining Tree-Based Frequent Patterns from XML
FQAS '09 Proceedings of the 8th International Conference on Flexible Query Answering Systems
Pattern Structures for Analyzing Complex Data
RSFDGrC '09 Proceedings of the 12th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing
The Gaston Tool for Frequent Subgraph Mining
Electronic Notes in Theoretical Computer Science (ENTCS)
Adaptive Stream Mining: Pattern Learning and Mining from Evolving Data Streams
Proceedings of the 2010 conference on Adaptive Stream Mining: Pattern Learning and Mining from Evolving Data Streams
Fast computation of SimRank for static and dynamic information networks
Proceedings of the 13th International Conference on Extending Database Technology
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
Efficiently mining closed constrained frequent ordered subtrees by using border information
PAKDD'07 Proceedings of the 11th Pacific-Asia conference on Advances in knowledge discovery and data mining
Time and space efficient discovery of maximal geometric graphs
DS'07 Proceedings of the 10th international conference on Discovery science
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
Efficient algorithms for mining frequent and closed patterns from semi-structured data
PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining
Pattern matching in RNA structures
ISBRA'08 Proceedings of the 4th international conference on Bioinformatics research and applications
Mining partially labeled subgraphs using support constraints
FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 2
JPMiner: mining frequent jump patterns from graph databases
FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 5
A flexible and efficient sequential pattern mining algorithm
International Journal of Intelligent Information and Database Systems
Authorship classification: a syntactic tree mining approach
Proceedings of the ACM SIGKDD Workshop on Useful Patterns
IEEE Computational Intelligence Magazine
Diagnosing memory leaks using graph mining on heap dumps
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Parallel SimRank computation on large graphs with iterative aggregation
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
MARGIN: Maximal frequent subgraph mining
ACM Transactions on Knowledge Discovery from Data (TKDD)
Full duplicate candidate pruning for frequent connected subgraph mining
Integrated Computer-Aided Engineering
An efficient features-based processing technique for supergraph queries
Proceedings of the Fourteenth International Database Engineering & Applications Symposium
Mining interesting link formation rules in social networks
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
A case study on financial ratios via cross-graph quasi-bicliques
Information Sciences: an International Journal
Frequent sub-graph mining on edge weighted graphs
DaWaK'10 Proceedings of the 12th international conference on Data warehousing and knowledge discovery
Software-defect localisation by mining dataflow-enabled call graphs
ECML PKDD'10 Proceedings of the 2010 European conference on Machine learning and knowledge discovery in databases: Part I
On dense pattern mining in graph streams
Proceedings of the VLDB Endowment
Mining graphs with constraints on symmetry and diameter
WAIM'10 Proceedings of the 2010 international conference on Web-age information management
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
Mining frequent closed trees in evolving data streams
Intelligent Data Analysis - Ubiquitous Knowledge Discovery
Efficient algorithms for supergraph query processing on graph databases
Journal of Combinatorial Optimization
TGP: mining top-K frequent closed graph pattern without minimum support
ADMA'10 Proceedings of the 6th international conference on Advanced data mining and applications: Part I
Mining closed discriminative dyadic sequential patterns
Proceedings of the 14th International Conference on Extending Database Technology
Efficient discovery of frequent subgraph patterns in uncertain graph databases
Proceedings of the 14th International Conference on Extending Database Technology
Identifying, Indexing, and Ranking Chemical Formulae and Chemical Names in Digital Documents
ACM Transactions on Information Systems (TOIS)
Structure and attribute index for approximate graph matching in large graphs
Information Systems
Mining frequent closed graphs on evolving data streams
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Computing graph-based lattices from smallest projections
KONT'07/KPP'07 Proceedings of the First international conference on Knowledge processing and data analysis
LGM: mining frequent subgraphs from linear graphs
PAKDD'11 Proceedings of the 15th Pacific-Asia conference on Advances in knowledge discovery and data mining - Volume Part II
JACKSTRAWS: picking command and control connections from bot traffic
SEC'11 Proceedings of the 20th USENIX conference on Security
From connected frequent graphs to unconnected frequent graphs
ISMIS'11 Proceedings of the 19th international conference on Foundations of intelligent systems
Fast graph query processing with a low-cost index
The VLDB Journal — The International Journal on Very Large Data Bases
Mining frequent patterns from univariate uncertain data
Data & Knowledge Engineering
Extracting and summarizing the frequent emerging graph patterns from a dataset of graphs
Journal of Intelligent Information Systems
REX: explaining relationships between entity pairs
Proceedings of the VLDB Endowment
PrefixTreeESpan: a pattern growth algorithm for mining embedded subtrees
WISE'06 Proceedings of the 7th international conference on Web Information Systems
Implicit enumeration of patterns
KDID'04 Proceedings of the Third international conference on Knowledge Discovery in Inductive Databases
Constraint-Based graph mining in large database
APWeb'05 Proceedings of the 7th Asia-Pacific web conference on Web Technologies Research and Development
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
Using bags of symbols for automatic indexing of graphical document image databases
GREC'05 Proceedings of the 6th international conference on Graphics Recognition: ten Years Review and Future Perspectives
An effective system for mining web log
APWeb'06 Proceedings of the 8th Asia-Pacific Web conference on Frontiers of WWW Research and Development
Support vector machine approach for fast classification
DaWaK'06 Proceedings of the 8th international conference on Data Warehousing and Knowledge Discovery
A polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Discovering re-usable design solutions in web conceptual schemas: metrics and methodology
ICWE'05 Proceedings of the 5th international conference on Web Engineering
ADMA'05 Proceedings of the First international conference on Advanced Data Mining and Applications
Mining constrained graphs: the case of workflow systems
Proceedings of the 2004 European conference on Constraint-Based Mining and Inductive Databases
Generic pattern mining via data mining template library
Proceedings of the 2004 European conference on Constraint-Based Mining and Inductive Databases
An output-polynomial time algorithm for mining frequent closed attribute trees
ILP'05 Proceedings of the 15th international conference on Inductive Logic Programming
Learning closed sets of labeled graphs for chemical applications
ILP'05 Proceedings of the 15th international conference on Inductive Logic Programming
Parallel algorithm for mining frequent closed sequences
AIS-ADM 2005 Proceedings of the 2005 international conference on Autonomous Intelligent Systems: agents and Data Mining
Symbol grounding through cumulative learning
EELC'06 Proceedings of the Third international conference on Emergence and Evolution of Linguistic Communication: symbol Grounding and Beyond
Towards generic pattern mining
ICFCA'05 Proceedings of the Third international conference on Formal Concept Analysis
Learning from graph data by putting graphs on the lattice
Expert Systems with Applications: An International Journal
Efficient subgraph similarity search on large probabilistic graph databases
Proceedings of the VLDB Endowment
On nested palindromes in clickstream data
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Substructure clustering: a novel mining paradigm for arbitrary data types
SSDBM'12 Proceedings of the 24th international conference on Scientific and Statistical Database Management
Review of bisonet abstraction techniques
Bisociative Knowledge Discovery
Efficiently Mining Frequent Embedded Unordered Trees
Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
A General Framework for Mining Frequent Subgraphs from Labeled Graphs
Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
Frequent Subtree Mining - An Overview
Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
Mining Induced/Embedded Subtrees using the Level of Embedding Constraint
Fundamenta Informaticae
Graph classification: a diversified discriminative feature selection approach
Proceedings of the 21st ACM international conference on Information and knowledge management
Information Sciences: an International Journal
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
Discovering forward sequences from temporal data
Knowledge-Based Systems
Mining frequent subgraphs over uncertain graph databases under probabilistic semantics
The VLDB Journal — The International Journal on Very Large Data Bases
MSGPs: a novel algorithm for mining sequential generator patterns
ICCCI'12 Proceedings of the 4th international conference on Computational Collective Intelligence: technologies and applications - Volume Part II
Efficient mining of top-k breaker emerging subgraph patterns from graph datasets
AusDM '09 Proceedings of the Eighth Australasian Data Mining Conference - Volume 101
The complexity of mining maximal frequent subgraphs
Proceedings of the 32nd symposium on Principles of database systems
Finding the most descriptive substructures in graphs with discrete and numeric labels
NFMCP'12 Proceedings of the First international conference on New Frontiers in Mining Complex Patterns
A multiobjective evolutionary programming framework for graph-based data mining
Information Sciences: an International Journal
Using substructure mining to identify misbehavior in network provenance graphs
First International Workshop on Graph Data Management Experiences and Systems
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
Weighted path as a condensed pattern in a single attributed DAG
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Mining frequent correlated graphs with a new measure
Expert Systems with Applications: An International Journal
Modelling and exploring historical records to facilitate service composition
International Journal of Web and Grid Services
Interesting pattern mining in multi-relational data
Data Mining and Knowledge Discovery
Structure-aware graph anonymization
Web Intelligence and Agent Systems
Mining closed patterns in relational, graph and network data
Annals of Mathematics and Artificial Intelligence
Key roles of closed sets and minimal generators in concise representations of frequent patterns
Intelligent Data Analysis
| Hi-index | 0.00 |
Recent research on pattern discovery has progressed form mining frequent itemsets and sequences to mining structured patterns including trees, lattices, and graphs. As a general data structure, graph can model complicated relations among data with wide applications in bioinformatics, Web exploration, and etc. However, mining large graph patterns in challenging due to the presence of an exponential number of frequent subgraphs. Instead of mining all the subgraphs, we propose to mine closed frequent graph patterns. A graph g is closed in a database if there exists no proper supergraph of g that has the same support as g. A closed graph pattern mining algorithm, CloseGraph, is developed by exploring several interesting pruning methods. Our performance study shows that CloseGraph not only dramatically reduces unnecessary subgraphs to be generated but also substantially increases the efficiency of mining, especially in the presence of large graph patterns.