多值属性关联规则挖掘的Q-Apriori算法

Q-Apriori Algorithm of Multivalue Attribute Association Rules Mining

针对Apriori算法进行多值属性关联规则挖掘时效率低下的问题,提出量化Apriori算法。利用多值属性数据特点改变项集存储格式,采用类似矩阵的数据结构存储项集,提高遍历数据库时统计计数的速度,使用类似矩阵的加法运算改进连接操作,减少无效候选项集的产生。实验结果表明,相比Apriori算法,该算法执行效率有较大提高。

Aiming at the problem that the Apriori algorithm is inefficient in quantitative association rules mining,this paper proposes a Quantitative Apriori（Q-Apriori） algorithm.It makes use of quantitative attribute data＇s characteristics,changes the storage format of the sets using special data structure like matrix to store the sets which reduces the time of traversing the database to count each set＇s support.It makes improvement in join step using a method like matrix addition which reduces the number of nonsense candidate sets.Experimental results show that execution efficiency of this algorithm is better than that of Apriori algorithm.