Constraint programming for itemset mining

By Luc De Raedt, Tias Guns, Siegfried Nijssen. 2008

171 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Computer Networks and Communications, Information Systems

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Tias Guns
2. Luc De Raedt
3. Siegfried Nijssen
4. Sicco Verwer
5. Yingqian Zhang
6. Peter James Stuckey
7. Emir Demirovi'c

In Computer Networks and Communications

1. Luc De Raedt
2. Tias Guns
3. Siegfried Nijssen
4. Yingqian Zhang
5. Sicco Verwer
6. Mohammed J. Zaki

In Information Systems

1. Luc De Raedt
2. Tias Guns
3. Siegfried Nijssen
4. Sicco Verwer
5. Yingqian Zhang
6. Peter James Stuckey
7. Emir Demirovi'c
8. Cynthia Rudin

Citations in the corpus

• Correlated itemset mining in ROC space: a constraint programming approach (2009, unknown): “In [10] we studied how to formalize constrained itemset mining in CP systems.”
• Constraint Programming for Data Mining and Machine Learning (2010, methodology): “In (De Raedt, Guns, and Nijssen 2008) we showed that we can formulate the problem of frequent itemset mining in CP Algorithm 1 Essence’ model of frequent itemset mining 1: given NrT, NrI : int 2: given TDB : matrix indexed by [int(1..NrT),int(1..NrI)] of int(0..1) 3: given Freq : int 4: find Items…”