A Global Constraint for Closed Frequent Pattern Mining - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2016

A Global Constraint for Closed Frequent Pattern Mining


Discovering the set of closed frequent patterns is one of the fundamental problems in Data Mining. Recent Constraint Programming (CP) approaches for declarative itemset mining have proven their usefulness and flexibility. But the wide use of reified constraints in current CP approaches leads to difficulties in coping with high dimensional datasets. In this paper, we propose the ClosedPattern global constraint to capture the closed frequent pattern mining problem without requiring reified constraints or extra variables. We present an algorithm to enforce domain consistency on ClosedPattern in polynomial time. The computational properties of this algorithm are analyzed and its practical effectiveness is experimentally evaluated.
Fichier principal
Vignette du fichier
cp16.pdf (800.68 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

lirmm-01374719 , version 1 (15-10-2018)



Nadjib Lazaar, Yahia Lebbah, Samir Loudni, Mehdi Maamar, Valentin Lemière, et al.. A Global Constraint for Closed Frequent Pattern Mining. CP 2016 - 22nd International Conference on Principles and Practice of Constraint Programming, Sep 2016, Toulouse, France. pp.333-349, ⟨10.1007/978-3-319-44953-1_22⟩. ⟨lirmm-01374719⟩
343 View
319 Download



Gmail Facebook X LinkedIn More