Nov 5, 2016 · Mining frequent itemsets from transactional datasets is a well known problem. Thus, various methods have been studied to deal with this ...
In this paper, we focus on the propositional satisfiability based itemset mining framework. Our main goal is to enhance the efficiency of SAT model enumeration ...
In this paper, we focus on the propositional satisfiability based itemset mining framework. Our main goal is to enhance the efficiency of SAT model enumeration ...
A Comparative Study of SAT-Based Itemsets Mining · List of references · Publications that cite this publication.
Imen Ouled Dlala, Saïd Jabbour, Lakhdar Saïs, Boutheina Ben Yaghlane: A Comparative Study of SAT-Based Itemsets Mining. SGAI Conf. 2016: 37-52.
In this paper, we focus on the propositional satisfiability based itemset mining framework. Our main goal is to enhance the efficiency of SAT model enumeration ...
Experiments on many datasets show that on both closed and in- direct association rules mining tasks, our declara- tive approach achieves better performance than ...
This research issue allows to model data mining problems in a declarative way, while exploiting efficient SAT solving techniques.
Missing: Comparative | Show results with:Comparative
On When and How to use SAT to Mine Frequent Itemsets - ResearchGate
www.researchgate.net › Home › SAT
This work deepens the study on when and how to use SAT for the frequent itemset mining (FIM) problem by defining different encodings with multiple task-driven ...
People also ask
What are the frequent itemset mining methods?
Which of the following algorithms is used for mining maximal frequent itemsets?
What is a closed itemset in data mining?
In this section, we carried out an experimental evaluation of our SAT-based formulation for mining profitable itemsets, and then compare the performance of our ...
Missing: Comparative | Show results with:Comparative