Study on Optimization of AprioriTid Algorithm for Mining Association Rules
Xiong Yong-jun · Jisuanji gongcheng · 2006
This paper puts forward an optimizied algorithm which associates AprioriTid with transaction reduction and item reduction technique.Its characteristic is that the candidate set is adopted by the key word identifies,and at the same time transaction data is compressed by transaction and item.So the process of pruning and string pattern matching in AprioriTid and Apriori algorithm are removed,the size of scan transaction data base is decreased,and efficiency of find rules is improved.The testing result shows that the performance efficiency of optimized algorithm is obviously better than AprioriTid algorithm.