Term-weighting approaches in automatic text retrieval
Information Processing and Management: an International Journal
Levelwise Search and Borders of Theories in KnowledgeDiscovery
Data Mining and Knowledge Discovery
Free-Sets: A Condensed Representation of Boolean Data for the Approximation of Frequency Queries
Data Mining and Knowledge Discovery
Mining Frequent Item Sets with Convertible Constraints
Proceedings of the 17th 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
DualMiner: A Dual-Pruning Algorithm for Itemsets with Constraints
Data Mining and Knowledge Discovery
Carpenter: finding closed patterns in long biological datasets
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Mining Plausible Patterns from Genomic Data
CBMS '06 Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems
Database transposition for constrained (closed) pattern mining
KDID'04 Proceedings of the Third international conference on Knowledge Discovery in Inductive Databases
Proceedings of the 9th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
PAKDD'05 Proceedings of the 9th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
Pushing tougher constraints in frequent pattern mining
PAKDD'05 Proceedings of the 9th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
An efficient framework for mining flexible constraints
PAKDD'05 Proceedings of the 9th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
Mining frequent δ-free patterns in large databases
DS'05 Proceedings of the 8th international conference on Discovery Science
Exploiting virtual patterns for automatically pruning the search space
KDID'05 Proceedings of the 4th international conference on Knowledge Discovery in Inductive Databases
Discovering Emerging Graph Patterns from Chemicals
ISMIS '09 Proceedings of the 18th International Symposium on Foundations of Intelligent Systems
Transactions on rough sets XII
Constraint programming for mining n-ary patterns
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Extracting and summarizing the frequent emerging graph patterns from a dataset of graphs
Journal of Intelligent Information Systems
Combining CSP and constraint-based mining for pattern discovery
ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part II
| Hi-index | 0.00 |
Mining patterns under many kinds of constraints is a key point to successfully get new knowledge. In this paper, we propose an efficient new algorithm MUSIC-DFS which soundly and completely mines patterns with various constraints from large data and takes into account external data represented by several heterogeneous datasets. Constraints are freely built of a large set of primitives and enable to link the information scattered in various knowledge sources. Efficiency is achieved thanks to a new closure operator providing an interval pruning strategy applied during the depth-first search of a pattern space. A transcriptomic case study shows the effectiveness and scalability of our approach. It also demonstrates a way to employ background knowledge, such as free texts or gene ontologies, in the discovery of meaningful patterns.