By Topic

K nearest neighbors search for the trajectory of moving object

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Liu Xiao-feng ; Coll. of Comput. Sci. & Technol., Huazhong Univ. of Sci. & Technol., China ; Liu Yun-sheng ; Xiao Yin-yuan

This paper addresses the problem of finding the K nearest neighbors for the trajectory of moving object in the context where the dataset is static and stored in an R-tree. By converted into discovering the K nearest neighbors of the line segment, this kind of query is simplified. Several distance functions between MBRs and line segments are defined and used to prune search space and minimize the pruning distance. Based on branch-and-bound technique and proposed pruning, updating and visiting heuristics, recursive depth-first and heap-based best-first algorithms are presented. An extensive study based on experiments performed with synthetic dataset shows that best-first algorithm outperforms the depth-first algorithm.

Published in:

Wireless Communications, Networking and Mobile Computing, 2005. Proceedings. 2005 International Conference on  (Volume:2 )

Date of Conference:

23-26 Sept. 2005