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.
Type de document :
Communication dans un congrès
CP: Constraint Programming, Sep 2016, Toulouse, France. 22nd International Conference on Principles and Practice of Constraint Programming, LNCS (9892), pp.333-349, 2016, Principles and Practice of Constraint Programming. 〈http://cp2016.a4cp.org〉. 〈10.1007/978-3-319-44953-1_22〉
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01374719
Contributeur : Joël Quinqueton
<>
Soumis le : vendredi 30 septembre 2016 - 21:43:01
Dernière modification le : mardi 5 juin 2018 - 10:14:41
Nadjib Lazaar, Yahia Lebbah, Samir Loudni, Mehdi Maamar, Valentin Lemière, et al.. A Global Constraint for Closed Frequent Pattern Mining . CP: Constraint Programming, Sep 2016, Toulouse, France. 22nd International Conference on Principles and Practice of Constraint Programming, LNCS (9892), pp.333-349, 2016, Principles and Practice of Constraint Programming. 〈http://cp2016.a4cp.org〉. 〈10.1007/978-3-319-44953-1_22〉. 〈lirmm-01374719〉
