A data model and data structures for moving objects databases
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Introduction to Modern Information Retrieval
Introduction to Modern Information Retrieval
Efficient Retrieval of Similar Time Sequences Under Time Warping
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Efficient Searches for Similar Subsequences of Different Lengths in Sequence Databases
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
| Hi-index | 0.00 |
Similarity measure scheme on moving objects has become a topic of increasing in the area of moving databases. In this paper, we propose a new similarity search algorithm for efficient sub-trajectory matching. For measuring similarity between two sub-trajectories, we propose a new v(variable)-warping distance algorithm which enhances the existing time warping distance algorithm by permitting up to v replications for an arbitrary motion of a query trajectory. Our v-warping distance algorithm provides an approximate matching between two trajectories as well as an exact matching between them. Based on our v-warping distance algorithm, we also present a similarity measure scheme for the single trajectory in moving databases. Finally, we show that our scheme based on the v-warping distance achieves much better performance than other conventional schemes, such as Li's one (no-warping) and Shan's one (infinite-warping) in terms of precision and recall measures.