一种基于自适应步长及动态修剪的Apriori改进算法

An Improvement for Apriori Algorithm Based on Self-Adaptive Stepsize and Dynamical Pruning

首先分析了Apriori算法的特点、缺陷,其次探讨了如何提高Apriori算法的有效性,然后提出一种利用自适应步长跃进、动态修剪候选项集技术的改进算法U-Apriori,并通过实验进行对比,证明了对算法改进的有效性。

This paper firstly analyzes the characteristics and defects of the Apriori algorithm,and then discusses how to improve the efficiency of the Apriori algorithm,finally it presents an improved algorithm（U-Apriori） which uses the technologies of self-Adaptive step size and Dynamically Pruning the candidate item-sets.The experiment results indicate that this algorithm is of higher application efficiency than Apriori algorithm,and that its efficiency is also proved.