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
Regular path queries with constraints
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
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
Compact labeling schemes for ancestor queries
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
On supporting containment queries in relational database management systems
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Molecular feature mining in HIV data
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Complete Mining of Frequent Patterns from Graphs: Mining Graph Data
Machine Learning
Optimizing Regular Path Expressions Using Graph Schemas
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
Counting Twig Matches in a Tree
Proceedings of the 17th International Conference on Data Engineering
Indexing and Querying XML Data for Regular Path Expressions
Proceedings of the 27th 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
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
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
An Efficient Algorithm for Discovering Frequent Subgraphs
IEEE Transactions on Knowledge and Data Engineering
A new efficient probabilistic model for mining labeled ordered trees
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Searching for high-support itemsets in itemset trees
Intelligent Data Analysis
Soft constraint based pattern mining
Data & Knowledge Engineering
Discovering Frequent Agreement Subtrees from Phylogenetic Data
IEEE Transactions on Knowledge and Data Engineering
A new efficient probabilistic model for mining labeled ordered trees applied to glycobiology
ACM Transactions on Knowledge Discovery from Data (TKDD)
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
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
RAM: Randomized Approximate Graph Mining
SSDBM '08 Proceedings of the 20th international conference on Scientific and Statistical Database Management
An integrated, generic approach to pattern mining: data mining template library
Data Mining and Knowledge Discovery
FFTM: optimized frequent tree mining with soft embedding constraints on siblings
CSTST '08 Proceedings of the 5th international conference on Soft computing as transdisciplinary science and technology
Efficient algorithms for incremental maintenance of closed sequential patterns in large databases
Data & Knowledge Engineering
Mining Unordered Distance-Constrained Embedded Subtrees
DS '08 Proceedings of the 11th International Conference on Discovery Science
KES '07 Knowledge-Based Intelligent Information and Engineering Systems and the XVII Italian Workshop on Neural Networks on Proceedings of the 11th International Conference
U3 - Mning Unordered Embedded Subtrees Using TMG Candidate Generation
WI-IAT '08 Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 01
Incremental sequence-based frequent query pattern mining from XML queries
Data Mining and Knowledge Discovery
Efficient rule based structural algorithms for classification of tree structured data
Intelligent Data Analysis
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
Effective, design-independent XML keyword search
Proceedings of the 18th ACM conference on Information and knowledge management
Partitioning and scheduling of task graphs on partially dynamically reconfigurable FPGAs
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
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
Personalizing queries based on networks of composite preferences
ACM Transactions on Database Systems (TODS)
Keyword search for data-centric XML collections with long text fields
Proceedings of the 13th International Conference on Extending Database Technology
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
Mining maximal frequent subtrees with lists-based pattern-growth method
APWeb'08 Proceedings of the 10th Asia-Pacific web conference on Progress in WWW research and development
POTMiner: mining ordered, unordered, and partially-ordered trees
Knowledge and Information Systems
A statistical interestingness measures for XML based association rules
PRICAI'10 Proceedings of the 11th Pacific Rim international conference on Trends in artificial intelligence
Information extraction using XPath
KES'10 Proceedings of the 14th international conference on Knowledge-based and intelligent information and engineering systems: Part III
Double-layered schema integration of heterogeneous XML sources
Journal of Systems and Software
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
Using structural information in XML keyword search effectively
ACM Transactions on Database Systems (TODS)
A data mining approach to XML dissemination
WISE'10 Proceedings of the 11th international conference on Web information systems engineering
Mining frequent patterns from XML data: Efficient algorithms and design trade-offs
Expert Systems with Applications: An International Journal
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
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
Knowledge hiding from tree and graph databases
Data & Knowledge Engineering
Using trees to mine multirelational databases
Data Mining and Knowledge Discovery
PRIB'06 Proceedings of the 2006 international conference on Pattern Recognition in Bioinformatics
Mining patterns from longitudinal studies
ADMA'11 Proceedings of the 7th international conference on Advanced Data Mining and Applications - Volume Part II
XML document clustering using structure-preserving flat representation of XML content and structure
ADMA'11 Proceedings of the 7th international conference on Advanced Data Mining and Applications - Volume Part II
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
Mining frequent association tag sequences for clustering XML documents
APWeb'12 Proceedings of the 14th Asia-Pacific international conference on Web Technologies and Applications
Identifying rogue taxa through reduced consensus: NP-Hardness and exact algorithms
ISBRA'12 Proceedings of the 8th international conference on Bioinformatics Research and Applications
A framework for application of tree-structured data mining to process log analysis
IDEAL'12 Proceedings of the 13th international conference on Intelligent Data Engineering and Automated Learning
Mining Induced/Embedded Subtrees using the Level of Embedding Constraint
Fundamenta Informaticae
Interactive pattern mining on hidden data: a sampling-based solution
Proceedings of the 21st ACM international conference on Information and knowledge management
X-Class: Associative Classification of XML Documents by Structure
ACM Transactions on Information Systems (TOIS)
Hierarchical clustering of XML documents focused on structural components
Data & Knowledge Engineering
Graph-Based Modelling of Concurrent Sequential Patterns
International Journal of Data Warehousing and Mining
Meme ranking to maximize posts virality in microblogging platforms
Journal of Intelligent Information Systems
Discovering interesting information with advances in web technology
ACM SIGKDD Explorations Newsletter
Interesting event detection through hall of fame rankings
Proceedings of the ACM SIGMOD Workshop on Databases and Social Networks
Mining frequent graph patterns with differential privacy
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
The essence of knowledge (bases) through entity rankings
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
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 trees is very useful in domains like bioinformatics, Web mining, mining semistructured data, etc. We formulate the problem of mining (embedded) subtrees in a forest of rooted, labeled, and ordered trees. We present TreeMiner, a novel algorithm to discover all frequent subtrees in a forest, using a new data structure called scope-list. We contrast TreeMiner with a pattern matching tree mining algorithm (PatternMatcher), and we also compare it with TreeMinerD, which counts only distinct occurrences of a pattern. We conduct detailed experiments to test the performance and scalability of these methods. We also use tree mining to analyze RNA structure and phylogenetics data sets from bioinformatics domain.