388 search results - page 9 / 78 » Mining Frequent Itemsets Using Support Constraints |
DIS
2007
Springer
13 years 11 months ago
2007
Springer
In this work we study the mining of top-K frequent closed itemsets, a recently proposed variant of the classical problem of mining frequent closed itemsets where the support thresh...
PODS
2009
ACM
14 years 8 months ago
2009
ACM
As advances in technology allow for the collection, storage, and analysis of vast amounts of data, the task of screening and assessing the significance of discovered patterns is b...
APPINF
2003
13 years 8 months ago
2003
Discovering association rules by identifying relationships among sets of items in a transaction database is an important problem in Data Mining. Finding frequent itemsets is compu...
RCIS
2010
13 years 5 months ago
2010
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
IDEAS
2007
IEEE
14 years 1 months ago
2007
IEEE
The transversal hypergraph enumeration based algorithms can be efficient in mining frequent itemsets, however it is difficult to apply them to sequence mining problems. In this ...