关键词: 关联规则, 事务互补, 双向搜索, 二进制, 挖掘算法

Abstract: An algorithm of double search mining based on transaction complementarity is presented，which is suitable for mining any long frequent item set.The algorithm uses top-down strategy and the way of transaction complementarity to generate frequent candidate item set in double search by binary logical operation，and uses transaction character to reduce the number of search transaction when computing support.Comparing with other algorithms，the experiment indicates that the algorithm is fast and efficient.

Key words: association rules, transaction complementarity, double search, binary, mining algorithm