| 基于线性链表存储结构的Apriori改进算法 |
| |
| 引用本文： | 赵明茹.基于线性链表存储结构的Apriori改进算法[J].科学技术与工程,2011,11(23). |
| |
| 作者姓名： | 赵明茹 |
| |
| 作者单位： | 北京物资学院信息学院,北京,101149 |
| |
| 基金项目： | 2010年北京市优秀人才培养资助 |
| |
| 摘 要： | Apriori是最有影响的挖掘关联规则频繁项集的算法。但是Apiori由于需要多次对数据库进行扫描，所以运行效率比较低。在Apriori算法的基础上，本文提出了一种基于线性链表的频繁项集挖掘算法，实验证明该算法能够有效提高执行效率。
|
| 关 键 词： | 数据挖掘 关联规则 Apriori算法 线性链表 |
| 收稿时间： | 4/22/2011 9:47:43 PM |
| 修稿时间： | 2011/4/22 0:00:00 |
An Improved Algorithm of Apriori Based on Liner List |
| |
| zhaomingru.An Improved Algorithm of Apriori Based on Liner List[J].Science Technology and Engineering,2011,11(23). |
| |
| Authors: | zhaomingru |
| |
| Institution: | ZHAO Ming-ru,GUO Jian,SUN Yuan (School of Information,Beijing Wuzi University,Beijing 101149,P.R.China) |
| |
| Abstract: | Apriori is the most influential frequent pattern mining algorithm. However, because the Apriori algorithm scans the database many times, so the efficiency of Apriori is relatively low. In this paper, a new Apriori algorithm based on liner list was proposed, the new Apriori algorithm can improved the efficiency of Apriori algorithm by experiments. |
| |
| Keywords: | Data Mining Association Rules the algorithm of Apriori liner list |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《科学技术与工程》浏览原始摘要信息 |
| 点击此处可从《科学技术与工程》下载免费的PDF全文 |
|
