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

计算机工程 ›› 2006, Vol. 32 ›› Issue (23): 68-69. doi: 10.3969/j.issn.1000-3428.2006.23.024

• 软件技术与数据库 • 上一篇    下一篇

基于矩阵的Apriori算法改进

李 超,余昭平    

  1. (解放军信息工程大学电子技术学院,郑州 450004)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2006-12-05 发布日期:2006-12-05

Improved Method of Apriori Algorithm Based on Matrix

LI Chao, YU Zhaoping   

  1. ( Institute of Electronic Technology, PLA Information Engineering University, Zhengzhou 450004)
  • Received:1900-01-01 Revised:1900-01-01 Online:2006-12-05 Published:2006-12-05

摘要: 对基于矩阵的Apriori算法进行了改进,同时改进了发现关联规则算法,将Apriori算法的剪枝与矩阵联系起来,可以大大减少扫描数据库的次数,从而提高算法的效率,在生成关联规则中,利用了概率论的基本性质也大大减少了计算量。并通过实例说明它是一种有效的关联规则挖掘方法。

关键词: 关联规则, Apriori算法, 矩阵

Abstract: The paper improves Apriori algorithm based on Matrix. At the same time, improves the algorithm of finding association rules. It can reduce the times of accessing database to enhance the efficiency of this algorithm. The examples show that the algorithm is an effective method of association rulers mining.

Key words: Association rules, Apriori algorithm, Matrix