Research on high efficiency mining frequent itemsets on association rules
Zhang Hua-xian · Computer Engineering and Applications Journal · 2011
An improved algorithm Apriori-M which combines with 2-itemsets support count matrix is brought forward for its lower efficiency of time.The algorithm scans the database to generate 2-itemsets support count matrix,and then improves the efficiency of the connectivity and the pruning by the character of the matrix;gets all the frequent itemsets correctly by scanning the database second time,and also solves the question about generating 2-itemsets invalid.Experimental results show that the capability of the improved algorithm is more efficient than Apriori.