An Algorithm of Mining Spatial Topology Association Rules Based on Complement Set
According to these shortcomings when Apriori is used to mining spatial topology association rules. This paper proposes an algorithm of mining spatial topology association rules based on complement set, which is used to mining spatial multilayer transverse association rules from spatial database. This algorithm generate candidate frequent topological itemsets not only by up search strategy as Apriori, but also by computing complement set of candidate from up search strategy, which is suitable for mining any spatial topological frequent itemsets. 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+l)-candidate frequent itemsets of k-frequent itemsets as up search strategy, the other is that it computes complement set of (k+l)-candidate frequent itemsets. The result of experiment indicates that the algorithm is able to extract spatial multilayer transverse association rules from spatial database via efficient data store, and it is very efficient to extract any frequent topology association rules.
spatial data mining topology association rules multilayer transverse association double search complement set
Xiao-Bin TANG Gang FANG
Chongqing Three Gorges University Chongqing 404000, P.R. China
国际会议
重庆
英文
54-57
2011-01-21（万方平台首次上网日期，不代表论文的发表时间）