Abstract:
With the evolution of geographic information capture and the emergency of volunteered geographic information, it is getting more important to extract spatial knowledge automatically from large spatial datasets.
Spatial co-location patterns represent the subsets of spatial features whose objects are often located in close
geographic proximity. Such pattern is one of the most important concepts for geographic context awareness
of location-based services (LBS). In the literature, most existing methods of co-location mining are used for
events taking place in a homogeneous and isotropic space with distance expressed as Euclidean, while the
physical movement in LBS is usually constrained by a road network. As a result, the interestingness value
of co-location patterns involving network-constrained events cannot be accurately computed. In this paper,
we propose a different method for co-location mining with network configurations of the geographical space
considered. First, we define the network model with linear referencing and refine the neighborhood of traditional methods using network distances rather than Euclidean ones. Then, considering that the co-location
mining in networks suffers from expensive spatial-join operation, we propose an efficient way to find all
neighboring object pairs for generating clique instances. By comparison with the previous approaches based
on Euclidean distance, this approach can be applied to accurately calculate the probability of occurrence of
a spatial co-location on a network. Our experimental results from real and synthetic data sets show that
the proposed approach is efficient and effective in identifying co-location patterns which actually rely on a
network.
