{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:33:50Z","timestamp":1742999630103,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031066672"},{"type":"electronic","value":"9783031066689"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-06668-9_13","type":"book-chapter","created":{"date-parts":[[2022,6,5]],"date-time":"2022-06-05T23:10:29Z","timestamp":1654470629000},"page":"168-184","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Research on\u00a0Detecting Similarity in Trajectory Data and\u00a0Possible Use Cases"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1810-6343","authenticated-orcid":false,"given":"Moritz Peter","family":"Weber","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2929-0318","authenticated-orcid":false,"given":"Ilenia","family":"Salvadori","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,6]]},"reference":[{"key":"13_CR1","unstructured":"Statistisches Bundesamt. How to choose the optimal number of clusters for K-Means Clustering? (2022). https:\/\/www.destatis.de\/EN\/Themes\/Society-Environment\/Traffic-Accidents\/_Graphic\/_Interactive\/traffic-accidents-driver-related-causes.html. Accessed 25 Mar 2022"},{"key":"13_CR2","unstructured":"Burkov, A.: Machine Learning Kompakt - ALLES WAS SIE WISSEN M\u00dcSSEN. mitp Verlag (2019). ISBN 978-3958459953"},{"key":"13_CR3","unstructured":"Diallo, A.: [Draft] dynamic time warping algorithm for trajectories similarity (2020). https:\/\/alphasldiallo.github.io\/dynamic-time-warping-algorithm-for-trajectoriessimilarity\/. Accessed 10 Jan 2022"},{"key":"13_CR4","unstructured":"G\u00e9ron, A.: Hands-On Machine Learning with Scikit-Learn, Keras, and TensorFlow - Concepts, Tools, and Techniques to Build Intelligent Systems. O\u2019Reilly Media, Inc., Sebastopol (2019). ISBN 978-1-492-03261-8"},{"key":"13_CR5","unstructured":"Glen, S.: Jaccard index\/similarity coefficient from StatisticsHowTo.com: elementary statistics for the rest of us! (2016). https:\/\/www.statisticshowto.com\/jaccard-index\/. Accessed 05 Jan 2022"},{"key":"13_CR6","unstructured":"Gove, R.: Using the elbow method to determine the optimal number of clusters for k-means clustering (2017). https:\/\/bl.ocks.org\/rpgove\/0060ff3b656618e9136b. Accessed 15 Jan 2022"},{"key":"13_CR7","unstructured":"OpenGenus IQ. Minkowski distance (2021). https:\/\/iq.opengenus.org\/minkowski-distance\/. Accessed 05 Jan 2022"},{"key":"13_CR8","unstructured":"Janoska, Z.: Trajectory similarity calculation using dynamic time warping. n.d. https:\/\/rpubs.com\/janoskaz\/10351. Accessed 13 Jan 2022"},{"key":"13_CR9","doi-asserted-by":"publisher","unstructured":"Kauffmann, J., et al.: From clustering to cluster explanations via neural networks (2019). https:\/\/doi.org\/10.48550\/ARXIV.1906.07633, https:\/\/arxiv.org\/abs\/1906.07633","DOI":"10.48550\/ARXIV.1906.07633"},{"key":"13_CR10","unstructured":"Luber, S.: Was ist geospatial analytics? (2020). https:\/\/www.bigdata-insider.de\/was-ist-geospatialanalytics-a-945606\/. Accessed 06 Jan 2022"},{"key":"13_CR11","unstructured":"L\u00fcthe, M.: Calculate similarity\u2014the most relevant metrics in a nutshell (2019). https:\/\/towardsdatascience.com\/calculate-similarity-the-most-relevant-metrics-in-a- nutshell-9a43564f533e. Accessed 04 Jan 2022"},{"key":"13_CR12","doi-asserted-by":"publisher","unstructured":"Magdy, N., et al.: Review on trajectory similarity measures. In: 2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS), pp. 613\u2013619 (2015). https:\/\/doi.org\/10.1109\/IntelCIS.2015.7397286","DOI":"10.1109\/IntelCIS.2015.7397286"},{"key":"13_CR13","unstructured":"Mahavar, V., et al.: Optimum route planning of a city using GIS technology. https:\/\/www.researchgate.net\/publication\/332446199_OPTIMUM_ROUTE_ PLANNING_OF_A_CITY_USING_GIS_TECHNOLOGY. Accessed 13 Jan 2022"},{"key":"13_CR14","unstructured":"Open Street Map. Route planning for the journey from Ernst-Abbe Hochschule Jena, Germany to Weimar, Germany (2022). https:\/\/routing.openstreetmap.de. Accessed 25 Mar 2022"},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-540-74048-3_4","volume-title":"Information Retrieval for Music and Motion","author":"M M\u00fcller","year":"2007","unstructured":"M\u00fcller, M.: Dynamic time warping. In: M\u00fcller, M. (ed.) Information Retrieval for Music and Motion, vol. 2, pp. 69\u201384. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74048-3_4"},{"key":"13_CR16","doi-asserted-by":"publisher","unstructured":"Murayama, Y.: Progress in Geospatial Analysis. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-4-431-54000-7. ISBN 978-4-431-54000-7","DOI":"10.1007\/978-4-431-54000-7"},{"key":"13_CR17","unstructured":"Sarkar, T.: Clustering metrics better than the elbow-method (2019). https:\/\/towardsdatascience.com\/clustering-metrics-better-than-the-elbow-method-6926e1f723a6. Accessed 02 Feb 2022"},{"key":"13_CR18","unstructured":"Shetty, R.: How to choose the optimal number of clusters for K-means clustering? (2019). https:\/\/www.kaggle.com\/getting-started\/101093. Accessed 23 Jan 2022"},{"key":"13_CR19","unstructured":"Weber, M.P.: Research on detecting similarities in trajectory data: technical approaches and practical use-cases. Bachelor thesis, University of Applied Sciences Jena (2021)"}],"container-title":["Communications in Computer and Information Science","Innovations for Community Services"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-06668-9_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,5]],"date-time":"2022-06-05T23:13:24Z","timestamp":1654470804000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06668-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031066672","9783031066689"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06668-9_13","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"6 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"I4CS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Innovations for Community Services","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Delft","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"i4cs2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.i4cs-conference.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.53","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5.43","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}