| 基于准频繁项目集的关联规则挖掘 |
| |
| 引用本文： | 赵旭俊,闫宏印,吴广平,董晓丽.基于准频繁项目集的关联规则挖掘[J].太原理工大学学报,2005,36(4):412-415. |
| |
| 作者姓名： | 赵旭俊 闫宏印 吴广平 董晓丽 |
| |
| 作者单位： | 太原理工大学,计算机学院,山西,太原,030024 |
| |
| 摘 要： | 为减少关联规则挖掘中数据库扫描次数,提出了一种基于准频繁项目集的关联规则挖掘算法———SupposedFrequent,同时给出了候选频繁项目集的产生函数———BGen.最后通过实验证明:在给定最好的准频繁项目集的条件下,只需扫描数据库两次就能产生全部的频繁项目集。
|
| 关 键 词： | 关联规则 准频繁项目集 覆盖率 长频繁项目集 |
| 文章编号： | 1007-9432（2005）04-0412-04 |
| 收稿时间： | 2004-12-16 |
| 修稿时间： | 2004年12月16 |
Associaton Rules Mining Based on Supposed Frequent Itemsets |
| |
| ZHAO Xu-jun,YAN Hong-yin,WU Guang-ping,DONG Xiao-li.Associaton Rules Mining Based on Supposed Frequent Itemsets[J].Journal of Taiyuan University of Technology,2005,36(4):412-415. |
| |
| Authors: | ZHAO Xu-jun YAN Hong-yin WU Guang-ping DONG Xiao-li |
| |
| Abstract: | For reducing the number of I/O passes required, we devise an association rules mining algorithm based on supposed frequent itemsets SupposedFrequent. We also present a function BGen, which generates candidate itemsets. The experiments prove that in the best cases, only two passes are sufficient to discover all the frequent itemsets irrespective of the size of the biggest ones. |
| |
| Keywords: | association rules supposed frequent itemsets coverage ratio long frequent itemsets |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
