计算机工程与应用 ›› 2007, Vol. 43 ›› Issue (24): 158-161.

• 数据库与信息处理 • 上一篇    下一篇

Apriori挖掘频繁项目集算法的改进

柴华昕,王 勇   

  1. 桂林电子科技大学 网络中心,广西 桂林 541004
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-08-21 发布日期:2007-08-21
  • 通讯作者: 柴华昕

Improvement of Apriori algorithm

CHAI Hua-xin,WANG Yong   

  1. NIC of Guilin University of Electronic Technology,Guilin,Guangxi 541004,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-08-21 Published:2007-08-21
  • Contact: CHAI Hua-xin

摘要: 针对Apriori算法的不足,提出了一种新的优化算法Napriori。算法从优化产生2-项目集、事务压缩、项目压缩、优化连接等几个方面对Apriori算法进行优化,将散列技术应用于产生1-项目集和2-项目集,将压缩优化和连接优化应用于k-项目集。实验结果表明,Napriori算法运行速度比Apriori算法有了明显的提高。

关键词: 关联规则, Apriori算法, 事务压缩, 散列结构

Abstract:

In this study,it proposes a new optimization algorithm called Napriori based on the insufficient of Apriori.Napriori algorithm presents optimizations on 2-items generation,transactions compression,items compression and join optimization.Napriori uses hash structure to generate 1-items and 2-items while compression and join optimization to generate k-items(k>3).The performance study shows that Napriori is much faster than Apriori.

Key words: association rule, Apriori algorithm, transaction compression, hash structure