Constant time generation of free trees
SIAM Journal on Computing
O(n2.5) time algorithms for the subgraph homeomorphism problem on trees
Journal of Algorithms
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Discovering typical structures of documents: a road map approach
Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval
Journal of Algorithms
Mining frequent patterns without candidate generation
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Algorithms on Trees and Graphs
Algorithms on Trees and Graphs
Discovery of Frequent Episodes in Event Sequences
Data Mining and Knowledge Discovery
Mining Sequential Patterns: Generalizations and Performance Improvements
EDBT '96 Proceedings of the 5th International Conference on Extending Database Technology: Advances in Database Technology
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
ATreeGrep: Approximate Searching in Unordered Trees
SSDBM '02 Proceedings of the 14th International Conference on Scientific and Statistical Database Management
Aggregated Multicast - A Comparative Study
NETWORKING '02 Proceedings of the Second International IFIP-TC6 Networking Conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; and Mobile and Wireless Communications
Efficiently mining frequent trees in a forest
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Mining Frequent Quer Patterns from XML Queries
DASFAA '03 Proceedings of the Eighth International Conference on Database Systems for Advanced Applications
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
Indexing and Mining Free Trees
ICDM '03 Proceedings of the Third 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
Efficient Data Mining for Maximal Frequent Subtrees
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
XRules: an effective structural classifier for XML data
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Fast vertical mining using diffsets
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
Unordered Tree Mining with Applications to Phylogeny
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
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
Mining Closed and Maximal Frequent Subtrees from Databases of Labeled Rooted Trees
IEEE Transactions on Knowledge and Data Engineering
Discovering Frequent Graph Patterns Using Disjoint Paths
IEEE Transactions on Knowledge and Data Engineering
XML schema clustering with semantic and hierarchical similarity measures
Knowledge-Based Systems
Out-of-core coherent closed quasi-clique mining from large dense graph databases
ACM Transactions on Database Systems (TODS)
FAT-miner: mining frequent attribute trees
Proceedings of the 2007 ACM symposium on Applied computing
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 heuristic algorithm for clustering rooted ordered trees
Intelligent Data Analysis
Tree model guided candidate generation for mining frequent subtrees from XML documents
ACM Transactions on Knowledge Discovery from Data (TKDD)
PCITMiner: prefix-based closed induced tree miner for finding closed induced frequent subtrees
AusDM '07 Proceedings of the sixth Australasian conference on Data mining and analytics - Volume 70
Inductive Logic Programming
Mining Frequent Closed Unordered Trees Through Natural Representations
ICCS '07 Proceedings of the 15th international conference on Conceptual Structures: Knowledge Architectures for Smart Applications
Clustering XML Documents Using Closed Frequent Subtrees: A Structural Similarity Approach
Focused Access to XML Documents
Efficient Frequent Connected Subgraph Mining in Graphs of Bounded Treewidth
ECML PKDD '08 Proceedings of the 2008 European Conference on Machine Learning and Knowledge Discovery in Databases - Part I
Comprehensive isomorphic subtree enumeration
CASES '08 Proceedings of the 2008 international conference on Compilers, architectures and synthesis for embedded systems
Efficient algorithms for incremental maintenance of closed sequential patterns in large databases
Data & Knowledge Engineering
Automatic Extraction of Structurally Coherent Mini-Taxonomies
ER '08 Proceedings of the 27th International Conference on Conceptual Modeling
An Experimental Comparison of Different Inclusion Relations in Frequent Tree Mining
Fundamenta Informaticae - Progress on Multi-Relational Data Mining
Mining Mutually Dependent Ordered Subtrees in Tree Databases
New Frontiers in Applied Data Mining
Mining Evolving Learning Algorithms
EuroGP '09 Proceedings of the 12th European Conference on Genetic Programming
Efficient rule based structural algorithms for classification of tree structured data
Intelligent Data Analysis
A lower bound on the sample size needed to perform a significant frequent pattern mining task
Pattern Recognition Letters
Process of applying data mining techniques to XML data
Proceedings of the 2006 conference on Advances in Intelligent IT: Active Media Technology 2006
Towards identifying salient patterns in genetic programming individuals
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Tree mining: Equivalence classes for candidate generation
Intelligent Data Analysis
Clone detection via structural abstraction
Software Quality Control
Frequent Itemset Mining in Multirelational Databases
ISMIS '09 Proceedings of the 18th International Symposium on Foundations of Intelligent Systems
XCFS: an XML documents clustering approach using both the structure and the content
Proceedings of the 18th ACM conference on Information and knowledge management
Mining tree-structured data on multicore systems
Proceedings of the VLDB Endowment
Genetic programming for anticancer therapeutic response prediction using the NCI-60 dataset
Computers and Operations Research
Quantitative analysis of treebanks using frequent subtree mining methods
TextGraphs-4 Proceedings of the 2009 Workshop on Graph-based Methods for Natural Language Processing
Text classification using graph mining-based feature extraction
Knowledge-Based Systems
Integrating decision tree learning into inductive databases
KDID'06 Proceedings of the 5th international conference on Knowledge discovery in inductive databases
Time and space efficient discovery of maximal geometric graphs
DS'07 Proceedings of the 10th international conference on Discovery science
Mining subtrees with frequent occurrence of similar subtrees
DS'07 Proceedings of the 10th international conference on Discovery science
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
EvoBIO'08 Proceedings of the 6th European conference on Evolutionary computation, machine learning and data mining in bioinformatics
Efficient frequent connected subgraph mining in graphs of bounded tree-width
Theoretical Computer Science
MARGIN: Maximal frequent subgraph mining
ACM Transactions on Knowledge Discovery from Data (TKDD)
Inclusion problems in trace monoids
Cybernetics and Systems Analysis
Frequent subgraph mining in outerplanar graphs
Data Mining and Knowledge Discovery
POTMiner: mining ordered, unordered, and partially-ordered trees
Knowledge and Information Systems
Extended VSM for XML document classification using frequent subtrees
INEX'09 Proceedings of the Focused retrieval and evaluation, and 8th international conference on Initiative for the evaluation of XML retrieval
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
Model guided algorithm for mining unordered embedded subtrees
Web Intelligence and Agent Systems
Incremental mining of closed frequent subtrees
DS'10 Proceedings of the 13th international conference on Discovery science
Varro: an algorithm and toolkit for regular structure discovery in treebanks
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics: Posters
Mining association rules from semantic web data
IEA/AIE'10 Proceedings of the 23rd international conference on Industrial engineering and other applications of applied intelligent systems - Volume Part II
Efficient subtree inclusion testing in subtree discovering applications
SMO'05 Proceedings of the 5th WSEAS international conference on Simulation, modelling and optimization
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Finding association rules in semantic web data
Knowledge-Based Systems
PKU at INEX 2010 XML mining track
INEX'10 Proceedings of the 9th international conference on Initiative for the evaluation of XML retrieval: comparative evaluation of focused retrieval
Alternative Approach to Tree-Structured Web Log Representation and Mining
WI-IAT '11 Proceedings of the 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Volume 01
Context and target configurations for mining RDF data
Proceedings of the 1st international workshop on Search and mining entity-relationship data
PrefixTreeESpan: a pattern growth algorithm for mining embedded subtrees
WISE'06 Proceedings of the 7th international conference on Web Information Systems
Finding trees from unordered 0–1 data
PKDD'06 Proceedings of the 10th European conference on Principle and Practice of Knowledge Discovery in Databases
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
Using trees to mine multirelational databases
Data Mining and Knowledge Discovery
Data conceptualisation for web-based data-centred application design
CAiSE'06 Proceedings of the 18th international conference on Advanced Information Systems Engineering
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
WISE'06 Proceedings of the 7th international conference on Web Information Systems
A structure preserving flat data format representation for tree-structured data
PAKDD'11 Proceedings of the 15th international conference on New Frontiers in Applied Data Mining
Computers and Electronics in Agriculture
Identifying rogue taxa through reduced consensus: NP-Hardness and exact algorithms
ISBRA'12 Proceedings of the 8th international conference on Bioinformatics Research and Applications
Out-of-bag discriminative graph mining
Proceedings of the 28th Annual ACM Symposium on Applied Computing
AMIE: association rule mining under incomplete evidence in ontological knowledge bases
Proceedings of the 22nd international conference on World Wide Web
Application of tree-structured data mining for analysis of process logs in XML format
AusDM '12 Proceedings of the Tenth Australasian Data Mining Conference - Volume 134
Hi-index | 0.00 |
Mining frequent subtrees from databases of labeled trees is a new research field that has many practical applications in areas such as computer networks, Web mining, bioinformatics, XML document mining, etc. These applications share a requirement for the more expressive power of labeled trees to capture the complex relations among data entities. Although frequent subtree mining is a more difficult task than frequent itemset mining, most existing frequent subtree mining algorithms borrow techniques from the relatively mature association rule mining area. This paper provides an overview of a broad range of tree mining algorithms. We focus on the common theoretical foundations of the current frequent subtree mining algorithms and their relationship with their counterparts in frequent itemset mining. When comparing the algorithms, we categorize them according to their problem definitions and the techniques employed for solving various subtasks of the subtree mining problem. In addition, we also present a thorough performance study for a representative family of algorithms.