Constraint Programming for Mining Borders of Frequent Itemsets
Abstract
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).
Cite
Text
Belaid et al. "Constraint Programming for Mining Borders of Frequent Itemsets." International Joint Conference on Artificial Intelligence, 2019. doi:10.24963/IJCAI.2019/149Markdown
[Belaid et al. "Constraint Programming for Mining Borders of Frequent Itemsets." International Joint Conference on Artificial Intelligence, 2019.](https://mlanthology.org/ijcai/2019/belaid2019ijcai-constraint/) doi:10.24963/IJCAI.2019/149BibTeX
@inproceedings{belaid2019ijcai-constraint,
title = {{Constraint Programming for Mining Borders of Frequent Itemsets}},
author = {Belaid, Mohamed-Bachir and Bessiere, Christian and Lazaar, Nadjib},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2019},
pages = {1064-1070},
doi = {10.24963/IJCAI.2019/149},
url = {https://mlanthology.org/ijcai/2019/belaid2019ijcai-constraint/}
}