An Improved New Apriori Algorithm
Xiao Li · 2007
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.