关键词: 数据挖掘, 关联规则, 二进制, 互补挖掘, 空间关联

Abstract: An algorithm of transaction complement mining is presented，which uses transaction complement search strategy to generate candidate-items，the number of which is reduced by pruning subsets of frequent item sets and superset of non-frequent item sets，and further uses binary logic operation and transaction character to count support，its efficiency is improved.The algorithm is used to extract transverse spatial association rules，and its experiment indicates that the efficiency is fast and efficient.

Key words: data mining, association rules, binary, complement mining, spatial association