一种提高Apriori算法效率的方法

Improved apriori algorithm for efficiency

Apriori算法是关联规则挖掘中的经典算法。在Apriori算法中,需要大量进行两个操作:判断两个k-项集是否前k-1项相同且最后一项不同;判断一个项集是否为另一个项集的子集。利用Apriori算法中项集之间都是有序的这一特点可以减少以上两个操作的执行次数,从而达到对Apriori算法进行优化的目的。实验结果表明,经过优化了的Apriori算法在运行效率上有一定的提高。

Apriori algorithm is a classical algonrithm of association rule mining.Two operations,needed to determine whether two k-itemsets with equal items are the same but last item and to determine whether one itemset is the subset of another,need be performed frequently in apriori algorithm.Reducing the times of performing the two operations by taking advantage of order itemsets could improve the efficiency of apriori algorithm.The results of experiment show that the improved algorithm is more ef- ficient.