频繁项目集发现算法Apriori的研究

Research on frequent item sets discovery algorithm Apriori

为了提高Apriori算法的效率,从减少数据库扫描次数的角度出发,提出了一种动态自适应的改进算法。通过比较,该改进算法有效地减少了数据库的扫描次数,明显地提高了Apriori算法的效率,当数据库中总项目数目较大时,该算法更为有效。

In order to reduce the times of scanning database to improve the efficiency of algorithm Apriori, the paper presents with the original algorithm, a newly improved algorithm, dynamic self-adaptive algorithm. Compared the new algorithm can reduce the times of scanning database more effectively, and improve the efficiency of algorithm Apriori more obviously, especially when the amount of database items is large.