{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T02:32:26Z","timestamp":1771036346606,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,11,3]],"date-time":"2020-11-03T00:00:00Z","timestamp":1604361600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100003246","name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["612.001.801"],"award-info":[{"award-number":["612.001.801"]}],"id":[{"id":"10.13039\/501100003246","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,11,3]]},"DOI":"10.1145\/3397536.3422245","type":"proceedings-article","created":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T22:14:09Z","timestamp":1606256049000},"page":"99-110","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["(k, l)-Medians Clustering of Trajectories Using Continuous Dynamic Time Warping"],"prefix":"10.1145","author":[{"given":"Milutin","family":"Brankovic","sequence":"first","affiliation":[{"name":"University of Sydney Darlington, NSW, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kevin","family":"Buchin","sequence":"additional","affiliation":[{"name":"TU Eindhoven Eindhoven, Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Koen","family":"Klaren","sequence":"additional","affiliation":[{"name":"TU Eindhoven Eindhoven, Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9","family":"Nusser","sequence":"additional","affiliation":[{"name":"Max Planck Institute for Informatics Graduate School of Computer Science Saarbr\u00fccken, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aleksandr","family":"Popov","sequence":"additional","affiliation":[{"name":"TU Eindhoven Eindhoven, Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sampson","family":"Wong","sequence":"additional","affiliation":[{"name":"University of Sydney Darlington, NSW, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,11,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-005-1165-y"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/3310435.3310616"},{"key":"e_1_3_2_1_3_1","volume-title":"17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT","volume":"19","author":"Buchin Kevin","year":"2020","unstructured":"Kevin Buchin , Anne Driemel , and Martijn Struijs . 2020 . On the Hardness of Computing an Average Curve . In 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020, Vol. 162). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany, Article 19 , 19 pages. https:\/\/doi.org\/10.4230\/LIPIcs.SWAT.2020.19 10.4230\/LIPIcs.SWAT.2020.19 Kevin Buchin, Anne Driemel, and Martijn Struijs. 2020. On the Hardness of Computing an Average Curve. In 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020, Vol. 162). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany, Article 19, 19 pages. https:\/\/doi.org\/10.4230\/LIPIcs.SWAT.2020.19"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3347146.3359111"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/2884435.2884490"},{"key":"e_1_3_2_1_7_1","volume-title":"UCI Machine Learning Repository","author":"Dua Dheeru","year":"2020","unstructured":"Dheeru Dua and Casey Graff . 2017. UCI Machine Learning Repository . University of California , Irvine. Retrieved 2020 --09--15 from http:\/\/archive.ics.uci.edu\/ml Dheeru Dua and Casey Graff. 2017. UCI Machine Learning Repository. University of California, Irvine. Retrieved 2020--09--15 from http:\/\/archive.ics.uci.edu\/ml"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10851-006-0647-0"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90224-5"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/2031416"},{"key":"e_1_3_2_1_11_1","volume-title":"Computational Morphology: A Computational Geometric Approach to the Analysis Of Form, Godfried T","author":"Imai Hiroshi","unstructured":"Hiroshi Imai and Masao Iri . 1988. Polygonal Approximations of a Curve-Formulations and Algorithms . In Computational Morphology: A Computational Geometric Approach to the Analysis Of Form, Godfried T . Toussaint (Ed.). Machine Intelligence and Pattern Recognition, Vol . 6. Elsevier Science , Amsterdam, Netherlands, 71--86. https:\/\/doi.org\/10.1016\/B978-0-444-70467-2.50011-4 10.1016\/B978-0-444-70467-2.50011-4 Hiroshi Imai and Masao Iri. 1988. Polygonal Approximations of a Curve-Formulations and Algorithms. In Computational Morphology: A Computational Geometric Approach to the Analysis Of Form, Godfried T. Toussaint (Ed.). Machine Intelligence and Pattern Recognition, Vol. 6. Elsevier Science, Amsterdam, Netherlands, 71--86. https:\/\/doi.org\/10.1016\/B978-0-444-70467-2.50011-4"},{"key":"e_1_3_2_1_12_1","volume-title":"Rousseeuw","author":"Kaufman Leonard","year":"1987","unstructured":"Leonard Kaufman and Peter J . Rousseeuw . 1987 . Clustering by Means of Medoids. In Statistical Data Analysis: Based on the L1-Norm and Related Methods. Elsevier Science , Amsterdam, Netherlands, 405--416. Leonard Kaufman and Peter J. Rousseeuw. 1987. Clustering by Means of Medoids. In Statistical Data Analysis: Based on the L1-Norm and Related Methods. Elsevier Science, Amsterdam, Netherlands, 405--416."},{"key":"e_1_3_2_1_13_1","volume-title":"Rousseeuw","author":"Kaufman Leonard","year":"1990","unstructured":"Leonard Kaufman and Peter J . Rousseeuw . 1990 . Finding Groups in Data : An Introduction to Cluster Analysis. John Wiley & Sons , Hoboken, NJ, USA. https:\/\/doi.org\/10.1002\/9780470316801 10.1002\/9780470316801 Leonard Kaufman and Peter J. Rousseeuw. 1990. Finding Groups in Data: An Introduction to Cluster Analysis. John Wiley & Sons, Hoboken, NJ, USA. https:\/\/doi.org\/10.1002\/9780470316801"},{"key":"e_1_3_2_1_14_1","volume-title":"Approximating the Integral Fr\u00e9chet Distance. Computational Geometry 70--71","author":"Maheshwari Anil","year":"2018","unstructured":"Anil Maheshwari , J\u00f6rg-R\u00fcdiger Sack , and Christian Scheffer . 2018. Approximating the Integral Fr\u00e9chet Distance. Computational Geometry 70--71 ( 2018 ), 13--30. https:\/\/doi.org\/10.1016\/j.comgeo.2018.01.001 10.1016\/j.comgeo.2018.01.001 Anil Maheshwari, J\u00f6rg-R\u00fcdiger Sack, and Christian Scheffer. 2018. Approximating the Integral Fr\u00e9chet Distance. Computational Geometry 70--71 (2018), 13--30. https:\/\/doi.org\/10.1016\/j.comgeo.2018.01.001"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1098\/rsif.2010.0301"},{"key":"e_1_3_2_1_16_1","volume-title":"Proceedings of the 7th IEEE International Conference on Computer Vision (ICCV '99","volume":"115","author":"Mario","year":"1999","unstructured":"Mario E. Munich and Pietro Perona. 1999. Continuous Dynamic Time Warping for Translation-Invariant Curve Alignment with Applications to Signature Verification . In Proceedings of the 7th IEEE International Conference on Computer Vision (ICCV '99 , Vol. 1). IEEE, Piscataway, NJ, USA, 108-- 115 . https:\/\/doi.org\/10.1109\/ICCV. 1999 .791205 10.1109\/ICCV.1999.791205 Mario E. Munich and Pietro Perona. 1999. Continuous Dynamic Time Warping for Translation-Invariant Curve Alignment with Applications to Signature Verification. In Proceedings of the 7th IEEE International Conference on Computer Vision (ICCV '99, Vol. 1). IEEE, Piscataway, NJ, USA, 108--115. https:\/\/doi.org\/10.1109\/ICCV.1999.791205"},{"key":"e_1_3_2_1_17_1","unstructured":"OpenStreetMap contributors. 2020. Map data. Retrieved 2020-09-16 from https:\/\/openstreetmap.org Data available under ODbL 1.0.  OpenStreetMap contributors. 2020. Map data. Retrieved 2020-09-16 from https:\/\/openstreetmap.org Data available under ODbL 1.0."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2010.09.013"},{"key":"e_1_3_2_1_19_1","volume-title":"Reddy and Bhanukiran Vinzamuri","author":"Chandan","year":"2014","unstructured":"Chandan K. Reddy and Bhanukiran Vinzamuri . 2014 . A Survey of Partitional and Hierarchical Clustering Algorithms. In Data Clustering: Algorithms and Applications, Charu C. Aggarwal and Chandan K. Reddy (Eds.). CRC Press , Boca Raton, FL, USA, Chapter 4, 87--110. https:\/\/doi.org\/10.1201\/9781315373515 10.1201\/9781315373515 Chandan K. Reddy and Bhanukiran Vinzamuri. 2014. A Survey of Partitional and Hierarchical Clustering Algorithms. In Data Clustering: Algorithms and Applications, Charu C. Aggarwal and Chandan K. Reddy (Eds.). CRC Press, Boca Raton, FL, USA, Chapter 4, 87--110. https:\/\/doi.org\/10.1201\/9781315373515"},{"key":"e_1_3_2_1_20_1","volume-title":"30th European Workshop on Computational Geometry (EuroCG 2014","author":"Rote G\u00fcnter","year":"2014","unstructured":"G\u00fcnter Rote . 2014 . Lexicographic Fr\u00e9chet Matchings . Presented at 30th European Workshop on Computational Geometry (EuroCG 2014 ). Retrieved 2020-06-23 from https:\/\/www.cs.bgu.ac.il\/~eurocg14\/papers\/paper_56.pdf G\u00fcnter Rote. 2014. Lexicographic Fr\u00e9chet Matchings. Presented at 30th European Workshop on Computational Geometry (EuroCG 2014). Retrieved 2020-06-23 from https:\/\/www.cs.bgu.ac.il\/~eurocg14\/papers\/paper_56.pdf"},{"key":"#cr-split#-e_1_3_2_1_21_1.1","doi-asserted-by":"crossref","unstructured":"Shay Rotics Michael Kaatz Sondra Turjeman Damaris Zurell Martin Wikelski Nir Sapir Ute Eggers Wolfgang Fiedler Florian Jeltsch and Ran Nathan. 2018. Data from: Early Arrival at Breeding Grounds: Causes Costs and a Trade-off with Overwintering Latitude. Movebank Data Repository. https:\/\/doi.org\/10.5441\/001\/1.v8d24552 10.5441\/001","DOI":"10.1111\/1365-2656.12898"},{"key":"#cr-split#-e_1_3_2_1_21_1.2","doi-asserted-by":"crossref","unstructured":"Shay Rotics Michael Kaatz Sondra Turjeman Damaris Zurell Martin Wikelski Nir Sapir Ute Eggers Wolfgang Fiedler Florian Jeltsch and Ran Nathan. 2018. Data from: Early Arrival at Breeding Grounds: Causes Costs and a Trade-off with Overwintering Latitude. Movebank Data Repository. https:\/\/doi.org\/10.5441\/001\/1.v8d24552","DOI":"10.1111\/1365-2656.12898"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1111\/1365-2656.12898"},{"key":"e_1_3_2_1_23_1","volume-title":"Rousseeuw","author":"Schubert Erich","year":"2019","unstructured":"Erich Schubert and Peter J . Rousseeuw . 2019 . Faster k-Medoids Clustering : Improving the PAM, CLARA, and CLARANS Algorithms. In Similarity Search and Applications (SISAP 2019). Springer , Heidelberg, Germany, 171--187. https:\/\/doi.org\/10.1007\/978-3-030-32047-8_16 10.1007\/978-3-030-32047-8_16 Erich Schubert and Peter J. Rousseeuw. 2019. Faster k-Medoids Clustering: Improving the PAM, CLARA, and CLARANS Algorithms. In Similarity Search and Applications (SISAP 2019). Springer, Heidelberg, Germany, 171--187. https:\/\/doi.org\/10.1007\/978-3-030-32047-8_16"},{"key":"e_1_3_2_1_24_1","unstructured":"Ben H. Williams. 2008. Character Trajectories Dataset. University of Edinburgh. Retrieved 2020--09--16 from https:\/\/archive.ics.uci.edu\/ml\/datasets\/Character+Trajectories  Ben H. Williams. 2008. Character Trajectories Dataset. University of Edinburgh. Retrieved 2020--09--16 from https:\/\/archive.ics.uci.edu\/ml\/datasets\/Character+Trajectories"}],"event":{"name":"SIGSPATIAL '20: 28th International Conference on Advances in Geographic Information Systems","location":"Seattle WA USA","acronym":"SIGSPATIAL '20","sponsor":["SIGSPATIAL ACM Special Interest Group on Spatial Information"]},"container-title":["Proceedings of the 28th International Conference on Advances in Geographic Information Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3397536.3422245","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3397536.3422245","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:02:44Z","timestamp":1750197764000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3397536.3422245"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,3]]},"references-count":24,"alternative-id":["10.1145\/3397536.3422245","10.1145\/3397536"],"URL":"https:\/\/doi.org\/10.1145\/3397536.3422245","relation":{},"subject":[],"published":{"date-parts":[[2020,11,3]]},"assertion":[{"value":"2020-11-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}