Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Computer Science》 2007-04
Add to Favorite Get Latest Update

An Improved New Apriori Algorithm

LI Xiao-Hong1 SHANG Jin2(College of Mathematics and Computer Science, Chongqing Normal University, Chongqing 400047)1(The Second Department of Computer, Chongqing Electronic Profession College, Chongqing 400021)2  
Based on the analysis of Apriori algorithm from the perspectives of time complexity and memory complexity, we use an across linker to substitute the array description of the transactions database. Theroefore, on the one hand, the time cost is reduced by shorten the length of the objects linked. On the other hand, large memory cost is saved due to the un-saving of candidates of frequent itemset. The experiments show that the improved new algorithm’s performances are comparable.
【CateGory Index】: TP311.13
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