87 search results - page 2 / 18 » Mining Frequent Generalized Itemsets and Generalized Associa... |
ICDT
2009
ACM
14 years 6 months ago
2009
ACM
In this paper, we present a comprehensive theoretical analysis of the sampling technique for the association rule mining problem. Most of the previous works have concentrated only...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
In general frequent itemsets are generated from large data sets by applying association rule mining algorithms like Apriori, Partition, Pincer-Search, Incremental, Border algorithm...
ICDM
2005
IEEE
13 years 11 months ago
2005
IEEE
In order to generate synthetic basket data sets for better benchmark testing, it is important to integrate characteristics from real-life databases into the synthetic basket data ...
KDD
2006
ACM
14 years 5 months ago
2006
ACM
Mining frequent closed itemsets provides complete and condensed information for non-redundant association rules generation. Extensive studies have been done on mining frequent clo...
KDD
2000
ACM
13 years 9 months ago
2000
ACM
The traditional association rule mining framework produces many redundant rules. The extent of redundancy is a lot larger than previously suspected. We present a new framework for...