Skip to Main content Skip to Navigation
Book sections

On Maximal Frequent Itemsets Mining with Constraints

Abstract : 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.
Complete list of metadata

https://hal-univ-artois.archives-ouvertes.fr/hal-03700069
Contributor : Said Jabbour Connect in order to contact the contributor
Submitted on : Monday, June 20, 2022 - 7:04:59 PM
Last modification on : Saturday, June 25, 2022 - 3:26:06 AM

File

CP18-Final.pdf
Files produced by the author(s)

Identifiers

Citation

Said Jabbour, Fatima Ezzahra, Imen Ouled Dlala, Badran Raddaoui, Lakhdar Sais. On Maximal Frequent Itemsets Mining with Constraints. John Hooker. Principles and Practice of Constraint Programming. 24th International Conference, CP 2018, Lille, France, August 27-31, 2018, Proceedings, 11008, Springer International Publishing, pp.554-569, 2018, Lecture Notes in Computer Science, ⟨10.1007/978-3-319-98334-9_36⟩. ⟨hal-03700069⟩

Share

Metrics

Record views

0

Files downloads

0