In the Apriori algorithm, C2 is generally the greatest one, wasting most of the time on generating frequency binomial set.This paper proposes an algorithm based on MAT (Matrix) to solve this problem.

• 针对Apriori算法中C2通常是最大的，算法的绝大部分时间消耗在生成频繁2-项集上的问题，论文提出了一种基于矩阵的MAT(Matrix)算法。