Constraint programming for itemset mining

130Citations
Citations of this article
64Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The relationship between constraint-based mining and constraint programming is explored by showing how the typical constraints used in pattern mining can be formulated for use in constraint programming environments. The resulting framework is surprisingly flexible and allows us to combine a wide range of mining constraints in different ways. We implement this approach in off-the-shelf constraint programming systems and evaluate it empirically. The results show that the approach is not only very expressive, but also works well on complex benchmark problems. Copyright 2008 ACM.

Author supplied keywords

Cite

CITATION STYLE

APA

De Raedt, L., Guns, T., & Nijssen, S. (2008). Constraint programming for itemset mining. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 204–212). https://doi.org/10.1145/1401890.1401919

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free