基于矩阵的Apriori算法的优化

An Improvement of Apriori Algorithm Based on Matrix

在数据挖掘中关联规则挖掘是很重要的一个方面,而Apriori算法是进行关联规则挖掘的经典算法。本文首先分析了经典Apriori算法,然后利用矩阵的思想对其改进,并利用事务压缩的思想对矩阵进行压缩。改进后的算法明显提高了Apriori算法的效率。

Mining association rule is a very important facet for data mining, while Apriori algorithm is classic algorithm for association rule. The paper analyzes the classic Apriori algorithm first, then modifies it based on matrix and compresses the matrix based on transaction compression. The modified algorithm obviously improves the efficency of Apriori algorithm.