Finding Time-dependent hot path from GPS trajectories

0Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Finding hot path is important in many scenarios like trip planning, traffic management and animal movement studies. However, in practice, the hotness of paths may change over time, e.g., for one path, it is hotter in morning rush hour than in the midnight. This paper studies how to find time-dependent hot path. Given two locations, a departure time and a travel time limit, our task is to get a hot path highly fitting the real-time physical world within a user-specified travel time limit. We first analyze the change of edge hotness in different time ranges by learning historical GPS trajectories. Then, with the time-dependent hotness information, we propose an effective algorithm to answer the hot path query mentioned above. Extensive experiments on a real dataset show that our methods outperform the baseline approaches in terms of both effectiveness and efficiency. © 2014 Springer International Publishing Switzerland.

Cite

CITATION STYLE

APA

Chen, Y., Yang, K., Hu, H., Shan, Z., Song, R., & Sun, W. (2014). Finding Time-dependent hot path from GPS trajectories. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8485 LNCS, pp. 768–780). Springer Verlag. https://doi.org/10.1007/978-3-319-08010-9_83

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free