关键词: 关联规则, 交叉挖掘, 数值递减, 数值递增, 数字特征, 二进制

Abstract: In order to easily generate candidate frequent itemsets and calculate support of itemsets，an algorithm of association rules mining based on binary is presented.However，at the time of searching candidate frequent itemsets，according to set theory this algorithm still uses traditional methods of searching superset or subset to generate candidate frequent itemsets，to a certain extent the efficiency of the algorithm has been influenced.Hence，this paper proposes an algorithm of intercrossing mining association rules based on binary，which automatically crossways generates candidate frequent itemsets through ascending and descending value to shorten searching space of candidate frequent itemsets，and then applies digital character to reduce the number of scanned transactions to be calculated support.And so the efficiency of the algorithm is obviously improved，and the experiment indicates that the algorithm is fast and efficient by comparing with existing algorithms of association rules mining based on binary.

Key words: association rules, intercrossing mining, value descending, value ascending, digital character, binary