Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Computer Engineering and Applications》 2004-36
Add to Favorite Get Latest Update

Three Optimized Methods of Apriori Algorithm

Xu Zhangyan Liu Meiling Zhang Shichao Lu Jingli Ou Yuming(Department of Computer Science,Guangxi Normal University,Guilin 541004)  
In this paper,after the principle and efficiency of the Apriori algorithm are analyzed,authors think that there are three following disadvantages:First,when candidate frequent(K+1)-itemsets are generated from frequent K-itemsets,the strategy of deleting infrequent (K+1)-itemsets from candidate frequent(K+1)-itemsets is not perfect;Second,the join procedure of Apriori algorithm is not very good because the comparison times of the same item is excessive;In the end,many items or transactions which need not be scanned are scanned repeatedly.According to the above three disadvantages,three corresponding optimized strategies are used to optimize the Apriori algorithm,and present an improved Apriori algorithm,which is more efficient than the original Apriori Algorithm.
【CateGory Index】: TP18
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved