Generalizing Itemset Mining in a Constraint Programming Setting
Résumé
In recent years, a large number of algorithms have been proposed for
finding set patterns in binary data. This includes popular mining
tasks based on, for instance, frequent (closed) itemsets. In this
chapter, we develop a common framework in which these algorithms can
be studied thanks to the principles of constraint programming. We
show how such principles can be applied both in specialized and
general solvers.