关键词: 关联规则, Apriori算法, 事务矩阵, 频繁项集

Abstract: Apriori algorithm is a classical algorithm using association rules in data mining, The algorithm has the defect of producing a large number of candidate itemsets and scanning the database many times. This paper puts forward an improved Apriori algorithm based on matrix compression, which scans a database and turns it into a Boolean transaction matrix, and then compresses the transaction matrix according to the relevant properties to reduce the amount of computation. The experimental results show that the improved algorithm performance has been significantly improved.

Key words: association rule, Apriori algorithm, transaction matrix, frequent itemsets