CLIP: concept learning from inference patterns
Artificial Intelligence - Special issue: AI research in Japan
Ordered and Unordered Tree Inclusion
SIAM Journal on Computing
Fast discovery of association rules
Advances in knowledge discovery and data mining
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
Tree pattern matching and subset matching in deterministic O(n log3 n)-time
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Journal of Algorithms
Molecular feature mining in HIV data
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
Efficiently mining frequent trees in a forest
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and 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
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
SSDBM '04 Proceedings of the 16th International Conference on Scientific and Statistical Database Management
Efficient Mining of High Branching Factor Attribute Trees
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
PORSCHE: Performance ORiented SCHEma mediation
Information Systems
Improving XML Querying with Maximal Frequent Query Patterns
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007
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
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
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
Tree mining: Equivalence classes for candidate generation
Intelligent Data Analysis
Frequent Itemset Mining in Multirelational Databases
ISMIS '09 Proceedings of the 18th International Symposium on Foundations of Intelligent Systems
Mining Musical Patterns: Identification of Transposed Motives
ISMIS '09 Proceedings of the 18th International Symposium on Foundations of Intelligent Systems
Complex Schema Match Discovery and Validation through Collaboration
OTM '09 Proceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on On the Move to Meaningful Internet Systems: Part I
Mining flexible association rules from XML
Proceedings of the 2009 EDBT/ICDT Workshops
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
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
Hierarchical program representation for program element matching
IDEAL'07 Proceedings of the 8th international conference on Intelligent data engineering and automated learning
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
FVC: a feature-vector-based classification for XML dissemination
DASFAA'10 Proceedings of the 15th international conference on Database systems for advanced applications
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
Model guided algorithm for mining unordered embedded subtrees
Web Intelligence and Agent Systems
Mining transposed motifs in music
Journal of Intelligent Information Systems
ALES: An innovative agent-based learning environment to teach argumentation
International Journal of Knowledge-based and Intelligent Engineering Systems
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
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 |
Mining frequent trees is very useful in domains like bioinformatics, web mining, mining semi-structured data, and so on. In this paper we introduce SLEUTH, an efficient algorithm for mining frequent, unordered, embedded subtrees in a database of labeled trees. The key contributions of our work are as follows: We give the first algorithm that enumerates all embedded, unordered trees. We propose a new equivalence class extension scheme to generate all candidate trees. We extend the notion of scope-list joins to compute frequency of unordered trees. We conduct performance evaluation on several synthetic and real datasets to show that SLEUTH is an efficient algorithm, which has performance comparable to TreeMiner, that mines only ordered trees.