Mining frequent patterns without candidate generation
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
ACM SIGKDD Explorations Newsletter
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
TreeFinder: a First Step towards XML Data Mining
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
PrefixSpan: Mining Sequential Patterns Efficiently by Prefix-Projected Pattern Growth
ICDE '01 Proceedings of the 17th International Conference on Data Engineering
Indexing and Mining Free Trees
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
Efficient Data Mining for Maximal Frequent Subtrees
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
XRules: an effective structural classifier for XML data
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
A quickstart in frequent structure mining can make a difference
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Matching in Frequent Tree Discovery
ICDM '04 Proceedings of the Fourth IEEE International Conference on Data Mining
DRYADE: A New Approach for Discovering Closed Frequent Trees in Heterogeneous Tree Databases
ICDM '04 Proceedings of the Fourth IEEE International Conference on Data Mining
Mining Closed and Maximal Frequent Subtrees from Databases of Labeled Rooted Trees
IEEE Transactions on Knowledge and Data Engineering
Efficiently Mining Frequent Trees in a Forest: Algorithms and Applications
IEEE Transactions on Knowledge and Data Engineering
Practical methods for constructing suffix trees
The VLDB Journal — The International Journal on Very Large Data Bases
AMIOT: Induced Ordered Tree Mining in Tree-Structured Databases
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Efficient Mining of High Branching Factor Attribute Trees
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
TRIPS and TIDES: new algorithms for tree mining
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Knowledge Discovery from XML Documents: First International Workshop, KDXD 2006, Singapore, April 9, 2006, Proceedings (Lecture Notes in Computer Science)
Efficiently Mining Frequent Embedded Unordered Trees
Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
Frequent Subtree Mining - An Overview
Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
Genome-scale disk-based suffix tree indexing
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Challenges in mining social network data: processes, privacy, and paradoxes
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Xproj: a framework for projected structural clustering of xml documents
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Discovering Frequent Agreement Subtrees from Phylogenetic Data
IEEE Transactions on Knowledge and Data Engineering
Graphs, Networks and Algorithms
Graphs, Networks and Algorithms
Mining induced and embedded subtrees in ordered, unordered, and partially-ordered trees
ISMIS'08 Proceedings of the 17th international conference on Foundations of intelligent systems
IMB3-Miner: mining induced/embedded subtrees by constraining the level of embedding
PAKDD'06 Proceedings of the 10th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
To see the wood for the trees: mining frequent tree patterns
Proceedings of the 2004 European conference on Constraint-Based Mining and Inductive Databases
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
Mining frequent patterns from XML data: Efficient algorithms and design trade-offs
Expert Systems with Applications: An International Journal
Frequent approximate subgraphs as features for graph-based image classification
Knowledge-Based Systems
Using trees to mine multirelational databases
Data Mining and Knowledge Discovery
Mining patterns from longitudinal studies
ADMA'11 Proceedings of the 7th international conference on Advanced Data Mining and Applications - Volume Part II
| Hi-index | 0.00 |
The use of non-linear data structures is becoming more and more common in many data mining scenarios. Trees, in particular, have drawn the attention of researchers as the simplest of non-linear data structures. Many tree mining algorithms have been proposed in the literature and this paper surveys some of the recent work that has been performed in this area. We examine some of the most relevant tree mining algorithms and compare them in order to highlight their similarities and differences.