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

一种提高Apriori算法效率的方法
引用本文:区玉明,张师超,徐章艳,卢景丽,刘美玲.一种提高Apriori算法效率的方法[J].计算机工程与设计,2004,25(5):846-848.
作者姓名:区玉明  张师超  徐章艳  卢景丽  刘美玲
作者单位:广西师范大学,计算机系,广西,桂林,541004
摘    要:Apriori算法是关联规则挖掘中的经典算法。在Apriori算法中,需要大量进行两个操作:判断两个k-项集是否前k-1项相同且最后一项不同;判断一个项集是否为另一个项集的子集。利用Apriori算法中项集之间都是有序的这一特点可以减少以上两个操作的执行次数,从而达到对Apriori算法进行优化的目的。实验结果表明,经过优化了的Apriori算法在运行效率上有一定的提高。

关 键 词:Apriori算法  关联规则挖掘  优化  效率  项集有序
文章编号:1000-7024(2004)05-0846-03

Improved apriori algorithm for efficiency
OU Yu-ming,ZHANG Shi-chao,XU Zhang-yan,LU Jing-li,LIU Mei-ling.Improved apriori algorithm for efficiency[J].Computer Engineering and Design,2004,25(5):846-848.
Authors:OU Yu-ming  ZHANG Shi-chao  XU Zhang-yan  LU Jing-li  LIU Mei-ling
Affiliation:OU Yu-ming,ZHANG Shi-chao,XU Zhang-yan,LU Jing-li,LIU Mei-ling Department of Computer Science,Guangxi Normal University,Guilin 541004,China
Abstract:Apriori algorithm is a classical algonrithm of association rule mining.Two operations,needed to determine whether two k-itemsets with equal items are the same but last item and to determine whether one itemset is the subset of another,need be performed frequently in apriori algorithm.Reducing the times of performing the two operations by taking advantage of order itemsets could improve the efficiency of apriori algorithm.The results of experiment show that the improved algorithm is more ef- ficient.
Keywords:association rule  Aprirori algorithm  order itemsets  efficiency
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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