{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:47:47Z","timestamp":1757314067430,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031452741"},{"type":"electronic","value":"9783031452758"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-45275-8_31","type":"book-chapter","created":{"date-parts":[[2023,10,7]],"date-time":"2023-10-07T06:01:56Z","timestamp":1696658516000},"page":"460-473","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Which Way to\u00a0Go - Finding Frequent Trajectories Through Clustering"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3210-2066","authenticated-orcid":false,"given":"Thiago","family":"Andrade","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3357-1195","authenticated-orcid":false,"given":"Jo\u00e3o","family":"Gama","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,10,8]]},"reference":[{"issue":"3","key":"31_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2743025","volume":"6","author":"Y Zheng","year":"2015","unstructured":"Zheng, Y.: Trajectory data mining: an overview. ACM Trans. Intell. Syst. Technol. (TIST) 6(3), 1\u201341 (2015)","journal-title":"ACM Trans. Intell. Syst. Technol. (TIST)"},{"key":"31_CR2","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s10462-016-9477-7","volume":"47","author":"G Yuan","year":"2017","unstructured":"Yuan, G., et al.: A review of moving object trajectory clustering algorithms. Artif. Intell. Rev. 47, 123\u2013144 (2017)","journal-title":"Artif. Intell. Rev."},{"key":"31_CR3","unstructured":"Ester, M., et al.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: Kdd, vol. 96, no. 34, pp. 226\u2013231 (1996)"},{"issue":"6","key":"31_CR4","doi-asserted-by":"publisher","DOI":"10.1111\/exsy.12627","volume":"37","author":"T Andrade","year":"2020","unstructured":"Andrade, T., Cancela, B., Gama, J.: From mobility data to habits and common pathways. Expert. Syst. 37(6), e12627 (2020)","journal-title":"Expert. Syst."},{"key":"31_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/978-3-030-30244-3_34","volume-title":"Progress in Artificial Intelligence","author":"T Andrade","year":"2019","unstructured":"Andrade, T., Cancela, B., Gama, J.: Discovering common pathways across users\u2019 habits in mobility data. In: Moura Oliveira, P., Novais, P., Reis, L.P. (eds.) EPIA 2019. LNCS (LNAI), vol. 11805, pp. 410\u2013421. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30244-3_34"},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"Gudmundsson, J., Valladares, N.: A GPU approach to subtrajectory clustering using the Fr\u00e9chet distance. In: Proceedings of the 20th International Conference on Advances in Geographic Information Systems, pp. 259\u2013268 (2012)","DOI":"10.1145\/2424321.2424355"},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"Sanchez, I., et al.: Fast trajectory clustering using hashing methods. In: 2016 International Joint Conference on Neural Networks (IJCNN), pp. 3689\u20133696. IEEE (2016)","DOI":"10.1109\/IJCNN.2016.7727674"},{"key":"31_CR8","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s00778-011-0262-6","volume":"24","author":"C-C Hung","year":"2015","unstructured":"Hung, C.-C., Peng, W.-C., Lee, W.-C.: Clustering and aggregating clues of trajectories for mining trajectory patterns and routes. VLDB J. 24, 169\u2013192 (2015)","journal-title":"VLDB J."},{"key":"31_CR9","doi-asserted-by":"crossref","unstructured":"Brankovic, M., et al.: (k, l)-medians clustering of trajectories using continuous dynamic time warping. In: Proceedings of the 28th International Conference on Advances in Geographic Information Systems, pp. 99\u2013110 (2020)","DOI":"10.1145\/3397536.3422245"},{"key":"31_CR10","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/s12243-020-00807-x","volume":"75","author":"T Andrade","year":"2020","unstructured":"Andrade, T., Cancela, B., Gama, J.: Discovering locations and habits from human mobility data. Ann. Telecommun. 75, 505\u2013521 (2020)","journal-title":"Ann. Telecommun."},{"issue":"3","key":"31_CR11","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/S0146-664X(72)80017-0","volume":"1","author":"U Ramer","year":"1972","unstructured":"Ramer, U.: An iterative procedure for the polygonal approximation of plane curves. Comput. Graph. Image Process. 1(3), 244\u2013256 (1972)","journal-title":"Comput. Graph. Image Process."},{"key":"31_CR12","doi-asserted-by":"crossref","unstructured":"Douglas, D.H., Peucker, T.K.: Algorithms for the reduction of the number of points required to represent a digitized line or its caricature. Cartographica: Int. J. Geogr. Inf. Geovisualization 10(2) 112\u2013122 (1973)","DOI":"10.3138\/FM57-6770-U75U-7727"},{"key":"31_CR13","series-title":"EAI\/Springer Innovations in Communication and Computing","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-030-30911-4_21","volume-title":"Mobility Internet of Things 2018","author":"T Andrade","year":"2020","unstructured":"Andrade, T., Gama, J.: Identifying points of interest and similar individuals from raw GPS data. In: Cag\u00e1\u0148ov\u00e1, D., Hor\u0148\u00e1kov\u00e1, N. (eds.) Mobility IoT 2018. EICC, pp. 293\u2013305. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-30911-4_21"},{"key":"31_CR14","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/978-3-030-43887-6_32","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"T Andrade","year":"2020","unstructured":"Andrade, T., Cancela, B., Gama, J.: Mining human mobility data to discover locations and habits. In: Cellier, P., Driessens, K. (eds.) ECML PKDD 2019. CCIS, vol. 1168, pp. 390\u2013401. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-43887-6_32"},{"key":"31_CR15","unstructured":"Vlachos, M., Kollios, G., Gunopulos, D.: Discovering similar multidimensional trajectories. In: Proceedings of the 18th International Conference on Data Engineering, ICDE 2002, p. 673. IEEE Computer Society, Washington, DC, USA (2002). http:\/\/dl.acm.org\/citation.cfm?id=876875.878994. Accessed 16 June 2019"},{"key":"31_CR16","unstructured":"Eiter, T., Mannila, H.: Computing discrete Fr\u00e9chet distance (1994)"},{"key":"31_CR17","doi-asserted-by":"crossref","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-619. IEEE (2015)","DOI":"10.1109\/IntelCIS.2015.7397286"},{"issue":"3","key":"31_CR18","doi-asserted-by":"publisher","first-page":"1393","DOI":"10.1109\/TITS.2013.2262376","volume":"14","author":"L Moreira-Matias","year":"2013","unstructured":"Moreira-Matias, L., et al.: Predicting taxi-passenger demand using streaming data. IEEE Trans. Intell. Transp. Syst. 14(3), 1393\u20131402 (2013)","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"31_CR19","doi-asserted-by":"crossref","unstructured":"Yuan, J., et al.: Driving with knowledge from the physical world. In: Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 316\u2013324 (2011)","DOI":"10.1145\/2020408.2020462"},{"key":"31_CR20","doi-asserted-by":"crossref","unstructured":"Andrade, T., et al.: Anomaly detection in sequential data: principles and case studies. Wiley Encycl. Electr. Electron. Eng., 1\u201314 (2019)","DOI":"10.1002\/047134608X.W8382"},{"key":"31_CR21","first-page":"428","volume-title":"Extra\u00e7\u00e3o de conhecimento de dados: data mining","author":"J Gama","year":"2017","unstructured":"Gama, J., et al.: Extra\u00e7\u00e3o de conhecimento de dados: data mining, 3rd edn., p. 428. Edi\u00e7\u00f5es S\u0131labo, Lisboa (2017)","edition":"3"},{"key":"31_CR22","doi-asserted-by":"crossref","unstructured":"Andrade, T., Gama, J.: Estimating instantaneous vehicle emissions. In: Proceedings of the 38th ACM\/SIGAPP Symposium on Applied Computing, SAC 2023, Tallinn, Estonia, pp. 422\u2013424 (2023)","DOI":"10.1145\/3555776.3577866"}],"container-title":["Lecture Notes in Computer Science","Discovery Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-45275-8_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T15:06:52Z","timestamp":1710256012000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-45275-8_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031452741","9783031452758"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-45275-8_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"8 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Discovery Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Porto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dis2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ds2023.inesctec.pt\/","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":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"133","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":"37","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":"10","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":"28% - 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","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":"4","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)"}}]}}