首页 | 本学科首页   官方微博 | 高级检索  
     

一种改进的Apriori算法
引用本文:袁万莲,郑诚,翟明清.一种改进的Apriori算法[J].微机发展,2008,18(5):51-53.
作者姓名:袁万莲  郑诚  翟明清
作者单位:安徽大学计算机科学与技术学院,安徽大学计算机科学与技术学院,滁州学院数学系 安徽合肥230039,滁州学院数学系,安徽滁州239012,安徽合肥230039,安徽滁州239012
基金项目:安徽省自然科学项目(KJ2007B124)
摘    要:数据挖掘中的关联规则挖掘能够发现大量数据中项集之间有趣的关联或相关联系,特别是随着大量数据不停地收集和存储,从数据库中挖掘关联规则就越来越有其必要性。通过对关联规则挖掘技术及其相关算法Apriori进行分析,发现该技术存在的问题。Apriori算法是关联规则挖掘中的经典算法。对Apriori算法做了改进。借助0—1矩阵给出了计算项集的支持度计数的更快方法,同时还简化了Apriori算法中的连接和剪枝操作,从而在时间和空间上提高了Apriori算法的效率。

关 键 词:数据挖掘  关联规则  Apriori算法
文章编号:1673-629X(2008)05-0051-03
修稿时间:2007年8月23日

An Improvement on Apriori Algorithm
YUAN Wan-lian,ZHENG Cheng,ZHAI Ming-qing.An Improvement on Apriori Algorithm[J].Microcomputer Development,2008,18(5):51-53.
Authors:YUAN Wan-lian    ZHENG Cheng  ZHAI Ming-qing
Affiliation:YUAN Wan-lian1,2,ZHENG Cheng1,ZHAI Ming-qing2
Abstract:The many interesting relations and relevance between the different items of sets can be located by means of the association rules mining technique of data mining.The mining of association rules from databases becomes especially necessary with the data in collection and storation becomes even larger.However,an analysis of the association rules mining technique and its relevant algorithm of Apriori has indicated that there exist problems in the technique in discussion.Apriori algorithm is classical in association rules mining.Provides an improvement on Apriori algorithm.It can compute the count of support of itemsets more quickly by 0-1 matrix.It can also simplify the join step and the prune step in Apriori algorithm.Thus the efficiency of Apriori algorithm get improvement both in time and in space.
Keywords:data mining  association rule  Apriori algorithm
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号