Constraint Programming for Itemset Mining with Multiple Minimum Supports

2021 ◽  
Author(s):  
Mohamed-Bachir Belaid ◽  
Nadjib Lazaar
Keyword(s):  
Constraint Programming ◽  
Itemset Mining ◽  
Multiple Minimum Supports

scholarly journals Itemset mining: A constraint programming perspective

2011 ◽  
Vol 175 (12-13) ◽  
pp. 1951-1983 ◽  
Author(s):  
Tias Guns ◽  
Siegfried Nijssen ◽  
Luc De Raedt
Keyword(s):  
Constraint Programming ◽  
Itemset Mining

scholarly journals Generalizing Itemset Mining in a Constraint Programming Setting

2010 ◽  
pp. 107-126 ◽  
Author(s):  
Jérémy Besson ◽  
Jean-François Boulicaut ◽  
Tias Guns ◽  
Siegfried Nijssen
Keyword(s):  
Constraint Programming ◽  
Itemset Mining

scholarly journals Constraint Programming for Mining Borders of Frequent Itemsets

2019 ◽  
Author(s):  
Mohamed-Bachir Belaid ◽  
Christian Bessiere ◽  
Nadjib Lazaar
Keyword(s):  
Constraint Programming ◽  
Frequent Itemsets ◽  
Frequent Itemset ◽  
Global Constraints ◽  
Itemset Mining ◽  
Generic Framework ◽  
Maximal Frequent Itemsets ◽  
Csp Solving ◽  
Additional Constraints ◽  
Simple Parameter

Frequent itemset mining is one of the most studied tasks in knowledge discovery. It is often reduced to mining the positive border of frequent itemsets, i.e. maximal frequent itemsets. Infrequent itemset mining, on the other hand, can be reduced to mining the negative border, i.e. minimal infrequent itemsets. We propose a generic framework based on constraint programming to mine both borders of frequent itemsets.One can easily decide which border to mine by setting a simple parameter. For this, we introduce two new global constraints, FREQUENTSUBS and INFREQUENTSUPERS, with complete polynomial propagators. We then consider the problem of mining borders with additional constraints. We prove that this problem is coNP-hard, ruling out the hope for the existence of a single CSP solving this problem (unless coNP ⊆ NP).

A Method of Train Regulation Planning by the Constraint Programming Using Train Regulation Knowledge

2010 ◽  
Vol 130 (2) ◽  
pp. 332-342 ◽  
Author(s):  
Shuichiro Sakikawa ◽  
Tatsuhiro Sato ◽  
Toyohisa Morita ◽  
Kenji Ohta
Keyword(s):  
Constraint Programming
Sign in / Sign up

Export Citation Format

Share Document