Abstract

Regional co-location scoping intends to identify local regions where spatial features of interest are frequently located together. Most of the previous researches in this domain are conducted on a global scale and they assume that spatial objects are embedded in a 2-D space, but the movement in urban space is actually constrained by the street network. In this paper we refine the scope of co-location patterns to 1-D paths consisting of nodes and segments. Furthermore, since the relations between spatial events are usually inversely proportional to their separation distance, the proposed method introduces the “Distance Decay Effects” to improve the result. Specifically, our approach first subdivides the street edges into continuous small linear segments. Then a value representing the local distribution intensity of events is estimated for each linear segment using the distance-decay function. Each kind of geographic feature can lead to a tessellated network with density attribute, and the generated multiple networks for the pattern of interest will be finally combined into a composite network by calculating the co-location prevalence measure values, which are based on the density variation between different features. Our experiments verify that the proposed approach is effective in urban analysis.

Highlights

  • With the rapid development and extensive application of ubiquitous network technology, huge collections of geospatial data become available

  • The neighborhood threshold was set to 300 m for two reasons: firstly, by constructing street blocks from the street network in Shenzhen, we found that the average block neighborhood is about 228 m; In addition, researchers [46] in urban studies suggested that 300 m distance is suitable for the analyzing of spatial interactions at the scales of neighborhood

  • The movements are usually restricted to the layout of street network and the patterns concerning spatial interactions largely depend on the computation of network distance instead of Euclidean distance

Read more

Summary

Introduction

With the rapid development and extensive application of ubiquitous network technology, huge collections of geospatial data become available. The major objective of spatial data mining is to automatically discover interesting, potentially useful, and previously unknown patterns from large amounts of geo-referenced data [1]. This process is usually realized via spatial co-location/correlation pattern mining [1,2,3]. Spatial co-location pattern is a subset of spatial features whose events are usually located in close spatial proximity. Finding such a pattern is one of the most important techniques for understanding geographically global relationships in spatial data sets.

Methods
Results
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call