Constraint programming for data mining and machine learning

Proceedings of the National Conference on Artificial Intelligence

Volumn 3, Issue , 2010, Pages 1671-1675

  De Raedt, Luc ^a   Guns, Tias ^a   Nijssen, Siegfried ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER PROGRAMMING; CONSTRAINT THEORY; LEARNING SYSTEMS;

CONSTRAINT PROGRAMMING; CONSTRAINT-BASED MINING; LEARNING PATTERNS; LEARNING PROBLEM; MINING PROBLEMS; PATTERN MINING; RULE LEARNING; STATE OF THE ART;

DATA MINING;

EID: 77958563773     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. Agrawal, R.; Mannila, H.; Srikant, R.; Toivonen, H.; and Verkamo, A. I. 1996. Fast discovery of association rules. In Advances in Knowledge Discovery and Data Mining, 307-328. AAAI Press.
2. Bessiere, C; Hebrard, E.; and O'Sullivan, B. 2009. Min imising decision tree size as combinatorial optimisation. In Gent, I. P., ed., CP, volume 5732 of Lecture Notes in Computer Science, 173-187. Springer.
3. Bonchi, F., and Lucchese, C. 2007. Extending the state-of-the-art of constraint-based pattern discovery. Data Knowl. Eng. 60(2):377-399.
4. Bucila, C.; Gehrke, J.; Kifer, D.; and White, W. M. 2003. Dualminer: A dual-pruning algorithm for itemsets with constraints. DataMin. Knowl. Discov. 7(3):241-272.
5. Chang, M.-W.; Ratinov, L.-A.; Rizzolo, N.; and Roth, D. 2008. Learning and inference with constraints. In Fox, D., and Gomes, C. P., eds., AAAI, 1513-1518. AAAI Press.
6. Cheng, H.; Yan, X.; Han, J.; and Yu, P. 2008. Direct discriminative pattern mining for effective classification. In ICDE, 169-178.
7. Cussens, J. 2008. Bayesian network learning by compiling to weighted max-sat. In McAllester, D. A., and Myllymäki, P., eds., UAI, 105-112. AUAI Press.
8. De Raedt, L., and Zimmermann, A. 2007. Constraint-based pattern set mining. In SDM. SIAM.
9. De Raedt, L.; Guns, T.; and Nijssen, S. 2008. Constraint programming for itemset mining. In KDD, 204-212.
10. Fürnkranz, J., and Flach, P. A. 2005. ROC 'n' rule learning - towards a better understanding of covering algorithms. Machine Learning 58(1):39-77.
11. Ganter, B.; Stumme, G.; and Wille, R. 2005. Formal Concept Analysis: Foundations and Applications, volume 3626 of Lecture Notes in Artificial Intelligence.
12. Goethals, B., and Zaki, M. J. 2004. Advances in frequent itemset mining implementations: report on FIMI'03. In SIGKDD Explorations Newsletter, volume 6, 109-117.
13. Morishita, S., and Sese, J. 2000. Traversing itemset lattice with statistical metric pruning. In PODS, 226-236.
14. Nijssen, S., and Fromont, E. 2007. Mining optimal decision trees from itemset lattices. In KDD, 530-539.
15. Nijssen, S.; Guns, T.; and De Raedt, L. 2009. Correlated itemset mining in ROC space: A constraint programming approach. In KDD, 647-656.
16. Pasquier, N.; Bastide, Y; Taouil, R.; and Lakhal, L. 1999. Discovering frequent closed itemsets for association rules. In ICDT, 398-416.
17. Quinlan, J. R. 1990. Learning logical definitions from relations. Machine Learning 5:239-266.
18. Rossi, F.; van Beek, P.; and Walsh, T. 2006. Handbook of Constraint Programming (Foundations of Artificial Intelligence). Elsevier Science Inc.
19. Schulte, C, and Stuckey, P. 2008. Efficient constraint propagation engines. ACM Trans. Program. Lang. Syst. 31(1).