World Wide Web Journal - Special issue on XML: principles, tools, and techniques
Pruning and summarizing the discovered associations
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
DTD inference for views of XML data
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Small is beautiful: discovering the minimal set of unexpected patterns
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Automata theory for XML researchers
ACM SIGMOD Record
Mining Sequential Patterns: Generalizations and Performance Improvements
EDBT '96 Proceedings of the 5th International Conference on Extending Database Technology: Advances in Database Technology
SPIRIT: Sequential Pattern Mining with Regular Expression Constraints
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Efficiently mining frequent trees in a forest
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
XQuery from the Experts: A Guide to the W3C XML Query Language
XQuery from the Experts: A Guide to the W3C XML Query Language
Web usage mining: discovery and application of interesting patterns from web data
Web usage mining: discovery and application of interesting patterns from web data
Chopper: efficient algorithm for tree mining
Journal of Computer Science and Technology
Taxonomy of XML schema languages using formal language theory
ACM Transactions on Internet Technology (TOIT)
TRIPS and TIDES: new algorithms for tree mining
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Constraint-Based Mining and Inductive Databases: European Workshop on Inductive Databases and Constraint Based Mining, Hinterzarten, Germany, March 11-13, ... / Lecture Notes in Artificial Intelligence)
Computational aspects of mining maximal frequent patterns
Theoretical Computer Science
First-order temporal pattern mining with regular expression constraints
Data & Knowledge Engineering
Efficient mining of XML query patterns for caching
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Mining frequent logical sequences with SPIRIT-LoG
ILP'02 Proceedings of the 12th international conference on Inductive logic programming
Constraint relaxations for discovering unknown sequential patterns
KDID'04 Proceedings of the Third international conference on Knowledge Discovery in Inductive Databases
Mining first-order temporal interval patterns with regular expression constraints
DaWaK'07 Proceedings of the 9th international conference on Data Warehousing and Knowledge Discovery
Money in trees: How memes, trees, and isolation can optimize financial portfolios
Information Sciences: an International Journal
Hi-index | 0.00 |
Most work on pattern mining focuses on simple data structures such as itemsets and sequences of itemsets. However, a lot of recent applications dealing with complex data like chemical compounds, protein structures, XML and Web log databases and social networks, require much more sophisticated data structures such as trees and graphs. In these contexts, interesting patterns involve not only frequent object values (labels) appearing in the graphs (or trees) but also frequent specific topologies found in these structures. Recently, several techniques for tree and graph mining have been proposed in the literature. In this paper, we focus on constraint-based tree pattern mining. We propose to use tree automata as a mechanism to specify user constraints over tree patterns. We present the algorithm CoBMiner which allows user constraints specified by a tree automata to be incorporated in the mining process. An extensive set of experiments executed over synthetic and real data (XML documents and Web usage logs) allows us to conclude that incorporating constraints during the mining process is far more effective than filtering the interesting patterns after the mining process.