Identifying approximate itemsets of interest in large databases

Publication Type:
Journal Article
Applied Intelligence, 2003, 18 (1), pp. 91 - 104
Issue Date:
Filename Description Size
2003001887.pdf201.15 kB
Adobe PDF
Full metadata record
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.
Please use this identifier to cite or link to this item: