Exploratory mining and pruning optimizations of constrained associations rules
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Levelwise Search and Borders of Theories in KnowledgeDiscovery
Data Mining and Knowledge Discovery
Universally Quantified Interval Constraints
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Pattern Detection and Discovery
Proceedings of the ESF Exploratory Workshop on Pattern Detection and Discovery
A Theory of Inductive Query Answering
ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
Constraint Logic Programming using Eclipse
Constraint Logic Programming using Eclipse
Constraint programming for itemset mining
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Discovering Knowledge from Local Patterns with Global Constraints
ICCSA '08 Proceedings of the international conference on Computational Science and Its Applications, Part II
The Chosen Few: On Identifying Valuable Patterns
ICDM '07 Proceedings of the 2007 Seventh IEEE International Conference on Data Mining
Correlated itemset mining in ROC space: a constraint programming approach
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Consistency techniques for numeric CSPs
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Efficient mining under rich constraints derived from various datasets
KDID'06 Proceedings of the 5th international conference on Knowledge discovery in inductive databases
A framework for pattern-based global models
IDEAL'09 Proceedings of the 10th international conference on Intelligent data engineering and automated learning
PKDD'06 Proceedings of the 10th European conference on Principle and Practice of Knowledge Discovery in 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
A survey on condensed representations for frequent sets
Proceedings of the 2004 European conference on Constraint-Based Mining and Inductive Databases
Mining a new fault-tolerant pattern type as an alternative to formal concept discovery
ICCS'06 Proceedings of the 14th international conference on Conceptual Structures: inspiration and Application
Constraint programming for mining n-ary patterns
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
A relational view of pattern discovery
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I
| Hi-index | 0.00 |
A well-known limitation of a lot of data mining methods is the huge number of patterns which are discovered: these large outputs hamper the individual and global analysis performed by the end-users of data. That is why discovering patterns of higher level is an active research field. In this paper, we investigate the relationship between local constraint-based mining and constraint satisfaction problems and we propose an approach to model and mine patterns combining several local patterns, i.e., patterns defined by n-ary constraints. The user specifies a set of n-ary constraints and a constraint solver generates the whole set of solutions. Our approach takes benefit from the recent progress on mining local patterns by pushing with a solver on local patterns all local constraints which can be inferred from the n-ary ones. This approach enables us to model in a flexible way any set of constraints combining several local patterns. Experiments show the feasibility of our approach.