关键词: 关联规则, 项目压缩, 项集有序, 事务压缩, 二维数组, Apriori算法

Abstract: For the bottlenecks of the Apriori algorithm, which restrict the efficiency of the Apriori algorithm, an optimized method was presented, which can take advantage of a two-dimensional array marker bit to achieve transaction reduction in association with taking advantage of order item to achieve item reduction. Reducing the times of joining as well as the number of scannings of the database will shorten the scan time. This algorithm takes advantage of order itemsets to improve the strategy, which is used to determine whether to join or not. And it removes useless transactions step by the step based on the transformation of a marker bit to reduce the number of transactions and items, while reducing the time of judgment. The results of an experiment show that the improved algorithm is more efficient.

Key words: order itemsets, item reduction, transaction reduction, two-dimensional array, Apriori algorithm, association rule