2010 | OriginalPaper | Buchkapitel
Generalizing Itemset Mining in a Constraint Programming Setting
verfasst von : Jérémy Besson, Jean-François Boulicaut, Tias Guns, Siegfried Nijssen
Erschienen in: Inductive Databases and Constraint-Based Data Mining
Verlag: Springer New York
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
In recent years, a large number of algorithms have been proposed for finding set patterns in boolean 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.