一种基于Apriori的关联规则的改进算法的研究

An Improved Lgorithm for Mining Association Rules Based on Apriori Algorithm

Apriori算法是关联规则的经典算法,并己经被越来越多的企业使用。它在给企业带来经济效益的同时,也让人们意识到算法自身的不足:第一,该算法在扫描事务数据库的次数过多,从而需要承担很大的I/O负载;第二,它可能产生庞大的候选集。为了提高Apriori算法的效率,针对减少扫描事务数据库次数的方法,提出一种改进挖掘效率的算法。

Apriori algorithm brings to the enterprise economic benefits,and also makes people aware of the algorithm deficiencies： firstly,when applying to scan the transaction database,the algorithm costs so much times that results in a lot of I/O spending;secondly, it can produce huge candidate set.In order to improve the efficiency of the Apriori algorithm, this pa- per puts forward to an improved Apriori algorithm with higher mining efficiency according to reduce I/O spending.