Improved Apriori Algorithm Based on Compressing Transactional Matrix Multiplication
Apriori algorithm is one of the most classical algorithm in association rules, however, the algorithm is low efficiency, such as firstly it needs to repeatedly scan the database, which spends much in I/O. Secondly, it create a large number of 2- candidate itemsets during outputting frequent 2- itemsets. Thirdly, it doesn’t cancel the useless itemsets during outputting frequent k- itemsets. In the paper, it describes an improved algorithm based on the compressed matrices which improve the efficiency during creating frequent k- itemsets on three aspects, which simply scans the database once, after compressed transactional matrix, and by multiplied matrix get the frequent item sets, which effectively improved the efficiency in mining association rules.
Y. S. He and P. Du, "Improved Apriori Algorithm Based on Compressing Transactional Matrix Multiplication", Key Engineering Materials, Vols. 460-461, pp. 409-413, 2011