Constraint Programming for Association Rules

Mohamed-Bachir Belaid 1 Christian Bessière 1 Nadjib Lazaar 1
1 COCONUT - Agents, Apprentissage, Contraintes
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : Discovering association rules among items in a dataset is one of the fundamental problems in data mining. It has recently been shown that constraint programming is a flexible way to tackle data mining tasks. In this paper we propose a declarative model based on constraint programming to capture association rules. Our model also allows us to specify any additional property and/or user's constraints on the kind of rules the user is looking for. To implement our model, we introduce a new global constraint, Confident, for ensuring the confidence of rules. We prove that completely propagating Confident is NP-hard. We thus provide a decomposition of Confident. In addition to user's constraints on the items composing body and head of the rules, we show that we can capture the popular minimal non-redundant property of association rules. An experimental analysis shows the practical effectiveness of our approach compared to existing approaches.
Document type :
Conference papers
Complete list of metadatas

Cited literature [16 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-02089719
Contributor : Nadjib Lazaar <>
Submitted on : Thursday, April 4, 2019 - 9:55:45 AM
Last modification on : Wednesday, June 26, 2019 - 12:56:25 PM
Long-term archiving on: Friday, July 5, 2019 - 12:46:03 PM

File

sdm19.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Mohamed-Bachir Belaid, Christian Bessière, Nadjib Lazaar. Constraint Programming for Association Rules. SDM: SIAM International Conference on Data Mining, May 2019, Calgary, Canada. pp.127-135, ⟨10.1137/1.9781611975673.15⟩. ⟨lirmm-02089719⟩

Share

Metrics

Record views

68

Files downloads

98