基于二维数组的Apriori关联规则算法改进与实现

The Improvement and Implementation of the Apriori Algorithm Based on Two-dimensional Array

通过建立事务二维数组和事务量缩减等方法对Apriori算法进行改进,并利用C++语言予以实现.结果表明,建立二维数组减少了数据库的扫描次数,同时在项目和事务两个维度上进行减枝,大幅度降低了计算的时间复杂度.

In this paper,the Apriori algorithm will be improved by establishing transaction two-dimen-sional array and cut in transactions,and implemented by C＋＋ . The results show that the two-dimensional array reduced the times of scanning database, and curtailing both in transactions and items greatly reduces the time complexity of computing.