关键词: 空间挖掘, 定序项目集, 互补挖掘, 双向搜索

Abstract: In order to efficiently improve the efficiency of mining algorithms based on spatial transactions，this paper proposes an algorithm of complementary spatial mining based on location order，which is suitable for mining any long frequent itemsets in many data.The algorithm uses the way of locating itemsets’ order to reduce redundant judgment operation and computing existing in presented algorithms，simultaneously uses complement of non-frequent itemsets to fast generate candidate to delete added operation existing in presented double mining algorithms，and the algorithm efficiently reduces runtime.The result of experiment indicates that the algorithm is more fast and efficient than presented algorithms in spatial data mining.

Key words: spatial mining, locating itemsets, complement mining, double search