Q-Apriori Algorithm of Multivalue Attribute Association Rules Mining

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.