A New Association Rules Mining Algorithm by Improving Prune Efficiently
一个高效剪枝的新关联规则挖掘算法

Classifies the existing improving strategy for Apriori algorithm.The new algorithm unite the prune step and the join step in Apriori algorithm.By using a temporary itemsets named TQ to store the join result between specified itemset in Lk-1 and other itemsets in Lk-1,the new algorithm reduce the scanned set size from Lk-1 to L1.The mining efficiency is increased greatly.