In this paper, we focus on a typical situation of LBS which is to provide services for users in cars that move in a road network. For such kind of users, the problem of k-CNN search along a specific route on road network is to find out k nearest neighbor (k-NN) objects for any place on the route, k nearest neighbors are selected based on the path length from the route to the objects, and the continuous search for all the points on the route should be considered. A k-CNN search method is proposed by using an incremental k-NN search based on road network. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Feng, J., Mukai, N., & Watanabe, T. (2005). Stepwise optimization method for k-CNN search for location-based service. In Lecture Notes in Computer Science (Vol. 3381, pp. 368–371). Springer Verlag. https://doi.org/10.1007/978-3-540-30577-4_41
Mendeley helps you to discover research relevant for your work.