Results 171 to 180 of about 2,690 (229)

On Maximal Frequent Itemsets Mining with Constraints

open access: yes, 2018
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.
Saïd Jabbour   +4 more
openaire   +2 more sources

Frequent Itemset Mining for Big Data

2013 IEEE International Conference on Big Data, 2013
Frequent Itemset Mining (FIM) is one of the most well known techniques to extract knowledge from data. The combinatorial explosion of FIM methods become even more problematic when they are applied to Big Data. Fortunately, recent improvements in the field of parallel programming already provide good tools to tackle this problem.
Sandy Moens   +2 more
openaire   +2 more sources

Mining Frequent and Homogeneous Closed Itemsets

2016
It is well known that when mining frequent itemsets from a transaction database, the output is usually too large to be effectively exploited by users. To cope with this difficulty, several forms of condensed representations of the set of frequent itemsets have been proposed, among which the notion of closure is one of the most popular.
Inès Hilali   +4 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy