Density based co-location pattern discovery
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Finding regional co-location patterns for sets of continuous variables in spatial datasets
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Optimal candidate generation in spatial co-location mining
Proceedings of the 2009 ACM symposium on Applied Computing
An order-clique-based approach for mining maximal co-locations
Information Sciences: an International Journal
Proceedings of the fifth ACM international conference on Web search and data mining
Hi-index | 0.00 |
The goal of spatial co-location pattern mining is to find subsets of spatial features frequently located together in spatial proximity. Example co-location patterns include services requested frequently and located together from mobile devices (e.g., PDAs and cellular phones) and symbiotic species in ecology (e.g., Nile crocodile and Egyptian plover). Spatial clustering groups similar spatial objects together. Reusing research results in clustering, e.g. algorithms and visualization techniques, by mapping colocation mining problem into a clustering problem would be very useful. However, directly clustering spatial objects from various spatial features may not yield well-defined colocation patterns. Clustering spatial objects in each layer followed by overlaying the layers of clusters may not applicable to many application domains where the spatial objects in some layers are not clustered. In this paper, we propose a new approach to the problem of mining co-location patterns using clustering techniques. First, we propose a novel framework for co-location mining using clustering techniques. We show that the proximity of two spatial features can be captured by summarizing their spatial objects embedded in a continuous space via various techniques. We define the desired properties of proximity functions compared to similarity functions in clustering. Furthermore, we summarize the properties of a list of popular spatial statistical measures as the proximity functions. Finally, we show that clustering techniques can be applied to reveal the rich structure formed by co-located spatial features. A case study on real datasets shows that our method is effective for mining co-locations from large spatial datasets.