Constraint Programming for Mining Borders of Frequent Itemsets - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2019

Constraint Programming for Mining Borders of Frequent Itemsets


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).


Fichier principal
Vignette du fichier
ijcai19.pdf (364.27 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

lirmm-02310629 , version 1 (10-10-2019)



Mohamed-Bachir Belaid, Christian Bessiere, Nadjib Lazaar. Constraint Programming for Mining Borders of Frequent Itemsets. IJCAI 2019 - 28th International Joint Conference on Artificial Intelligence, Aug 2019, Macao, China. pp.1064-1070, ⟨10.24963/ijcai.2019/149⟩. ⟨lirmm-02310629⟩
131 View
398 Download



Gmail Mastodon Facebook X LinkedIn More