| 频繁项目集发现算法Apriori的研究 |
| |
| 引用本文： | 顾泽元,吕宗宝,刘兴丽.频繁项目集发现算法Apriori的研究[J].黑龙江科技学院学报,2005,15(5):319-322. |
| |
| 作者姓名： | 顾泽元 吕宗宝 刘兴丽 |
| |
| 作者单位： | 黑龙江科技学院计算机与信息工程学院,哈尔滨,150027 |
| |
| 摘 要： | 为了提高Apriori算法的效率,从减少数据库扫描次数的角度出发,提出了一种动态自适应的改进算法.通过比较,该改进算法有效地减少了数据库的扫描次数,明显地提高了Apriori算法的效率,当数据库中总项目数目较大时,该算法更为有效.
|
| 关 键 词： | 数据挖掘 关联规则 Apriori算法 频繁项目集 |
| 文章编号： | 1671-0118（2005）05-0319-04 |
| 收稿时间： | 2005-04-30 |
| 修稿时间： | 2005-04-30 |
Research on frequent item sets discovery algorithm Apriori |
| |
| GU Zeyuan,L Zongbao,LIU Xingli.Research on frequent item sets discovery algorithm Apriori[J].Journal of Heilongjiang Institute of Science and Technology,2005,15(5):319-322. |
| |
| Authors: | GU Zeyuan L Zongbao LIU Xingli |
| |
| Institution: | Comptuter Information and Engineering College, Heilongjiang Institute of Science and Technology, Harbin 150027, China |
| |
| Abstract: | In order to reduce the times of scanning database to improve the efficiency of algorithm Apriori, the paper presents with the original algorithm, a newly improved algorithm, dynamic self-adaptive algorithm. Compared the new algorithm can reduce the times of scanning database more effectively, and improve the efficiency of algorithm Apriori more obviously, especially when the amount of database items is large. |
| |
| Keywords: | data mining association rule algorithm Apriori frequent item sets |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
