Skip to main content

Finding Time-Dependent Hot Path from GPS Trajectories

  • Conference paper
Web-Age Information Management (WAIM 2014)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 8485))

Included in the following conference series:

  • 5854 Accesses

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.

This research is supported in part by the National Natural Science Foundation of China (NSFC) under grant 61073001.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chen, Z., Shen, H.T., Zhou, X.: Discovering popular routes from trajectories. In: ICDE, pp. 900–911 (2011)

    Google Scholar 

  2. Wei, L.-Y., Zheng, Y., Peng, W.-C.: Constructing popular routes from uncertain trajectories. In: KDD, pp. 195–203 (2012)

    Google Scholar 

  3. Kumar, P., Singh, V., Reddy, D.: Advanced traveler information system for Hyderabad city. IEEE Transactions on Intelligent Transportation Systems 6(1), 26–37 (2005)

    Article  Google Scholar 

  4. Sacharidis, D., Patroumpas, K., Terrovitis, M., Kantere, V., Potamias, M., Mouratidis, K., Sellis, T.K.: On-line discovery of hot motion paths. In: EDBT, pp. 392–403 (2008)

    Google Scholar 

  5. Li, X., Han, J., Lee, J.-G., Gonzalez, H.: Traffic density-based discovery of hot routes in road networks. In: Papadias, D., Zhang, D., Kollios, G. (eds.) SSTD 2007. LNCS, vol. 4605, pp. 441–459. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  6. Yuan, J., Zheng, Y., Xie, X., Sun, G.: Driving with knowledge from the physical world. In: KDD, pp. 316–324 (2011)

    Google Scholar 

  7. Yuan, J., Zheng, Y., Zhang, C., Xie, W., Xie, X., Sun, G., Huang, Y.: T-drive: driving directions based on taxi trajectories. In: GIS, pp. 99–108 (2010)

    Google Scholar 

  8. Guo, D., Liu, S., Jin, H.: A graph-based approach to vehicle trajectory analysis. J. Location Based Services 4(3&4), 183–199 (2010)

    Google Scholar 

  9. Li, Q., Zeng, Z., Zhang, T., Li, J., Wu, Z.: Path-finding through flexible hierarchical road networks: An experiential approach using taxi trajectory data. Int. J. Applied Earth Observation and Geoinformation 13(1), 110–119 (2011)

    Article  Google Scholar 

  10. Giannotti, F., Nanni, M., Pedreschi, D., Pinelli, F., Renso, C., Rinzivillo, S., Trasarti, R.: Mobility data mining: discovering movement patterns from trajectory data. In: Computational Transportation Science, pp. 7–10 (2010)

    Google Scholar 

  11. Jeung, H., Yiu, M.L., Zhou, X., Jensen, C.S., Shen Discovery, H.T., Shen, H.T.: Discovery of convoys in trajectory databases. PVLDB 1(1), 1068–1080 (2008)

    Google Scholar 

  12. Kalnis, P., Mamoulis, N., Bakiras, S.: On discovering moving clusters in spatio-temporal data. In: Medeiros, C.B., Egenhofer, M., Bertino, E. (eds.) SSTD 2005. LNCS, vol. 3633, pp. 364–381. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  13. Li, Z., Ding, B., Han, J., Kays, R., Nye, P.: Mining periodic behaviors for moving objects. In: KDD, pp. 1099–1108 (2010)

    Google Scholar 

  14. Ding, B., Yu, J.X., Qin, L.: Finding time-dependent shortest paths over large graphs. In: EDBT, pp. 205–216 (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Chen, Y., Yang, K., Hu, H., Shan, Z., Song, R., Sun, W. (2014). Finding Time-Dependent Hot Path from GPS Trajectories. In: Li, F., Li, G., Hwang, Sw., Yao, B., Zhang, Z. (eds) Web-Age Information Management. WAIM 2014. Lecture Notes in Computer Science, vol 8485. Springer, Cham. https://doi.org/10.1007/978-3-319-08010-9_83

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-08010-9_83

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-08009-3

  • Online ISBN: 978-3-319-08010-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics