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.
Original language | English |
---|---|
Title of host publication | 27th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM SIGSPATIAL GIS 2019 |
Editors | Farnoush Banaei-Kashani, Goce Trajcevski, Ralf Hartmut Guting, Lars Kulik, Shawn Newsam |
Place of Publication | New York |
Publisher | Association for Computing Machinery, Inc |
Pages | 496-499 |
Number of pages | 4 |
ISBN (Electronic) | 978-1-4503-6909-1 |
DOIs | |
Publication status | Published - 5 Nov 2019 |
Event | 27th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems - Chicago, IL, United States Duration: 5 Nov 2019 → 8 Dec 2019 http://sigspatial2019.sigspatial.org/ |
Conference
Conference | 27th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems |
---|---|
Abbreviated title | ACM SIGSPATIAL 2019 |
Country/Territory | United States |
City | Chicago, IL |
Period | 5/11/19 → 8/12/19 |
Internet address |
Keywords
- Algorithms and Data Structures
- Clustering
- Computational Geometry
- Trajectories