Skip to main content

Hotspot District Trajectory Prediction

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

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

Included in the following conference series:

Abstract

Trajectory prediction (TP) of moving objects has grown rapidly to be a new exciting paradigm. However, existing prediction algorithms mainly employ kinematical models to approximate real world routes and always ignore spatial and temporal distance. In order to overcome the drawbacks of existing TP approaches, this study proposes a new trajectory prediction algorithm, called HDTP (Hotspot Distinct Trajectory Prediction). It works as: (1) mining the hotspot districts from trajectory data sets; (2) extracting the trajectory patterns from trajectory data; and (3) predicting the location of moving objects by using the common movement patterns. By comparing this proposed approach to E3TP, the experiments show HDTP is an efficient and effective algorithm for trajectory prediction, and its prediction accuracy is about 14.7% higher than E3TP.

Supported by the National Science Foundation of China under Grant No.60773169,the 11th Five Years Key Programs for Sci. and Tech. Development of China under grant No.2006BAI05A01, the National Science Foundation for Post-doctoral Scientists of China under Grant No.20090461346.

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. Saltenis, S., Jensen, C.S.: Indexing of Moving Objects for Location-Based Service. In: ICDE, pp. 463–472 (2002)

    Google Scholar 

  2. Morzy, M.: Mining frequent trajectories of moving objects for location prediction. In: Perner, P. (ed.) MLDM 2007. LNCS (LNAI), vol. 4571, pp. 667–680. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  3. Trajcevski, G., Wolfson, O., Hinrichs, K., Chamberlain, S.: Managing uncertainty in moving objects databases. ACM Trans. Database Syst. 29(3), 463–507 (2004)

    Article  Google Scholar 

  4. Tao, Y., Faloutsos, C., Papadias, D., Liu, B.: Prediction and indexing of moving objects with unknown motion patterns. In: SIGMOD, pp. 611–622 (2004)

    Google Scholar 

  5. Giannotti, F., Nanni, M., Pedreschi, D.: Efficient mining of temporally annotated sequences. In: SIAM, pp. 346–357 (2006)

    Google Scholar 

  6. Long, T., Qiao, S., Tang, C., Liu, L., Li, T., Wu, J.: E3TP: A novel trajectory prediction algorithm in moving objects databases. In: Chen, H., Yang, C.C., Chau, M., Li, S.-H. (eds.) PAISI 2009. LNCS, vol. 5477, pp. 76–88. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  7. Pei, et al.: Prefixspan: Mining sequential patterns by prefix-projected growth. In: ICDE, pp. 215–224 (2001)

    Google Scholar 

  8. Zaki, M.J.: Spade: An efficient algorithm for mining frequent sequences. J. Machine Learning 42(1/2), 31–60 (2001)

    Article  MATH  Google Scholar 

  9. Morzy, M.: Prediction of moving object location based on frequent trajectories. In: Levi, A., Savaş, E., Yenigün, H., Balcısoy, S., Saygın, Y. (eds.) ISCIS 2006. LNCS, vol. 4263, pp. 583–592. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  10. Shaojie, Q., Changjie, T., Huidong, J., Teng, L., Shucheng, D., Yungchang, K., Chiu-Lung, C.M.: PutMode: Prediction of Uncertain Trajectories in Moving Objects Databases. J. Applied Intelligence (2009), doi: 10.1007/s10489-009-0173-z

    Google Scholar 

  11. Zheng, Y., Zhang, L., Xie, X., Ma, W.: Mining interesting locations and travel sequences from GPS Trajectories. In: WWW, pp. 791–800 (2009)

    Google Scholar 

  12. Giannotti, F., Nanni, M., Pinelli, F., Pedreschi, D.: Trajectory pattern mining. In: KDD, pp. 330–339 (2007)

    Google Scholar 

  13. Monreale, A., Pinelli, F., Trasarti, R., Giannotti, F.: WhereNext: a Location Predictor on Trajectory Pattern Mining. In: KDD, pp. 637–645 (2009)

    Google Scholar 

  14. Brinkhoff, T.: A framework for generating network based moving objects. J. Geoinformatica 2(6), 153–180 (2002)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, H., Tang, C., Qiao, S., Wang, Y., Yang, N., Li, C. (2010). Hotspot District Trajectory Prediction. In: Shen, H.T., et al. Web-Age Information Management. WAIM 2010. Lecture Notes in Computer Science, vol 6185. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16720-1_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16720-1_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16719-5

  • Online ISBN: 978-3-642-16720-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics