An algorithm of association rules double search mining based on binary

In order to solve these problems how to easily generate candidate frequent item sets and fast compute support of candidate item sets, an algorithm of association rules mining based on binary has been introduced. However, one presented binary mining algorithm is only suitable for mining some relative short frequent item sets since the way of generating candidate item sets is also similar to Apriori, another is only suitable for mining long frequent item sets, which generates candidate item sets by up-down search strategy. And so aiming to mining general frequent item sets, this paper proposes an algorithm of association rules double search mining based on binary, which is different from tradition association rules mining algorithm based on double search strategy. The algorithm doesn’t use combination of set theory to generate candidate item sets but binary logic operation that is also used to compute support of candidate item sets, which can use character digital to reduce the number of scanned transaction. The algorithm gets rid of shortage about some presented algorithms based on binary. The experiment based on above three algorithms indicates that the efficiency about double search strategy is fast and efficient when mining general frequent item sets which aren’t confined.