KNFCOM-T: a k-nearest features-based co-location pattern mining algorithm for large spatial data sets by using T-trees Online publication date: Sun, 25-Jan-2009
by You Wan, Jiaogen Zhou
International Journal of Business Intelligence and Data Mining (IJBIDM), Vol. 3, No. 4, 2008
Abstract: Spatial co-location patterns represent the subsets of Boolean spatial features whose instances often locate in close geographic proximity. The existing co-location pattern mining algorithms aim to find spatial relations based on the distance threshold. However, it is hard to decide the distance threshold for a spatial data set without any prior knowledge. Moreover, spatial data sets are usually not evenly distributed and a single distance value cannot fit an irregularly distributed spatial data set well. In this paper, we propose the notion of the k-nearest features (simply k-NF)-based co-location pattern. The k-NF set of a spatial feature's instances is used to evaluate the spatial relationship between this feature and any other feature. A k-NF-based co-location pattern mining algorithm by using T-tree (KNFCOM-T in short) is further presented to identify the co-location patterns in large spatial data sets. The experimental results show that the KNFCOM-T algorithm is effective and efficient and its complexity is O(n).
Online publication date: Sun, 25-Jan-2009
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Business Intelligence and Data Mining (IJBIDM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email firstname.lastname@example.org