Journal
APPLIED INTELLIGENCE
Volume 18, Issue 1, Pages 91-104Publisher
SPRINGER
DOI: 10.1023/A:1020995206763
Keywords
data mining; sampling approximate; frequent itemset
Categories
Ask authors/readers for more resources
This paper presents a method for discovering approximate frequent itemsets of interest in large scale databases. This method uses the central limit theorem to increase efficiency, enabling us to reduce the sample size by about half compared to previous approximations. Further efficiency is gained by pruning from the search space uninteresting frequent itemsets. In addition to improving efficiency, this measure also reduces the number of itemsets that the user need consider. The model and algorithm have been implemented and evaluated using both synthetic and real-world databases. Our experimental results demonstrate the efficiency of the approach.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available