基于矩阵的Apriori改进算法研究

The Improved Apriori Algorithm Research Based on Matrix

针对关联规则中Apriori算法的不足之处,提出两种基于矩阵的Apriori改进算法.改进算法充分利用矩阵这一工具,以大幅度减少扫描数据库的次数和计算成本,进而有效提高算法的运算效率.同时,通过实例应用和算法性能分析证明所提出的两种改进算法都是有效的关联规则挖掘方法,且比Apriori算法具有更好的性能.

For the inadequacy of Apriori algorithm in association rules, this paper presents two methods of Apriori Algorithm based on matrix. Improved algorithms make full use of the matrix to significantly reduce the number of scans the database and computing costs, and then improve the efficiency of the algorithm effectively. Meanwhile, the application example and algorithm performance analysis shows that the proposed two improved algorithms are efficient association rule mining method, and the properties are better than the Apriori algorithm.