| 一种结合完全连接的改进Apriori算法 |
| |
| 引用本文： | 骆嘉伟,王艳,杨涛,吴君浩.一种结合完全连接的改进Apriori算法[J].计算机应用,2006,26(5):1174-1177. |
| |
| 作者姓名： | 骆嘉伟 王艳 杨涛 吴君浩 |
| |
| 作者单位： | 湖南大学,计算机与通信学院,湖南,长沙,410082 |
| |
| 基金项目： | 中国网上教育平台项目;浙江省湖州市自然科学基金 |
| |
| 摘 要： | 基于Apriori算法原理，提出一种有效的完全连接条件，在频繁2k-项集的集合L2k进行自身Apriori连接得频繁(2k+1)-项集的同时，自身完全连接产生未剪枝的候选4k-项集；对频繁(2k+1)-项集的集合L2k+1，直接对其项集进行完全连接产生未剪枝的候选(4k+2)-项集。改进的算法减少了连接的比较次数、迭代运算次数。实验表明该算法在保证无遗漏的情况下有效地提高了Apriori算法的挖掘速度。
|
| 关 键 词： | 关联规则 Apriori 频繁项集 完全连接 |
| 文章编号： | 1001-9081（2006）05-1174-04 |
| 收稿时间： | 2005-12-07 |
| 修稿时间： | 2005-12-072006-02-20 |
Improved Apriori algorithm based on the absolutely join |
| |
| LUO Jia-wei,WANG Yan,YANG Tao,WU Jun-hao.Improved Apriori algorithm based on the absolutely join[J].journal of Computer Applications,2006,26(5):1174-1177. |
| |
| Authors: | LUO Jia-wei WANG Yan YANG Tao WU Jun-hao |
| |
| Affiliation: | College of Computer and Communication, Hunan University, Changsha Hunan 410082, China |
| |
| Abstract: | Based on the principle of Apriori, a excellent premiss of absolutely join was presented, the candidate 4k-itemsets were built directly with absolutely join while created the candidate (2k+1)-itemsets from L2k (the muster of frequent 2k-itemsets); and only used the absolutely join for L2k+1(the muster of frequent (2k+1)-itemsets) to create the candidate (4k+2)-itemsets. This algorithm decreases the times of iteration and the compare. The experiment results show that no frequent itemsets is missed and the speed of the mining is effectively improved in this algorithm. |
| |
| Keywords: | Apriori |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机应用》浏览原始摘要信息 |
|
点击此处可从《计算机应用》下载全文 |
