Sciweavers

90 search results - page 1 / 18
» Constraint programming for itemset mining
Sort
View
KDD
2008
ACM
146views Data Mining» more  KDD 2008»
14 years 4 months ago
Constraint programming for itemset mining
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 ...
Luc De Raedt, Tias Guns, Siegfried Nijssen
KDD
2009
ACM
202views Data Mining» more  KDD 2009»
14 years 4 months ago
Correlated itemset mining in ROC space: a constraint programming approach
Correlated or discriminative pattern mining is concerned with finding the highest scoring patterns w.r.t. a correlation measure (such as information gain). By reinterpreting corre...
Siegfried Nijssen, Tias Guns, Luc De Raedt
VLDB
2000
ACM
130views Database» more  VLDB 2000»
13 years 7 months ago
Mining Frequent Itemsets Using Support Constraints
Interesting patterns often occur at varied levels of support. The classic association mining based on a uniform minimum support, such as Apriori, either misses interesting pattern...
Ke Wang, Yu He, Jiawei Han
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 4 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
PAKDD
2004
ACM
164views Data Mining» more  PAKDD 2004»
13 years 9 months ago
FP-Bonsai: The Art of Growing and Pruning Small FP-Trees
Abstract. In the context of mining frequent itemsets, numerous strategies have been proposed to push several types of constraints within the most well known algorithms. In this pap...
Francesco Bonchi, Bart Goethals