Mining frequent patterns without candidate generation
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
TreeFinder: a First Step towards XML Data 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 Data Mining for Maximal Frequent Subtrees
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
Multi-relational data mining: an introduction
ACM SIGKDD Explorations Newsletter
CrossMine: Efficient Classification Across Multiple Database Relations
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
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
Cross-relational clustering with user's guidance
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
AMIOT: Induced Ordered Tree Mining in Tree-Structured Databases
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
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
4th International Workshop on Mining Software Repositories (MSR 2007)
ICSE COMPANION '07 Companion to the proceedings of the 29th International Conference on Software Engineering
Hierarchical program representation for program element matching
IDEAL'07 Proceedings of the 8th international conference on Intelligent data engineering and automated learning
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
Mining Tree-Based Frequent Patterns from XML
FQAS '09 Proceedings of the 8th International Conference on Flexible Query Answering Systems
Reverse engineering user interfaces for interactive database conceptual analysis
CAiSE'10 Proceedings of the 22nd international conference on Advanced information systems engineering
Frequent tree pattern mining: A survey
Intelligent Data Analysis
Mining transposed motifs in music
Journal of Intelligent Information Systems
| Hi-index | 0.00 |
Many data mining problems can be represented with non-linear data structures like trees. In this paper, we introduce a scalable algorithm to mine partially-ordered trees. Our algorithm, POTMiner, is able to identify both induced and embedded subtrees and, as special cases, it can handle both completely ordered and completely unordered trees (i.e. the particular situations existing algorithms address).