Fast discovery of association rules
Advances in knowledge discovery and data mining
Exploratory mining and pruning optimizations of constrained associations rules
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Efficient mining of association rules using closed itemset lattices
Information Systems
Efficient mining of emerging patterns: discovering trends and differences
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
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
Mining All Non-derivable Frequent Itemsets
PKDD '02 Proceedings of the 6th European Conference on Principles of Data Mining and Knowledge Discovery
Using Condensed Representations for Interactive Association Rule Mining
PKDD '02 Proceedings of the 6th European Conference on Principles of Data Mining and Knowledge Discovery
On Supporting Interactive Association Rule Mining
DaWaK 2000 Proceedings of the Second International Conference on Data Warehousing and Knowledge Discovery
Mining Free Itemsets under Constraints
IDEAS '01 Proceedings of the International Database Engineering & Applications Symposium
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
Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets
CL '00 Proceedings of the First International Conference on Computational Logic
DualMiner: a dual-pruning algorithm for itemsets with constraints
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
A Theory of Inductive Query Answering
ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
Using transposition for pattern discovery from microarray data
DMKD '03 Proceedings of the 8th ACM SIGMOD workshop on Research issues in 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
Optimization of association rule mining queries
Intelligent Data Analysis
The levelwise version space algorithm and its application to molecular fragment finding
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
Mining constraint-based patterns using automatic relaxation
Intelligent Data Analysis
Efficient mining under rich constraints derived from various datasets
KDID'06 Proceedings of the 5th international conference on Knowledge discovery in inductive databases
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
| Hi-index | 0.01 |
Recently, different works proposed a new way to mine patterns in databases with pathological size. For example, experiments in genome biology usually provide databases with thousands of attributes (genes) but only tens of objects (experiments). In this case, mining the “transposed” database runs through a smaller search space, and the Galois connection allows to infer the closed patterns of the original database. We focus here on constrained pattern mining for those unusual databases and give a theoretical framework for database and constraint transposition. We discuss the properties of constraint transposition and look into classical constraints. We then address the problem of generating the closed patterns of the original database satisfying the constraint, starting from those mined in the “transposed” database. Finally, we show how to generate all the patterns satisfying the constraint from the closed ones.