| 基于项编码的关联规则挖掘算法 |
| |
| 引用本文： | 廖小平,王志坚,吴海玲.基于项编码的关联规则挖掘算法[J].计算机与现代化,2008(11):50-53. |
| |
| 作者姓名： | 廖小平 王志坚 吴海玲 |
| |
| 作者单位： | 河海大学计算机及信息工程学院,江苏,南京210098 |
| |
| 摘 要： | 关联规则挖掘是发现大量数据中项集之间有趣的关联或相关联系的技术方法，关联规则挖掘Apriori算法需要多次扫描数据库，时空复杂度过高。针对该算法的局限性，本文提出了基于项编码的关联规则挖掘算法CA（Coding-based Apriori），只需要第一遍扫描数据库并对每个项完成编码，以后的过程都是针对编码进行，不需要多次扫描数据库。相同条件下的实验结果表明，优化后的算法能有效地提高关联规则挖掘的效率。
|
| 关 键 词： | 关联规则 Apriori算法 频繁项集 候选项集 |
Coding-based Association Rules Mining Algorithm |
| |
| LIAO Xiao-ping,WANG Zhi-jian,WU Hai-ling.Coding-based Association Rules Mining Algorithm[J].Computer and Modernization,2008(11):50-53. |
| |
| Authors: | LIAO Xiao-ping WANG Zhi-jian WU Hai-ling |
| |
| Affiliation: | (College of Computer ＆ Information Engineering, Hohai University, Nanjing 210098, China) |
| |
| Abstract: | The association rules mining is a technology finding funny association between item sets from mass data.The Apriori algorithm need scan database time after time.So the time and space complexity is too high.According to the existing flaws of Apriori algorithm,Coding-based Apriori(CA) is advanced,it only needs scan database once and code for every item.Other processes scan code only.The experiment shows CA algorithm can improve efficiency of association rule mining. |
| |
| Keywords: | association rules Apriori algorithm frequent items candidate items |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
