Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

AMT
2006
Springer

favoriteEmaildiscussreport

108views Multimedia» more AMT 2006»

Efficient Frequent Itemsets Mining by Sampling

13 years 6 months ago

Efficient Frequent Itemsets Mining by Sampling

Download epress.lib.uts.edu.au

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 approximating answers in much shorter time. Based on the characteristics of frequent itemsets counting, a new bound for sampling is proposed, with which less samples are necessary to achieve the required accuracy and the efficiency is much improved over traditional Chernoff bounds. Keywords. Frequent itemset, sampling

Yanchang Zhao, Chengqi Zhang, Shichao Zhang

Real-time Traffic

AMT 2006 | Frequent Itemset | Frequent Itemsets Mining | Important Challenging Task | Multimedia |

claim paper

Related Content

» Efficient Pattern Mining of Uncertain Data with Sampling

» LCM ver 2 Efficient Mining Algorithms for FrequentClosedMaximal Itemsets

» An Efficient Algorithm for Maintaining Frequent Closed Itemsets over Data Stream

» Probabilistic frequent itemset mining in uncertain databases

» SAIFIM Incrementally Mining Frequent Itemsets in Update Distorted Databases

» DCI Closed A Fast and Memory Efficient Algorithm to Mine Frequent Closed Itemsets

» Efficient Incremental Mining of TopK Frequent Closed Itemsets

» On efficiently summarizing categorical databases

» A Fast Algorithm for Mining ShareFrequent Itemsets

Post Info
More Details (n/a)

Added	13 Oct 2010
Updated	13 Oct 2010
Type	Conference
Year	2006
Where	AMT
Authors	Yanchang Zhao, Chengqi Zhang, Shichao Zhang

Comments (0)