Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
XCache: a semantic caching system for XML queries
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Scalable Algorithms for Association Mining
IEEE Transactions on Knowledge and Data Engineering
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
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
Mining Frequent Quer Patterns from XML Queries
DASFAA '03 Proceedings of the Eighth International Conference on Database Systems for Advanced Applications
Structural Joins: A Primitive for Efficient XML Query Pattern Matching
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Indexing and Mining Free Trees
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
Discovering interesting information in XML data with association rules
Proceedings of the 2003 ACM symposium on Applied computing
Extracting association rules from XML documents using XQuery
WIDM '03 Proceedings of the 5th ACM international workshop on Web information and data management
SSDBM '04 Proceedings of the 16th International Conference on Scientific and Statistical Database Management
Efficiently Mining Frequent Embedded Unordered Trees
Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
XML structural delta mining: issues and challenges
Data & Knowledge Engineering - Special issue: ER 2003
An efficient algorithm for mining frequent inter-transaction patterns
Information Sciences: an International Journal
Incremental and interactive mining of web traversal patterns
Information Sciences: an International Journal
Frequent XML Query Pattern Mining based on FP-TRee
DEXA '07 Proceedings of the 18th International Conference on Database and Expert Systems Applications
Efficient mining of XML query patterns for caching
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Efficient strategies for tough aggregate constraint-based sequential pattern mining
Information Sciences: an International Journal
Efficient mining of frequent XML query patterns with repeating-siblings
Information and Software Technology
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 interesting XML-enabled association rules with templates
KDID'04 Proceedings of the Third international conference on Knowledge Discovery in Inductive Databases
Mining positive and negative association rules from XML query patterns for caching
DASFAA'05 Proceedings of the 10th international conference on Database Systems for Advanced Applications
Association-rules mining based broadcasting approach for XML data
ADVIS'06 Proceedings of the 4th international conference on Advances in Information Systems
An algorithm to mine general association rules from tabular data
Information Sciences: an International Journal
Information Sciences: an International Journal
Mining frequent patterns from XML data: Efficient algorithms and design trade-offs
Expert Systems with Applications: An International Journal
An efficient algorithm of frequent XML query pattern mining for ebXML applications in e-commerce
Expert Systems with Applications: An International Journal
High utility pattern mining using the maximal itemset property and lexicographic tree structures
Information Sciences: an International Journal
Hi-index | 0.07 |
In the past decade, XML has emerged as the standard language for information exchanging over the Internet. Due to its tree-structure paradigm, XML is superior for its capability of storing, querying, and manipulating complex data. Therefore, discovering frequent tree patterns over tree-structured data has become an interesting topic for XML data management. In this paper, we propose a tree mining algorithm, named BUXMiner, for finding a special class of frequent trees, called rooted unordered trees, from a tree-structured database. BUXMiner employs an efficient bottom-up approach to enumerate all candidate trees over a compact global tree guide and computes the frequent trees based on the tree guide. In addition to BUXMiner, we also propose a mining approach called BUMXMiner to discover the maximal frequent rooted unordered trees. We compare BUXMiner with previous tree-structure mining algorithms, namely XQPMinerTID and FastXMiner, which were also proposed to discover rooted unordered trees. The experimental results show that our algorithm outperforms XQPMinerTID and FastXMiner in terms of efficiency. The performance results from real-world applications also indicate the usefulness of our proposed tree mining algorithms in a variety of web applications, such as analysis of web page access patterns and mining frequent XML query patterns for caching.