{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T16:34:29Z","timestamp":1773246869951,"version":"3.50.1"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031498954","type":"print"},{"value":"9783031498961","type":"electronic"}],"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-49896-1_4","type":"book-chapter","created":{"date-parts":[[2023,12,19]],"date-time":"2023-12-19T14:02:29Z","timestamp":1702994549000},"page":"39-55","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Clustering Time Series with\u00a0k-Medoids Based Algorithms"],"prefix":"10.1007","author":[{"given":"Christopher","family":"Holder","sequence":"first","affiliation":[]},{"given":"David","family":"Guijo-Rubio","sequence":"additional","affiliation":[]},{"given":"Anthony","family":"Bagnall","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,20]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"793","DOI":"10.3233\/IDA-140669","volume":"18","author":"S Aghabozorgi","year":"2014","unstructured":"Aghabozorgi, S., Wah, T.Y.: Clustering of large time series datasets. Intell. Data Anal. 18, 793\u2013817 (2014)","journal-title":"Intell. Data Anal."},{"key":"4_CR2","first-page":"1","volume":"17","author":"A Benavoli","year":"2016","unstructured":"Benavoli, A., Corani, G., Mangili, F.: Should we really use post-hoc tests based on mean-ranks? J. Mach. Learn. Res. 17, 1\u201310 (2016)","journal-title":"J. Mach. Learn. Res."},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"46589","DOI":"10.1109\/ACCESS.2021.3067833","volume":"9","author":"B Cai","year":"2021","unstructured":"Cai, B., Huang, G., Samadiani, N., Li, G., Chi, C.-H.: Efficient time series clustering by minimizing dynamic time warping utilization. IEEE Access 9, 46589\u201346599 (2021)","journal-title":"IEEE Access"},{"key":"4_CR4","unstructured":"Caiado, J., Maharaj, E., D\u2019Urso, P.: Time series clustering. In: Handbook of Cluster Analysis, pp. 241\u2013264 (2015)"},{"issue":"6","key":"4_CR5","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.1109\/JAS.2019.1911747","volume":"6","author":"H Dau","year":"2019","unstructured":"Dau, H., et al.: The UCR time series archive. IEEE\/CAA J. Automatica Sinica 6(6), 1293\u20131305 (2019)","journal-title":"IEEE\/CAA J. Automatica Sinica"},{"key":"4_CR6","first-page":"1","volume":"7","author":"J Dem\u0161ar","year":"2006","unstructured":"Dem\u0161ar, J.: Statistical comparisons of classifiers over multiple data sets. J. Mach. Learn. Res. 7, 1\u201330 (2006)","journal-title":"J. Mach. Learn. Res."},{"issue":"8","key":"4_CR7","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1080\/0094965031000136012","volume":"73","author":"MV der Laan","year":"2003","unstructured":"der Laan, M.V., Pollard, K., Bryan, J.: A new partitioning around medoids algorithm. J. Stat. Comput. Simul. 73(8), 575\u2013584 (2003)","journal-title":"J. Stat. Comput. Simul."},{"issue":"1","key":"4_CR8","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1145\/568574.568575","volume":"4","author":"V Estivill-Castro","year":"2002","unstructured":"Estivill-Castro, V.: Why so many clustering algorithms: a position paper. SIGKDD Explor. Newsl. 4(1), 65\u201375 (2002)","journal-title":"SIGKDD Explor. Newsl."},{"key":"4_CR9","first-page":"2677","volume":"9","author":"S Garc\u00eda","year":"2008","unstructured":"Garc\u00eda, S., Herrera, F.: An extension on \u201cstatistical comparisons of classifiers over multiple data sets\u2019\u2019 for all pairwise comparisons. J. Mach. Learn. Res. 9, 2677\u20132694 (2008)","journal-title":"J. Mach. Learn. Res."},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Germain, T., Truong, C., Oudre, L., Krejci, E.: Unsupervised study of plethysmography signals through dtw clustering. In: 2022 44th Annual International Conference of the IEEE Engineering in Medicine & Biology Society (EMBC), pp. 3396\u20133400. IEEE (2022)","DOI":"10.1109\/EMBC48229.2022.9870907"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Holder, C., Guijo-Rubio, D., Bagnall, A.: Barycentre averaging for the move-split-merge time series distance measure. In: 15th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management (2023)","DOI":"10.5220\/0012164900003598"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Holder, C., Middlehurst, M., Bagnall, A.: A review and evaluation of elastic distance functions for time series clustering. Knowl. Inform. Syst. (2023)","DOI":"10.1007\/s10115-023-01952-0"},{"key":"4_CR13","unstructured":"Ismail-Fawaz, A., et al.: An approach to multiple comparison benchmark evaluations that is stable under manipulation of the comparate set. arXiv preprint arXiv:2305.11921 (2023)"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Javed, A., Lee, B. S., Rizzo, D.: A benchmark study on time series clustering. Mach. Learn. Appli. 1 (2020)","DOI":"10.1016\/j.mlwa.2020.100001"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Kariv, O., Hakimi, S.L.: An algorithmic approach to network location problems. ii: the p-medians. SIAM J. Appli. Mathem. 37(3), 539\u2013560 (1979)","DOI":"10.1137\/0137041"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Kaufman, L., Rousseeuw, P. J.: Clustering large data sets. In: Pattern Recognition in Practice, pp. 425\u2013437. Elsevier, Amsterdam (1986)","DOI":"10.1016\/B978-0-444-87877-9.50039-X"},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10618-021-00796-y","volume":"36","author":"B Lafabregue","year":"2022","unstructured":"Lafabregue, B., Weber, J., Gancarski, P., Forestier, G.: End-to-end deep representation learning for time series clustering: a comparative study. Data Min. Knowl. Disc. 36, 29\u201381 (2022)","journal-title":"Data Min. Knowl. Disc."},{"key":"4_CR18","doi-asserted-by":"publisher","unstructured":"Lenssen, L., Schubert, E.: Clustering by direct optimization of the medoid silhouette. In: Similarity Search and Applications: 15th International Conference, SISAP 2022, Bologna, Italy, Proceedings, pp. 190\u2013204. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-17849-8_15","DOI":"10.1007\/978-3-031-17849-8_15"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Leonard Kaufman, P.J.R.: Partitioning Around Medoids (Program PAM), chapter 2, pp. 68\u2013125. John Wiley and Sons Ltd. (1990)","DOI":"10.1002\/9780470316801.ch2"},{"key":"4_CR20","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.ins.2020.04.009","volume":"534","author":"H Li","year":"2020","unstructured":"Li, H., Liu, J., Yang, Z., Liu, R.W., Wu, K., Wan, Y.: Adaptively constrained dynamic time warping for time series classification and clustering. Inf. Sci. 534, 97\u2013116 (2020)","journal-title":"Inf. Sci."},{"issue":"3","key":"4_CR21","doi-asserted-by":"publisher","first-page":"2369","DOI":"10.1007\/s10618-021-00798-w","volume":"35","author":"X Li","year":"2021","unstructured":"Li, X., Lin, J., Zhao, L.: Time series clustering in linear time complexity. Data Min. Knowl. Disc. 35(3), 2369\u20132388 (2021)","journal-title":"Data Min. Knowl. Disc."},{"key":"4_CR22","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s10618-014-0361-2","volume":"29","author":"J Lines","year":"2015","unstructured":"Lines, J., Bagnall, A.: Time series classification with ensembles of elastic distance measures. Data Min. Knowl. Disc. 29, 565\u2013592 (2015)","journal-title":"Data Min. Knowl. Disc."},{"key":"4_CR23","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"SP Lloyd","year":"1982","unstructured":"Lloyd, S.P.: Least squares quantization in pcm. IEEE Trans. Inf. Theory 28, 129\u2013136 (1982)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"4_CR24","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1109\/TPAMI.2008.76","volume":"31","author":"P Marteau","year":"2009","unstructured":"Marteau, P.: Time warp edit distance with stiffness adjustment for time series matching. IEEE Trans. Pattern Anal. Mach. Intell. 31(2), 306\u2013318 (2009)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"4_CR25","doi-asserted-by":"publisher","first-page":"1003","DOI":"10.1109\/TKDE.2002.1033770","volume":"14","author":"R Ng","year":"2002","unstructured":"Ng, R., Han, J.: CLARANS: a method for clustering objects for spatial data mining. IEEE Trans. Knowl. Data Eng. 14, 1003\u20131016 (2002)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"4_CR26","doi-asserted-by":"crossref","unstructured":"Paparrizos, J., Gravano, L.: k-shape: efficient and accurate clustering of time series. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, pp. 1855\u20131870 (2015)","DOI":"10.1145\/2723372.2737793"},{"key":"4_CR27","doi-asserted-by":"publisher","first-page":"678","DOI":"10.1016\/j.patcog.2010.09.013","volume":"44","author":"F Petitjean","year":"2011","unstructured":"Petitjean, F., Ketterlin, A., Gancarski, P.: A global averaging method for dynamic time warping, with applications to clustering. Pattern Recogn. 44, 678 (2011)","journal-title":"Pattern Recogn."},{"key":"4_CR28","doi-asserted-by":"crossref","unstructured":"Ratanamahatana, C., Keogh, E.: Three myths about dynamic time warping data mining. In: Proceedings of the 5th SIAM International Conference on Data Mining (2005)","DOI":"10.1137\/1.9781611972757.50"},{"key":"4_CR29","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0377-0427(87)90125-7","volume":"20","author":"PJ Rousseeuw","year":"1987","unstructured":"Rousseeuw, P.J.: Silhouettes: a graphical aid to the interpretation and validation of cluster analysis. J. Comput. Appl. Math. 20, 53\u201365 (1987)","journal-title":"J. Comput. Appl. Math."},{"issue":"75","key":"4_CR30","doi-asserted-by":"publisher","first-page":"4183","DOI":"10.21105\/joss.04183","volume":"7","author":"E Schubert","year":"2022","unstructured":"Schubert, E., Lenssen, L.: Fast k-medoids clustering in rust and python. J. Open Source Softw. 7(75), 4183 (2022)","journal-title":"J. Open Source Softw."},{"key":"4_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-030-32047-8_16","volume-title":"Similarity Search and Applications","author":"E Schubert","year":"2019","unstructured":"Schubert, E., Rousseeuw, P.J.: Faster k-medoids clustering: improving the PAM, CLARA, and CLARANS algorithms. In: Amato, G., Gennaro, C., Oria, V., Radovanovi\u0107, M. (eds.) SISAP 2019. LNCS, vol. 11807, pp. 171\u2013187. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-32047-8_16"},{"key":"4_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2021.101804","volume":"101","author":"E Schubert","year":"2021","unstructured":"Schubert, E., Rousseeuw, P.J.: Fast and eager k-medoids clustering: O(k) runtime improvement of the pam, clara, and clarans algorithms. Inf. Syst. 101, 101804 (2021)","journal-title":"Inf. Syst."},{"key":"4_CR33","doi-asserted-by":"crossref","unstructured":"Shifaz, A., Pelletier, C., Petitjean, F., Webb, G.: Elastic similarity and distance measures for multivariate time series. Knowl. Inform. Syst. 65(6) (2023)","DOI":"10.1007\/s10115-023-01835-4"},{"issue":"6","key":"4_CR34","doi-asserted-by":"publisher","first-page":"1425","DOI":"10.1109\/TKDE.2012.88","volume":"25","author":"A Stefan","year":"2013","unstructured":"Stefan, A., Athitsos, V., Das, G.: The Move-Split-Merge metric for time series. IEEE Trans. Knowl. Data Eng. 25(6), 1425\u20131438 (2013)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"118","key":"4_CR35","first-page":"1","volume":"21","author":"R Tavenard","year":"2020","unstructured":"Tavenard, R., et al.: Tslearn, a machine learning toolkit for time series data. J. Mach. Learn. Res. 21(118), 1\u20136 (2020)","journal-title":"J. Mach. Learn. Res."}],"container-title":["Lecture Notes in Computer Science","Advanced Analytics and Learning on Temporal Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49896-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,19]],"date-time":"2023-12-19T14:03:06Z","timestamp":1702994586000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49896-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031498954","9783031498961"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49896-1_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"20 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AALTD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Advanced Analytics and Learning on Temporal Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Turin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"18 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aaltd2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ecml-aaltd.github.io\/aaltd2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"28","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":"20","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":"0","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":"71% - 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":"2-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":"2-3","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}