Sciweavers

257 search results - page 2 / 52
» Mining Large Itemsets for Association Rules
Sort
View
AMT
2006
Springer
108views Multimedia» more  AMT 2006»
13 years 6 months ago
Efficient Frequent Itemsets Mining by Sampling
As the first stage for discovering association rules, frequent itemsets mining is an important challenging task for large databases. Sampling provides an efficient way to get appro...
Yanchang Zhao, Chengqi Zhang, Shichao Zhang
CORR
2010
Springer
279views Education» more  CORR 2010»
13 years 4 months ago
Mining Frequent Itemsets Using Genetic Algorithm
In general frequent itemsets are generated from large data sets by applying association rule mining algorithms like Apriori, Partition, Pincer-Search, Incremental, Border algorithm...
Soumadip Ghosh, Sushanta Biswas, Debasree Sarkar, ...
APWEB
2005
Springer
13 years 10 months ago
Mining Quantitative Associations in Large Database
Association Rule Mining algorithms operate on a data matrix to derive association rule, discarding the quantities of the items, which contains valuable information. In order to mak...
Chenyong Hu, Yongji Wang, Benyu Zhang, Qiang Yang,...
JCST
2008
119views more  JCST 2008»
13 years 4 months ago
Mining Frequent Generalized Itemsets and Generalized Association Rules Without Redundancy
This paper presents some new algorithms to efficiently mine max frequent generalized itemsets (g-itemsets) and essential generalized association rules (g-rules). These are compact ...
Daniel Kunkle, Donghui Zhang, Gene Cooperman
DEXA
2004
Springer
153views Database» more  DEXA 2004»
13 years 10 months ago
A New Approach of Eliminating Redundant Association Rules
Two important constraints of association rule mining algorithm are support and confidence. However, such constraints-based algorithms generally produce a large number of redundant ...
Mafruz Zaman Ashrafi, David Taniar, Kate A. Smith