An Improved Apriori Algorithm on the Frequent Itemse
Xiang Fang · 2013
According to the problem that the traditional Apriori algorithm needs to scan database frequently, an improved strategy and corresponding algorithm is put forward in this paper.This method, only when L 1 -candidates are produced, scans the transaction database D. The rest frequent itemsets are produced through the scan of preceding result in place of the transaction database.The improved algorithm reduces I/O load and has higher efficiency.