Mining frequent patterns without candidate generation
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Efficient mining of traversal patterns
Data & Knowledge Engineering - Building web warehouse
Algorithmics and applications of tree and graph searching
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient Data Mining for Path Traversal Patterns
IEEE Transactions on Knowledge and Data Engineering
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
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
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
gSpan: Graph-Based Substructure Pattern Mining
ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
The complexity of mining maximal frequent itemsets and maximal frequent patterns
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
Efficiently Mining Frequent Trees in a Forest: Algorithms and Applications
IEEE Transactions on Knowledge and Data Engineering
WAM-Miner: in the search of web access motifs from historical web log data
Proceedings of the 14th ACM international conference on Information and knowledge management
Frequency-based views to pattern collections
Discrete Applied Mathematics - Special issue: Discrete mathematics & data mining II (DM & DM II)
Computational aspects of mining maximal frequent patterns
Theoretical Computer Science
Data & Knowledge Engineering - Special issue: WIDM 2004
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
XML structural delta mining: issues and challenges
Data & Knowledge Engineering - Special issue: ER 2003
Discovering frequent geometric subgraphs
Information Systems
Discovering Frequent Agreement Subtrees from Phylogenetic Data
IEEE Transactions on Knowledge and Data Engineering
An XML-enabled data mining query language: XML-DMQL
International Journal of Business Intelligence and Data Mining
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
Mining Frequent Closed Unordered Trees Through Natural Representations
ICCS '07 Proceedings of the 15th international conference on Conceptual Structures: Knowledge Architectures for Smart Applications
Discovery of Useful Patterns from Tree-Structured Documents with Label-Projected Database
ATC '08 Proceedings of the 5th international conference on Autonomic and Trusted Computing
An integrated, generic approach to pattern mining: data mining template library
Data Mining and Knowledge Discovery
Finding Frequent Patterns from Compressed Tree-Structured Data
DS '08 Proceedings of the 11th International Conference on Discovery Science
Efficient rule based structural algorithms for classification of tree structured data
Intelligent Data Analysis
Mining tree-structured data on multicore systems
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
Mining flexible association rules from XML
Proceedings of the 2009 EDBT/ICDT Workshops
Frequency-based views to pattern collections
Discrete Applied Mathematics - Special issue: Discrete mathematics & data mining II (DM & DM II)
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
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
POTMiner: mining ordered, unordered, and partially-ordered trees
Knowledge and Information Systems
Frequent tree pattern mining: A survey
Intelligent Data Analysis
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
Using trees to mine multirelational databases
Data Mining and Knowledge Discovery
ADMA'05 Proceedings of the First international conference on Advanced Data Mining and Applications
WISE'06 Proceedings of the 7th international conference on Web Information Systems
Mining patterns from longitudinal studies
ADMA'11 Proceedings of the 7th international conference on Advanced Data Mining and Applications - Volume Part II
Identifying rogue taxa through reduced consensus: NP-Hardness and exact algorithms
ISBRA'12 Proceedings of the 8th international conference on Bioinformatics Research and Applications
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
Mining Induced/Embedded Subtrees using the Level of Embedding Constraint
Fundamenta Informaticae
| Hi-index | 0.00 |
A new type of tree mining is defined in this paper,which uncovers maximal frequent induced subtrees from adatabase of unordered labeled trees. A novel algorithm,PathJoin, is proposed. The algorithm uses a compact datastructure, FST-Forest, which compresses the trees and stillkeeps the original tree structure. PathJoin generates candidatesubtrees by joining the frequent paths in FST-Forest.Such candidate subtree generation is localized and thussubstantially reduces the number of candidate subtrees. Experimentswith synthetic data sets show that the algorithmis effective and efficient.