一种改进的Apriori挖掘关联规则算法

An Improved Apriori Mining Association Rules Algorithm

针对数据挖掘的经典关联规则Aprior算法的效率问题提出了改进算法,即BTA算法,旨在提高算法效率。BTA算法只在产生侯选1-项集时需要遍历一次数据库,其它侯选项集的支持度计算只需统计相应TID集合的元素个数即可,而不必像Apriori算法那样反复地遍历数据库,从而提高了算法效率。

This article proposed the improvement algorithm in view of the data ＂mining classics Association rules Apriori algorithm efficiency question.Namely proposed BTA （Based on Tid_set Apriori） the algorithm is for the purpose of enhancing the algorithm efficiency, efficiency. The BTA algorithm only when produces the candidate-1 sets needs only one database scan, and the count of other candidate item set members is added up only by counting the number of corresponding TID set, but does not need to look like the Apriori algorithm such repeatedly scan database, thus enhanced the algorithm efficiency.