作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2008, Vol. 34 ›› Issue (23): 196-198. doi: 10.3969/j.issn.1000-3428.2008.23.070

• 人工智能及识别技术 • 上一篇    下一篇

Apriori算法的一种优化方法

钱光超,贾瑞玉,张 然,李龙澍   

  1. (安徽大学计算机科学与技术学院,合肥 230039)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2008-12-05 发布日期:2008-12-05

One Optimized Method of Apriori Algorithm

QIAN Guang-chao,¸JIA Rui-yu, ZHANG Ran, LI Long-shu   

  1. (School of Computer Science and Technology, Anhui University, Hefei 230039)
  • Received:1900-01-01 Revised:1900-01-01 Online:2008-12-05 Published:2008-12-05

摘要: 介绍关联规则挖掘中的经典算法――Apriori算法的关键思想。针对传统Apriori算法效率上的不足,提出一种改进的Apriori算法――En-Apriori算法。该算法采用矩阵的方法,只须扫描一遍数据库,同时优化了连接操作,较好地提高了算法的效率。实验结果表明,En-Apriori算法优于Apriori算法,具有较好的实用性。

关键词: 关联规则, 频繁项集, Apriori算法, En-Apriori算法

Abstract: This paper introduces the principle and efficiency of the Apriori algorithm which is the classical algorithm of association rules mining, and proposes an improved Apriori algorithm――En-Apriori algorithm which is aimed at the disadvantage of Apriori algorithm. This algorithm adopts a matrix method and need scan the database only once and optimizes the join operation, so it is more efficient. The experiment shows that the En-Apriori algorithm outperforms Apriori algorithm, and gets a good practicality.

Key words: association rules, frequent itemsets, Apriori algorithm, En-Apriori algorithm

中图分类号: