Association rules mining algorithm based on binary
基于二进制的关联规则挖掘算法

This paper proposed a novel idea of binary-based association rules mining algorithm. There some transaction items were the same in a database. It was not necessary to work out the pure subsets for everyone but only to aim at every kind of them. With this algorithm all frequent itemsets could be minded by scanning the database only one time. The algorithm was very efficient and effective compaxed to the traditional methods. When the rain-support and rain-confidence were modified, it could get the frequent itemsets easily without scanning the database again.