Research on Topology Association Rules Algorithm Based on Spatial Constraints

Abstract

Spatial topological relation is an important and typical multilayer spatial relation, when Apriori is used to mining spatial constraint topology association rules, it will has some repeated computing. And so this paper proposes an algorithm of spatial constraint topology association rules mining based on complement set, which is used to mining spatial multilayer transverse association rules with constraint condition from spatial database. This algorithm generates candidate frequent topological itemsets with constraint condition not only by down-top search strategy as Apriori, but also by computing complement set of candidate from down-top search strategy, which is suitable for mining any spatial topological frequent itemsets with constraint condition. This algorithm compresses a kind of spatial topological relation to form an integer. By the way, firstly, the algorithm may efficiently reduce some storage space when creating mining database. Secondly, the algorithm is fast to obtain topological relation between two spatial objects, namely, it may easily compute support of candidate frequent itemsets. Finally, the algorithm may fast generate candidate via double search strategy, i.e. one is that it connects (k+1)-candidate frequent itemsets with constraint condition of k-frequent itemsets as down-top search strategy, the other is that it computes complement set of (k+1)-candidate frequent itemsets with constraint condition. The result of experiment indicates that the algorithm is able to extract spatial multilayer transverse association rules with constraint condition from spatial database via efficient data store, and it is very efficient to extract any frequent topology association rules with constraint condition.