Skip to Main content Skip to Navigation
Conference papers

A Global Constraint for Closed Frequent Pattern Mining

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download
Contributor : Joël Quinqueton Connect in order to contact the contributor
Submitted on : Monday, October 15, 2018 - 1:10:50 PM
Last modification on : Wednesday, October 27, 2021 - 10:18:44 AM
Long-term archiving on: : Wednesday, January 16, 2019 - 2:55:58 PM


Files produced by the author(s)




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