O(n2.5) time algorithms for the subgraph homeomorphism problem on trees
Journal of Algorithms
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
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
Indexing and Mining Free Trees
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
Indexing and Mining Free Trees
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
Frequent free tree discovery in graph data
Proceedings of the 2004 ACM symposium on Applied computing
SPIN: mining maximal frequent subgraphs from graph databases
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
Key semantics extraction by dependency tree mining
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
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
Discovering frequent geometric subgraphs
Information Systems
Efficient mining of frequent XML query patterns with repeating-siblings
Information and Software Technology
Fuzzy Tree Mining: Go Soft on Your Nodes
IFSA '07 Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing
Mining Frequent Closed Unordered Trees Through Natural Representations
ICCS '07 Proceedings of the 15th international conference on Conceptual Structures: Knowledge Architectures for Smart Applications
An integrated, generic approach to pattern mining: data mining template library
Data Mining and Knowledge Discovery
Bottom-up discovery of frequent rooted unordered subtrees
Information Sciences: an International Journal
KES '07 Knowledge-Based Intelligent Information and Engineering Systems and the XVII Italian Workshop on Neural Networks on Proceedings of the 11th International Conference
FTMnodes: Fuzzy tree mining based on partial inclusion
Fuzzy Sets and Systems
Efficient rule based structural algorithms for classification of tree structured data
Intelligent Data Analysis
BUXMiner: an efficient bottom-up approach to mining XML query patterns
APWeb/WAIM'07 Proceedings of the joint 9th Asia-Pacific web and 8th international conference on web-age information management conference on Advances in data and web management
Mining closed frequent free trees in graph databases
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
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
Information extraction using XPath
KES'10 Proceedings of the 14th international conference on Knowledge-based and intelligent information and engineering systems: Part III
Frequent tree pattern mining: A survey
Intelligent Data Analysis
Mining graphs with constraints on symmetry and diameter
WAIM'10 Proceedings of the 2010 international conference on Web-age information management
Mining frequent trees based on topology projection
APWeb'05 Proceedings of the 7th Asia-Pacific web conference on Web Technologies Research and Development
Finding trees from unordered 0–1 data
PKDD'06 Proceedings of the 10th European conference on Principle and Practice of Knowledge Discovery in Databases
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
To see the wood for the trees: mining frequent tree patterns
Proceedings of the 2004 European conference on Constraint-Based Mining and Inductive Databases
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 of closed frequent subtrees from frequently updated databases
Intelligent Data Analysis
| Hi-index | 0.00 |
Tree structures are used extensively in domains such ascomputational biology, pattern recognition, computer networks,and so on. In this paper, we present an indexing techniquefor free trees and apply this indexing technique to theproblem of mining frequent subtrees. We first define a novelrepresentation, the canonical form, for rooted trees and extendthe definition to free trees. We also introduce anotherconcept, the canonical string, as a simpler representationfor free trees in their canonical forms. We then apply ourtree indexing technique to the frequent subtree mining problemand present FreeTreeMiner, a computationally efficientalgorithm that discovers all frequently occurring subtreesin a database of free trees. We study the performance andthe scalability of our algorithms through extensive experimentsbased on both synthetic data and datasets from tworeal applications: a dataset of chemical compounds and adataset of Internet multicast trees.