We use cookies to improve your experience with our site.
LI Qingzhong, WANG Haiyang, YAN Zhongmin, MA Shaohan. Efficient Mining of Association Rules by Reducing the Number of Passes over the Database[J]. Journal of Computer Science and Technology, 2001, 16(2).
Citation:
LI Qingzhong, WANG Haiyang, YAN Zhongmin, MA Shaohan. Efficient Mining of Association Rules by Reducing the Number of Passes over the Database[J]. Journal of Computer Science and Technology, 2001, 16(2).
LI Qingzhong, WANG Haiyang, YAN Zhongmin, MA Shaohan. Efficient Mining of Association Rules by Reducing the Number of Passes over the Database[J]. Journal of Computer Science and Technology, 2001, 16(2).
Citation:
LI Qingzhong, WANG Haiyang, YAN Zhongmin, MA Shaohan. Efficient Mining of Association Rules by Reducing the Number of Passes over the Database[J]. Journal of Computer Science and Technology, 2001, 16(2).
Efficient Mining of Association Rules by Reducing the Number of Passes over the Database
This paper introduces a new algorithm of miningassociation rules. The algorithm RP counts the itemsets with differentsizes in the same pass of scanning over the database by dividing thedatabase into m partitions. The total number of passes over the database isonly (k+2m-2)/m, where k is the longest size in the itemsets. It ismuch less than k.
DownLoad: