Constraint Programming for Data Mining and Machine Learning

Machine learning and data mining have become aware that using constraints when learning patterns and rules can be very useful. To this end, a large number of special purpose systems and techniques have been developed for solving such constraint-based mining and learning problems. These techniques have, so far, been developed independently of the general purpose tools and principles of constraint programming known within the field of artificial intelligence. This paper shows that off-the-shelf constraint programming techniques can be applied to various pattern mining and rule learning problems (cf. also (De Raedt, Guns, and Nijssen 2008; Nijssen, Guns, and De Raedt 2009)). This does not only lead to methodologies that are more general and flexible, but also provides new insights into the underlying mining problems that allow us to improve the state-of-the-art in data mining. Such a combination of constraint programming and data mining raises a number of interesting new questions and challenges.

[1]  Philip S. Yu,et al.  Direct Discriminative Pattern Mining for Effective Classification , 2008, 2008 IEEE 24th International Conference on Data Engineering.

[2]  Luc De Raedt,et al.  Correlated itemset mining in ROC space: a constraint programming approach , 2009, KDD.

[3]  Johannes Fürnkranz,et al.  ROC ‘n’ Rule Learning—Towards a Better Understanding of Covering Algorithms , 2005, Machine Learning.

[4]  Nicolas Pasquier,et al.  Discovering Frequent Closed Itemsets for Association Rules , 1999, ICDT.

[5]  Philip S. Yu,et al.  DirectDiscriminative Pattern Mining forEffective Classification , 2008 .

[6]  Barry O'Sullivan,et al.  Minimising Decision Tree Size as Combinatorial Optimisation , 2009, CP.

[7]  Ming-Wei Chang,et al.  Learning and Inference with Constraints , 2008, AAAI.

[8]  Luc De Raedt,et al.  Constraint programming for itemset mining , 2008, KDD.

[9]  J. Ross Quinlan,et al.  Learning logical definitions from relations , 1990, Machine Learning.

[10]  Philippe Balbiani,et al.  Formal Concept Analysis, Foundations and Applications , 2005 .

[11]  瀬々 潤,et al.  Traversing Itemset Lattices with Statistical Metric Pruning (小特集 「発見科学」及び一般演題) , 2000 .

[12]  Siegfried Nijssen,et al.  Mining optimal decision trees from itemset lattices , 2007, KDD '07.

[13]  Luc De Raedt,et al.  Constraint-Based Pattern Set Mining , 2007, SDM.

[14]  Peter J. Stuckey,et al.  Efficient constraint propagation engines , 2006, TOPL.

[15]  F. Bonchi,et al.  Extending the state-of-the-art of constraint-based pattern discovery , 2007, Data Knowl. Eng..

[16]  Shinichi Morishita,et al.  Transversing itemset lattices with statistical metric pruning , 2000, PODS '00.

[17]  Heikki Mannila,et al.  Fast Discovery of Association Rules , 1996, Advances in Knowledge Discovery and Data Mining.

[18]  Toby Walsh,et al.  Handbook of Constraint Programming (Foundations of Artificial Intelligence) , 2006 .

[19]  James Cussens,et al.  Bayesian network learning by compiling to weighted MAX-SAT , 2008, UAI.

[20]  Bart Goethals,et al.  Advances in frequent itemset mining implementations: report on FIMI'03 , 2004, SKDD.

[21]  Toby Walsh,et al.  Handbook of Constraint Programming , 2006, Handbook of Constraint Programming.

[22]  Daniel Kifer,et al.  DualMiner: A Dual-Pruning Algorithm for Itemsets with Constraints , 2002, Data Mining and Knowledge Discovery.