一种基于BIT存贮运算的Apriori改进算法

An Improved Apriori Algorithm based on the Operation of Bit Storage

探讨了Apriori算法的改进问题,提出了一种基于BIT存贮运算的关联规则挖掘算法。该算法可把相当大的数据集读入内存,并在内存中使用高效的BIT运算快速进行计数,同时简化了Apriori算法中候选项集的计算,由直接判断生成频繁项集,大大地减少了中间变量及其存贮的时间和空间,提高了关联规则挖掘的速度和效率。

In this paper by analyzing the existing improving strategy for Apriori algorithm, the author offers a new algorithm of association rules based on the operation of bit storage. First, the new algorithm can put good-sized data sets into memory and use efficient bit operation to take count fast, and then the algorithm simplifies the calculation of Candidate itemsets of Apriori algorithm and realize directly frequent itemsets to reduce the temporary variables and the time and space of storage. To sum up, the algorithm improves the speed and efficiency of association rule data mining.