skip to main content
10.1145/3347146.3359111acmconferencesArticle/Chapter ViewAbstractPublication PagesgisConference Proceedingsconference-collections
poster

klcluster: Center-based Clustering of Trajectories

Published: 05 November 2019 Publication History

Abstract

Center-based clustering, in particular k-means clustering, is frequently used for point data. Its advantages include that the resulting clustering is often easy to interpret and that the cluster centers provide a compact representation of the data. Recent theoretical advances have been made in generalizing center-based clustering to trajectory data. Building upon these theoretical results, we present practical algorithms for center-based trajectory clustering.

References

[1]
Pankaj K. Agarwal, Sariel Har-Peled, Nabil H. Mustafa, and Yusu Wang. 2005. Near-Linear Time Approximation Algorithms for Curve Simplification. Algorithmica 42, 3-4 (2005), 203--219.
[2]
Helmut Alt and Michael Godau. 1995. Computing the Fréchet Distance between Two Polygonal Curves. Int. J. Comput. Geometry Appl. 5 (1995), 75--91.
[3]
David Arthur and Sergei Vassilvitskii. 2007. k-means++: The advantages of careful seeding. In Proc. 18th ACM-SIAM Symposium on Discrete Algorithms. 1027--1035.
[4]
Sergey Bereg, Minghui Jiang, Wencheng Wang, Boting Yang, and Binhai Zhu. 2008. Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance. In Proc. 8th Latin American Symposium on Theoretical Informatics. 630--641.
[5]
Karl Bringmann, Marvin Künnemann, and André Nusser. 2019. Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance. In Proc. 35th Internat. Symposium on Computational Geometry.
[6]
Kevin Buchin, Maike Buchin, David Duran, Brittany Terese Fasy, Roel Jacobs, Vera Sacristan, Rodrigo I Silveira, Frank Staals, and Carola Wenk. 2017. Clustering trajectories for map construction. In Proc. 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems. ACM, 14.
[7]
Kevin Buchin, Maike Buchin, and Joachim Gudmundsson. 2010. Constrained free space diagrams: a tool for trajectory analysis. International Journal of Geographical Information Science 24, 7 (2010), 1101--1125.
[8]
Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Maarten Löffler, and Jun Luo. 2011. Detecting commuting patterns by clustering subtrajectories. International Journal of Computational Geometry & Applications 21, 03 (2011), 253--282.
[9]
Kevin Buchin, Anne Driemel, Joachim Gudmundsson, Michael Horton, Irina Kostitsyna, Maarten Löffler, and Martijn Struijs. 2019. Approximating (k, ℓ)-center clustering for curves. In Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, 2922--2938.
[10]
Thomas Devogele, Laurent Etienne, Maxence Esnault, and Florian Lardy. 2017. Optimized Discrete Fréchet Distance between trajectories. In Proc. 6th ACM SIGSPATIAL Workshop on Analytics for Big Geospatial Data. ACM, 11--19.
[11]
Anne Driemel, Amer Krivosija, and Christian Sohler. 2016. Clustering time series under the Fréchet distance. In Proc. 27th Annual ACM-SIAM Symposium on Discrete Algorithms. 766--785.
[12]
Chenglin Fan, Omrit Filtser, Matthew J. Katz, and Binhai Zhu. 2016. On the General Chain Pair Simplification Problem. In 41st Internat. Sympos. Mathematical Foundations of Computer Science. 37:1--37:14.
[13]
Teofilo F. Gonzalez. 1985. Clustering to Minimize the Maximum Intercluster Distance. Theoretical Computer Science 38 (1985), 293--306.
[14]
Dimitrios Kotsakos, Goce Trajcevski, Dimitrios Gunopulos, and Charu C. Aggarwal. 2013. Time-Series Data Clustering. In Data Clustering: Algorithms and Applications. 357--380.
[15]
Jae-Gil Lee, Jiawei Han, and Kyu-Young Whang. 2007. Trajectory clustering: a partition-and-group framework. In Proc. ACM SIGMOD International Conference on Management of Data, Beijing, China, June 12-14, 2007. 593--604.
[16]
Stuart Lloyd. 1982. Least squares quantization in PCM. IEEE Transactions on Information Theory 28, 2 (1982), 129--137.
[17]
R. P. Mann, R. Freeman, M. Osborne, R. Garnett, C. Armstrong, J. Meade, D. Biro, T. Guilford, and S. Roberts. 2011. Objectively identifying landmark use and predicting flight trajectories of the homing pigeon using Gaussian processes. Journal of The Royal Society Interface 8, 55 (2011), 210--219. arXiv:http://rsif.royalsocietypublishing.org/content/8/55/210.full.pdf
[18]
Nikos Pelekis, Ioannis Kopanakis, Gerasimos Marketos, Irene Ntoutsi, Gennady Andrienko, and Yannis Theodoridis. 2007. Similarity search in trajectory databases. In Proc. 14th Internat. Sympos. Temporal Representation and Reasoning (TIME'07). IEEE, 129--140.
[19]
François Petitjean and Pierre Gançarski. 2012. Summarizing a set of time series by averaging: From Steiner sequence to compact multiple alignment. Theoretical Computer Science 414, 1 (2012), 76--91.
[20]
Natasja van de L'Isle. 2018. Algorithms for center-based trajectory clustering. Master's thesis. Eindhoven Technical University, the Netherlands. https://pure.tue.nl/ws/portalfiles/portal/125739911/thesis_NatasjaVanDeLIsle.pdf_2.pdf
[21]
Michail Vlachos, Dimitrios Gunopoulos, and George Kollios. 2002. Discovering Similar Multidimensional Trajectories. In Proc. 18th Internat. Conf. Data Engineering. IEEE, 0673.
[22]
Michail Vlachos, Marios Hadjieleftheriou, Dimitrios Gunopulos, and Eamonn Keogh. 2003. Indexing multi-dimensional time-series with support for multiple distance measures. In Proc. 9th ACM SIGKDD Internat. Conf,. Knowledge Discovery and Data Mining. ACM, 216--225.

Cited By

View all
  • (2025)Enhancing clustering of trajectories through optimization of geometric featuresEarth Science Informatics10.1007/s12145-025-01774-418:3Online publication date: 19-Feb-2025
  • (2024)Computing Safe Stop Trajectories for Autonomous Driving Utilizing Clustering and Parametric OptimizationVehicles10.3390/vehicles60200276:2(590-610)Online publication date: 24-Mar-2024
  • (2024)Online Research Topic Modeling and Recommendation Utilizing Multiview Autoencoder-Based ApproachIEEE Transactions on Computational Social Systems10.1109/TCSS.2023.325350211:1(1013-1022)Online publication date: Feb-2024
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
SIGSPATIAL '19: Proceedings of the 27th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
November 2019
648 pages
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 05 November 2019

Check for updates

Author Tags

  1. Algorithms and Data Structures
  2. Clustering
  3. Computational Geometry
  4. Trajectories

Qualifiers

  • Poster
  • Research
  • Refereed limited

Conference

SIGSPATIAL '19
Sponsor:

Acceptance Rates

SIGSPATIAL '19 Paper Acceptance Rate 34 of 161 submissions, 21%;
Overall Acceptance Rate 257 of 1,238 submissions, 21%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)30
  • Downloads (Last 6 weeks)3
Reflects downloads up to 25 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2025)Enhancing clustering of trajectories through optimization of geometric featuresEarth Science Informatics10.1007/s12145-025-01774-418:3Online publication date: 19-Feb-2025
  • (2024)Computing Safe Stop Trajectories for Autonomous Driving Utilizing Clustering and Parametric OptimizationVehicles10.3390/vehicles60200276:2(590-610)Online publication date: 24-Mar-2024
  • (2024)Online Research Topic Modeling and Recommendation Utilizing Multiview Autoencoder-Based ApproachIEEE Transactions on Computational Social Systems10.1109/TCSS.2023.325350211:1(1013-1022)Online publication date: Feb-2024
  • (2024)Random Projections for Curves in High DimensionsDiscrete & Computational Geometry10.1007/s00454-024-00710-5Online publication date: 11-Dec-2024
  • (2022)Is Medoid Suitable for Averaging GPS Trajectories?ISPRS International Journal of Geo-Information10.3390/ijgi1102013311:2(133)Online publication date: 14-Feb-2022
  • (2022)Computing the Fréchet Distance Between Uncertain Curves in One DimensionComputational Geometry10.1016/j.comgeo.2022.101923(101923)Online publication date: Aug-2022
  • (2022)An experimental study on classifying spatial trajectoriesKnowledge and Information Systems10.1007/s10115-022-01802-565:4(1587-1609)Online publication date: 20-Dec-2022
  • (2022)Coresets for $$(k, \ell )$$-Median Clustering Under the Fréchet DistanceAlgorithms and Discrete Applied Mathematics10.1007/978-3-030-95018-7_14(167-180)Online publication date: 24-Jan-2022
  • (2021)Approximating (k, ℓ)-median clustering for polygonal curvesProceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3458064.3458224(2697-2716)Online publication date: 10-Jan-2021
  • (2021)Proposal for a Pivot-Based Vehicle Trajectory Clustering MethodTransportation Research Record: Journal of the Transportation Research Board10.1177/036119812110584292676:4(281-295)Online publication date: 4-Dec-2021
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media