Range search on uncertain trajectories

Publisher:
ACM
Publication Type:
Conference Proceeding
Citation:
Proceedings of the 24th ACM International on Conference on Information and Knowledge Management, 2015, 19-23-Oct-2015 pp. 921 - 930
Issue Date:
2015-10-17
Full metadata record
Files in This Item:
Filename Description Size
CIKM_2015_range_search_trajectory.pdfPublished version1.33 MB
Adobe PDF
The range search on trajectories is fundamental in a wide spectrum of applications such as environment monitoring and location based services. In practice, a large portion of spatio-temporal data in the above applications is generated with low sampling rate and the uncertainty arises between two subsequent observations of a moving object. To make sense of the uncertain trajectory data, it is critical to properly model the uncertainty of the trajectories and develop efficient range search algorithms on the new model. Assuming uncertain trajectories are modeled by the popular Markov Chains, in this paper we investigate the problem of range search on uncertain trajectories. In particular, we propose a general framework for range search on uncertain trajectories following the filtering-and-refinement paradigm where summaries of uncertain trajectories are constructed to facilitate the filtering process. Moreover, statistics based and partition based filtering techniques are developed to enhance the filtering capabilities. Comprehensive experiments demonstrate the effectiveness and efficiency of our new techniques.
Please use this identifier to cite or link to this item: