Skip to main content

Trajectory Clustering via Effective Partitioning

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5822))

Abstract

The increasing availability of huge amounts of data pertaining to time and positions generated by different sources using a wide variety of technologies (e.g., RFID tags, GPS, GSM networks) leads to large spatial data collections. Mining such amounts of data is challenging, since the possibility to extract useful information from this peculiar kind of data is crucial in many application scenarios such as vehicle traffic management, hand-off in cellular networks, supply chain management. In this paper, we address the problem of clustering spatial trajectories. In the context of trajectory data, clustering is really challenging as we deal with data (trajectories) for which the order of elements is relevant. We propose a novel approach based on a suitable regioning strategy and an efficient and effective clustering technique based on a proper metric. Finally, we performed several tests on real world datasets that confirmed the efficiency and effectiveness of the proposed techniques.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ester, M., Kriegel, H.P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: KDD (1996)

    Google Scholar 

  2. Frigo, M., Johnson, S.G.: FFTW: An adaptive software architecture for the FFT. In: Procs. ICASSP, vol. 3, pp. 1381–1384 (1998)

    Google Scholar 

  3. Giannotti, F., Nanni, M., Pinelli, F., Pedreschi, D.: Trajectory pattern mining. In: Proc. 13th Intn’l Conf. Knowledge Discovery and Data Mining, pp. 330–339 (2007)

    Google Scholar 

  4. Jae-Gil, L., Jiawei, H., Kyu-Young, W.: Trajectory clustering: a partition-and-group framework. In: SIGMOD 2007 (2007)

    Google Scholar 

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

    Google Scholar 

  6. Jolliffe, I.T.: Principal Component Analysis. Springer Series in Statistics (2002)

    Google Scholar 

  7. Lee, J.G., Han, J., Li, X.: Trajectory outlier detection: A partition-and-detect framework. In: Procs. 24th International Conference on Data Engineering (ICDE 2008), pp. 140–149 (2008)

    Google Scholar 

  8. Lee, J.G., Han, J., Li, X., Gonzalez, H.: TraClass: trajectory classification using hierarchical region-based and trajectory-based clustering. PVLDB 1(1) (2008)

    Google Scholar 

  9. Li, Y., Han, J., Yang, J.: Clustering moving objects. In: Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 617–622 (2004)

    Google Scholar 

  10. Lloyd, S.: Least squares quantization in pcm. IEEE TOIT 28 (1982)

    Google Scholar 

  11. Yang, J., Hu, M.: Trajpattern: Mining sequential patterns from imprecise trajectories of mobile objects. In: Proc. of Extending Database Technology, pp. 664–681 (2006)

    Google Scholar 

  12. Zhang, T., Ramakrishnan, R., Livny, M.: Birch: An efficient data clustering method for very large databases. In: SIGMOD Conference, pp. 103–114 (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Masciari, E. (2009). Trajectory Clustering via Effective Partitioning. In: Andreasen, T., Yager, R.R., Bulskov, H., Christiansen, H., Larsen, H.L. (eds) Flexible Query Answering Systems. FQAS 2009. Lecture Notes in Computer Science(), vol 5822. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04957-6_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04957-6_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04956-9

  • Online ISBN: 978-3-642-04957-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics