Skip to main content

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 355))

Abstract

As positioning and communication technologies become more widespread, the production of large amounts of different types of trajectory data and the extraction of useful information from mass trajectory data have emerged as hot issues in data mining. This paper presents a trajectory data processing method featuring simple operation, high precision, and strong practicability. For low-precision trajectory data that are discrete but contain time information, a clustering algorithm is proposed to extract information from such data. The algorithm can detect a point of interest (POI) in trajectory data by setting space and time thresholds. Trajectory data collected from a taxi using a global positioning system in Kunming, China, are used as experimental data. We conduct an experiment to detect a POI in the collected trajectory data and carry out a visual analysis of these special positions. The experimental results show the effectiveness of the algorithm, which can in addition compress trajectory data.

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 259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Hariharan R, Toyama K. Project Lachesis: parsing and modeling location histories. Geogr Inf Sci. 2004;18(5):106–24.

    Article  Google Scholar 

  2. Bamis M, et al. Lightweight extraction of frequent spatio-temporal activities from GPS traces. Real Time Syst Symp. 2010;275(31):281–91.

    Google Scholar 

  3. Kami N, et al. Algorithm for detecting significant locations from raw GPS data. Discov Sci. 2010;321(18):221–35.

    Google Scholar 

  4. Hägerstraand T. What about people in regional science? Pap Reg Sci. 1970;24(9):7–24.

    Google Scholar 

  5. Zheng Y, et al. GeoLife2.0: a location-based social networking service. Proceedings of the MDM’09; Beijing, China; 2009. pp. 357–58.

    Google Scholar 

  6. Xie X, et al. Understanding user behavior geospatially, contextual and social media understanding and usage. J ACM. 2009;214(3):233–41.

    Google Scholar 

  7. Zheng Y, et al. Learning transportation mode from raw GPS data for geographic applications on the web. Submitted to WWW 2008; Journal of the Association for Computing Machinery(JACM); 2008.185(2):247–56.

    Google Scholar 

  8. Wolfson O, et al. Updating and querying databases that track mobile units. Distributed Parallel Database. 1999;7(3):257–387.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hongchu Yu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Chen, Y., Yu, H., Chen, L. (2015). A Spatiotemporal Cluster Method for Trajectory Data. In: Wong, W. (eds) Proceedings of the 4th International Conference on Computer Engineering and Networks. Lecture Notes in Electrical Engineering, vol 355. Springer, Cham. https://doi.org/10.1007/978-3-319-11104-9_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-11104-9_1

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-11103-2

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

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics