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.
Type de document :
Communication dans un congrès
CP: Principles and Practice of 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〉
Liste complète des métadonnées

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01374719
Contributeur : Joël Quinqueton <>
Soumis le : lundi 15 octobre 2018 - 13:10:50
Dernière modification le : lundi 15 octobre 2018 - 13:20:52

Fichier

cp16.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

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. 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〉

Partager

Métriques

Consultations de la notice

245

Téléchargements de fichiers

3