提示
李庆忠
-
31浏览
-
0点赞
-
0收藏
-
0分享
-
32下载
-
0评论
-
引用
期刊论文
Efficient Mining of Association Rules by Reducing the Number of Passes over the Database
J. Comput. Sci. & Technol. Vol.16, No.2, Mar. 2001 182-188，-0001，（）：
This paper introduces a new algorithm of mining association rules. The algorithm R.P counts the itemsets with different sizes in the same pass of scan-ning over the database by dividing the database into m partitions. The total number of passes over the database is only (k+2m-2)/m, where k is the longest size in the itemsets. It is much less than k.
【免责声明】以下全部内容由[李庆忠]上传于[2009年02月24日 13时07分15秒]，版权归原创者所有。本文仅代表作者本人观点，与本网站无关。本网站对文中陈述、观点判断保持中立，不对所包含内容的准确性、可靠性或完整性提供任何明示或暗示的保证。请读者仅作参考，并请自行承担全部责任。
本学者其他成果
同领域成果
