| 关联规则挖掘中Apriori算法的研究与改进 |
| |
| 引用本文： | 李雪斌,朱艳琴,罗喜召.关联规则挖掘中Apriori算法的研究与改进[J].数字社区&智能家居,2009(19). |
| |
| 作者姓名： | 李雪斌 朱艳琴 罗喜召 |
| |
| 作者单位： | 苏州大学计算机科学与技术学院; |
| |
| 基金项目： | 国家自然科学基金资助项目(60673041) |
| |
| 摘 要： | 该文在对关联规则挖掘中Apriori算法的深入研究和分析的基础上,发现并指出了该算法存在的不足,并对其进行以下三方面改进:改善候选项集支持度的计算方法;缩小候选项集的生成规模;减少对数据库的扫描次数。实验结果表明,改进算法性能得到了明显提高。
|
| 关 键 词： | 数据挖掘 关联规则 Apriori算法 频繁项集 |
Research and Improvement for Apriori Algorithm of Association Rule Mining |
| |
| LI Xue-bin,ZHU Yan-qin,LUO Xi-zhao.Research and Improvement for Apriori Algorithm of Association Rule Mining[J].Digital Community & Smart Home,2009(19). |
| |
| Authors: | LI Xue-bin ZHU Yan-qin LUO Xi-zhao |
| |
| Affiliation: | School of Computer Science and Technology;Soochow University;Suzhou Jiangsu 215006 |
| |
| Abstract: | On the basis of deep research and analysis of Apriori algorithm in association rule mining,the paper discovers some shortages of the algorithm,and then improves it from three aspects: Firstly,the calculation method of support in candidate frequent itemsets is improved;Secondly,the scale of candidate frequent itemsets is reduced;In the end,the numbers of scanned database are decreased.The experiment results of the improved algorithm show that the improved algorithm is more efficient than the original. |
| |
| Keywords: | Data Mining Association rule Apriori algorithm frequent itemsets |
| 本文献已被 CNKI 等数据库收录！ |
