On maximal frequent itemsets mining with constraints - Télécom SudParis Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

On maximal frequent itemsets mining with constraints

Résumé

Recently, a new declarative mining framework based on constraint programming (CP) and propositional satisfiability (SAT) has been designed to deal with several pattern mining tasks. The itemset mining problem has been modeled using constraints whose models correspond to the patterns to be mined. In this paper, we propose a new propositional satisfiability based approach for mining maximal frequent itemsets that extends the one proposed in [20]. We show that instead of adding constraints to the initial SAT based itemset mining encoding, the maximal itemsets can be obtained by performing clause learning during search. A major strength of our approach rises in the compactness of the proposed encoding and the efficiency of the SAT-based maximal itemsets enumeration derived using blocked clauses. Experimental results on several datasets, show the feasibility and the efficiency of our approach.
Fichier principal
Vignette du fichier
CP18-Final.pdf (443.9 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03700069 , version 1 (20-06-2022)

Identifiants

Citer

Said Jabbour, Fatima Ezzahra, Imen Ouled Dlala, Badran Raddaoui, Lakhdar Saïs. On maximal frequent itemsets mining with constraints. CP 2018 : 24th International Conference on Principles and Practice of Constraint Programming, Aug 2018, Lille, France. pp.554-569, ⟨10.1007/978-3-319-98334-9_36⟩. ⟨hal-03700069⟩
104 Consultations
115 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More