Sciweavers

Share
PAKDD
2005
ACM

Progressive Sampling for Association Rules Based on Sampling Error Estimation

10 years 9 months ago
Progressive Sampling for Association Rules Based on Sampling Error Estimation
We explore in this paper a progressive sampling algorithm, called Sampling Error Estimation (SEE), which aims to identify an appropriate sample size for mining association rules. SEE has two advantages over previous works in the literature. First, SEE is highly efficient because an appropriate sample size can be determined without the need of executing association rules. Second, the identified sample size of SEE is very accurate, meaning that association rules can be highly efficiently executed on a sample of this size to obtain a sufficiently accurate result. This is attributed to the merit of SEE for being able to significantly reduce the influence of randomness by examining several samples with the same size in one database scan. As validated by experiments on various real data and synthetic data, SEE can achieve very prominent improvement in efficiency and also the resulting accuracy over previous works.
Kun-Ta Chuang, Ming-Syan Chen, Wen-Chieh Yang
Added 28 Jun 2010
Updated 28 Jun 2010
Type Conference
Year 2005
Where PAKDD
Authors Kun-Ta Chuang, Ming-Syan Chen, Wen-Chieh Yang
Comments (0)
books