{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T14:51:28Z","timestamp":1784904688095,"version":"3.55.0"},"reference-count":74,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,9,7]],"date-time":"2023-09-07T00:00:00Z","timestamp":1694044800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,9,7]],"date-time":"2023-09-07T00:00:00Z","timestamp":1694044800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000266","name":"UK Engineering and Physical Sciences Research Council","doi-asserted-by":"crossref","award":["EP\/W030756\/1"],"award-info":[{"award-number":["EP\/W030756\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2024,2]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Time series clustering is the act of grouping time series data without recourse to a label. Algorithms that cluster time series can be classified into two groups: those that employ a time series specific distance measure and those that derive features from time series. Both approaches usually rely on traditional clustering algorithms such as <jats:italic>k<\/jats:italic>-means. Our focus is on partitional clustering algorithms that employ elastic distance measures, i.e. distances that perform some kind of realignment whilst measuring distance. We describe nine commonly used elastic distance measures and compare their performance with <jats:italic>k<\/jats:italic>-means and <jats:italic>k<\/jats:italic>-medoids clusterer. Our findings, based on experiments using the UCR time series archive, are surprising. We find that, generally, clustering with DTW distance is not better than using Euclidean distance and that distance measures that employ editing in conjunction with warping are significantly better than other approaches. We further observe that using <jats:italic>k<\/jats:italic>-medoids clusterer rather than <jats:italic>k<\/jats:italic>-means improves the clusterings for all nine elastic distance measures. One function, the move\u2013split\u2013merge (MSM) distance, is the best performing algorithm of this study, with time warp edit (TWE) distance a close second. Our conclusion is that MSM or TWE with <jats:italic>k<\/jats:italic>-medoids clusterer should be considered as a good alternative to DTW for clustering time series with elastic distance measures. We provide implementations, extensive results and guidance on reproducing results on the associated GitHub repository.<\/jats:p>","DOI":"10.1007\/s10115-023-01952-0","type":"journal-article","created":{"date-parts":[[2023,9,7]],"date-time":"2023-09-07T16:02:35Z","timestamp":1694102555000},"page":"765-809","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":80,"title":["A review and evaluation of elastic distance functions for time series clustering"],"prefix":"10.1007","volume":"66","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9571-3764","authenticated-orcid":false,"given":"Christopher","family":"Holder","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3293-8779","authenticated-orcid":false,"given":"Matthew","family":"Middlehurst","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2360-8994","authenticated-orcid":false,"given":"Anthony","family":"Bagnall","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,9,7]]},"reference":[{"issue":"2","key":"1952_CR1","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/s10618-018-0596-4","volume":"33","author":"A Abanda","year":"2019","unstructured":"Abanda A, Mori U, Lozano J (2019) A review on distance based time series classification. Data Min Knowl Disc 33(2):378\u2013412","journal-title":"Data Min Knowl Disc"},{"key":"1952_CR2","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.is.2015.04.007","volume":"53","author":"S Aghabozorgi","year":"2015","unstructured":"Aghabozorgi S, Seyed Shirkhorshidi A, Ying Wah T (2015) Time-series clustering\u2014a decade review. Inf Syst 53:16\u201338","journal-title":"Inf Syst"},{"key":"1952_CR3","doi-asserted-by":"publisher","first-page":"181314","DOI":"10.1109\/ACCESS.2019.2958551","volume":"7","author":"M Ali","year":"2019","unstructured":"Ali M, Alqahtani A, Jones MW, Xie X (2019) Clustering and classification for time series data in visual analytics: a survey. IEEE Access 7:181314\u2013181338","journal-title":"IEEE Access"},{"key":"1952_CR4","doi-asserted-by":"crossref","unstructured":"Alqahtani A, Ali M, Xie X, Jones MW (2021) Deep time-series clustering: a review. Electronics","DOI":"10.3390\/electronics10233001"},{"key":"1952_CR5","unstructured":"Anderberg M (1973) Cluster analysis for applications. Probability and mathematical statistics a series of monographs and textbooks. Academic Press"},{"issue":"2","key":"1952_CR6","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1145\/304181.304187","volume":"28","author":"M Ankerst","year":"1999","unstructured":"Ankerst M, Breunig MM, Kriegel H-P, Sander J (1999) Optics: ordering points to identify the clustering structure. SIGMOD Rec 28(2):49\u201360","journal-title":"SIGMOD Rec"},{"key":"1952_CR7","unstructured":"Arthur D, Vassilvitskii S (2007) K-means++: the advantages of careful seeding. In: Proceedings of the eighteenth annual ACM-SIAM symposium on discrete algorithms, SODA \u201907, pp. 1027\u20131035. Society for Industrial and Applied Mathematics"},{"issue":"3","key":"1952_CR8","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1007\/s10618-016-0483-9","volume":"31","author":"A Bagnall","year":"2017","unstructured":"Bagnall A, Lines J, Bostrom A, Large J, Keogh E (2017) The great time series classification bake off: a review and experimental evaluation of recent algorithmic advances. Data Min Knowl Disc 31(3):606\u2013660","journal-title":"Data Min Knowl Disc"},{"key":"1952_CR9","doi-asserted-by":"crossref","unstructured":"Begum N, Ulanova L, Wang J, Keogh E (2015) Accelerating dynamic time warping clustering with a novel admissible pruning strategy. In: Proceedings of the 21th ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201915, pp 49\u201358. Association for Computing Machinery, New York","DOI":"10.1145\/2783258.2783286"},{"key":"1952_CR10","doi-asserted-by":"crossref","unstructured":"Begum N, Ulanova L, Wang J, Keogh E (2015) Accelerating dynamic time warping clustering with a novel admissible pruning strategy. KDD \u201915, pp 49\u201358. Association for Computing Machinery, New York","DOI":"10.1145\/2783258.2783286"},{"key":"1952_CR11","first-page":"1","volume":"17","author":"A Benavoli","year":"2016","unstructured":"Benavoli A, Corani G, Mangili F (2016) Should we really use post-hoc tests based on mean-ranks? J Mach Learn Res 17:1\u201310","journal-title":"J Mach Learn Res"},{"issue":"1","key":"1952_CR12","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1147\/rd.81.0022","volume":"8","author":"RE Bonner","year":"1964","unstructured":"Bonner RE (1964) On some clustering techniques. IBM J Res Dev 8(1):22\u201332","journal-title":"IBM J Res Dev"},{"key":"1952_CR13","unstructured":"Bradley PS, Fayyad UM (1998) Refining initial points for k-means clustering. In: Proceedings of the fifth international conference on machine learning, pp 91\u201399"},{"key":"1952_CR14","unstructured":"Bradley PS, Fayyad UM (1998) Refining initial points for k-means clustering. In: Proceedings of the fifteenth international conference on machine learning, ICML \u201998, pp 91-99. Morgan Kaufmann Publishers Inc, San Francisco"},{"key":"1952_CR15","unstructured":"Caiado J, Maharaj E, D\u2019Urso P (2015) Time series clustering. In: Handbook of cluster analysis, pp 241\u2013264"},{"key":"1952_CR16","doi-asserted-by":"crossref","unstructured":"Chen L, Ng R (2004) On the marriage of Lp-norms and edit distance. In: Proceedings of the 30th international conference on very large data bases","DOI":"10.1016\/B978-012088469-8.50070-X"},{"key":"1952_CR17","doi-asserted-by":"crossref","unstructured":"Chen L, Ozsu MT, Oria V (2005) Robust and fast similarity search for moving object trajectories. In: Proceedings of the ACM SIGMOD international conference on management of data","DOI":"10.1145\/1066157.1066213"},{"issue":"6","key":"1952_CR18","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.1109\/JAS.2019.1911747","volume":"6","author":"H Dau","year":"2019","unstructured":"Dau H, Bagnall A, Kamgar K, Yeh M, Zhu Y, Gharghabi S, Ratanamahatana C, Chotirat A, Keogh E (2019) The UCR time series archive. IEEE\/CAA J Automatica Sinica 6(6):1293\u20131305","journal-title":"IEEE\/CAA J Automatica Sinica"},{"issue":"4","key":"1952_CR19","doi-asserted-by":"publisher","first-page":"1074","DOI":"10.1007\/s10618-018-0565-y","volume":"32","author":"H Dau","year":"2018","unstructured":"Dau H, Silva D, Petitjean F, Forestier G, Bagnall A, Keogh E (2018) Optimizing dynamic time warping\u2019s window width for time series data mining applications. Data Min Knowl Disc 32(4):1074\u20131120","journal-title":"Data Min Knowl Disc"},{"key":"1952_CR20","first-page":"1","volume":"7","author":"J Dem\u0161ar","year":"2006","unstructured":"Dem\u0161ar J (2006) Statistical comparisons of classifiers over multiple data sets. J Mach Learn Res 7:1\u201330","journal-title":"J Mach Learn Res"},{"key":"1952_CR21","doi-asserted-by":"crossref","unstructured":"Dhillon IS, Guan Y, Kulis B (2004) Kernel k-means: spectral clustering and normalized cuts. In: Proceedings of the tenth ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201904, pp 551\u2013556. Association for Computing Machinery, New York","DOI":"10.1145\/1014052.1014118"},{"key":"1952_CR22","doi-asserted-by":"crossref","unstructured":"Ding C, He X (2004) K-means clustering via principal component analysis. In: Proceedings of the twenty-first international conference on machine learning, ICML \u201904, pp\u00a029. Association for Computing Machinery, New York","DOI":"10.1145\/1015330.1015408"},{"key":"1952_CR23","unstructured":"Ester M, Kriegel H-P, Sander J, Xu X (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proceedings of the second international conference on knowledge discovery and data mining, KDD\u201996, pp 226-231. AAAI Press"},{"key":"1952_CR24","first-page":"768","volume":"21","author":"E Forgy","year":"1965","unstructured":"Forgy E (1965) Cluster analysis of multivariate data: efficiency versus interpretability of classifications. Biometrics 21:768\u2013769","journal-title":"Biometrics"},{"key":"1952_CR25","first-page":"2677","volume":"9","author":"S Garc\u00eda","year":"2008","unstructured":"Garc\u00eda S, Herrera F (2008) An extension on \u201cstatistical comparisons of classifiers over multiple data sets\u2019\u2019 for all pairwise comparisons. J Mach Learn Res 9:2677\u20132694","journal-title":"J Mach Learn Res"},{"issue":"2","key":"1952_CR26","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s10618-015-0415-0","volume":"30","author":"B Hu","year":"2016","unstructured":"Hu B, Chen Y, Keogh E (2016) Classification of streaming time series under more realistic assumptions. Data Min Knowl Disc 30(2):403\u2013437","journal-title":"Data Min Knowl Disc"},{"key":"1952_CR27","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.ins.2022.11.139","volume":"622","author":"AM Ikotun","year":"2023","unstructured":"Ikotun AM, Ezugwu AE, Abualigah L, Abuhaija B, Heming J (2023) K-means clustering algorithms: a comprehensive review, variants analysis, and advances in the era of big data. Inf Sci 622:178\u2013210","journal-title":"Inf Sci"},{"key":"1952_CR28","unstructured":"Ismail-Fawaz A, Dempster A, Tan CW, Herrmann M, Miller L, Schmidt D, Berretti S, Weber J, Devanne M, Forestier G, Webb G (2023) An approach to multiple comparison benchmark evaluations that is stable under manipulation of the comparate set. arXiv preprint arXiv:2305.11921"},{"key":"1952_CR29","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1016\/j.patcog.2018.02.015","volume":"79","author":"H Ismkhan","year":"2018","unstructured":"Ismkhan H (2018) I-k-means-+: an iterative clustering algorithm based on an enhanced version of the k-means. Pattern Recogn 79:402\u2013413","journal-title":"Pattern Recogn"},{"issue":"1","key":"1952_CR30","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/TASSP.1975.1162641","volume":"23","author":"F Itakura","year":"1975","unstructured":"Itakura F (1975) Minimum prediction residual principle applied to speech recognition. IEEE Trans Acoust Speech Signal Process 23(1):67\u201372","journal-title":"IEEE Trans Acoust Speech Signal Process"},{"key":"1952_CR31","unstructured":"Jain AK, Dubes RC (1988) Algorithms for clustering data. Prentice-Hall Inc."},{"issue":"3","key":"1952_CR32","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"AK Jain","year":"1999","unstructured":"Jain AK, Murty MN, Flynn PJ (1999) Data clustering: a review. ACM Comput Surv 31(3):264\u2013323","journal-title":"ACM Comput Surv"},{"key":"1952_CR33","doi-asserted-by":"crossref","unstructured":"Javed A, Lee BS, Rizzo D (2020) A benchmark study on time series clustering. Mach Learn Appl 1","DOI":"10.1016\/j.mlwa.2020.100001"},{"key":"1952_CR34","doi-asserted-by":"publisher","first-page":"2231","DOI":"10.1016\/j.patcog.2010.09.022","volume":"44","author":"Y Jeong","year":"2011","unstructured":"Jeong Y, Jeong M, Omitaomu O (2011) Weighted dynamic time warping for time series classification. Pattern Recogn 44:2231\u20132240","journal-title":"Pattern Recogn"},{"issue":"301","key":"1952_CR35","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1080\/01621459.1963.10500845","volume":"58","author":"JH Ward Jr","year":"1963","unstructured":"Ward JH Jr (1963) Hierarchical grouping to optimize an objective function. J Am Stat Assoc 58(301):236\u2013244","journal-title":"J Am Stat Assoc"},{"key":"1952_CR36","doi-asserted-by":"crossref","unstructured":"Kaufman L, Rousseeuw PJ (1986) Clustering large data sets. In: Pattern recognition in practice, pp 425\u2013437. Elsevier, Amsterdam","DOI":"10.1016\/B978-0-444-87877-9.50039-X"},{"key":"1952_CR37","doi-asserted-by":"crossref","unstructured":"Keogh E, Pazzani M (2001) Derivative dynamic time warping. In: Proceedings of the 1st SIAM international conference on data mining","DOI":"10.1137\/1.9781611972719.1"},{"issue":"1\u20132","key":"1952_CR38","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn HW (1955) The Hungarian method for the assignment problem. Naval Res Logist Q 2(1\u20132):83\u201397","journal-title":"Naval Res Logist Q"},{"key":"1952_CR39","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 (2022) End-to-end deep representation learning for time series clustering: a comparative study. Data Min Knowl Disc 36:29\u201381","journal-title":"Data Min Knowl Disc"},{"key":"1952_CR40","doi-asserted-by":"crossref","unstructured":"Leonard\u00a0Kaufman PJR (1990) Partitioning around medoids (program PAM), chapter\u00a02, pp 68\u2013125. Wiley","DOI":"10.1002\/9780470316801.ch2"},{"key":"1952_CR41","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/j.knosys.2013.09.015","volume":"54","author":"G Li","year":"2013","unstructured":"Li G, Br\u00e4ysy O, Jiang L, Wu Z, Wang Y (2013) Finding time series discord based on bit representation clustering. Knowl-Based Syst 54:243\u2013254","journal-title":"Knowl-Based Syst"},{"issue":"3","key":"1952_CR42","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 (2021) Time series clustering in linear time complexity. Data Min Knowl Disc 35(3):2369\u20132388","journal-title":"Data Min Knowl Disc"},{"key":"1952_CR43","doi-asserted-by":"crossref","unstructured":"Li Z, Yang Y, Liu J, Zhou X, Lu H (2012) Unsupervised feature selection using nonnegative spectral analysis. In Proceedings of the twenty-sixth AAAI conference on artificial intelligence, AAAI\u201912, pp 1026\u20131032. AAAI Press","DOI":"10.1609\/aaai.v26i1.8289"},{"key":"1952_CR44","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 (2015) Time series classification with ensembles of elastic distance measures. Data Min Knowl Disc 29:565\u2013592","journal-title":"Data Min Knowl Disc"},{"issue":"1","key":"1952_CR45","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.aca.2003.12.020","volume":"515","author":"R Llet\u0131","year":"2004","unstructured":"Llet\u0131 R, Ortiz MC, Sarabia LA, S\u00e1nchez MS (2004) Selecting variables for k-means cluster analysis by using a genetic algorithm that optimises the silhouettes. Anal Chim Acta 515(1):87\u2013100","journal-title":"Anal Chim Acta"},{"key":"1952_CR46","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"SP Lloyd","year":"1982","unstructured":"Lloyd SP (1982) Least squares quantization in pcm. IEEE Trans Inf Theory 28:129\u2013136","journal-title":"IEEE Trans Inf Theory"},{"key":"1952_CR47","unstructured":"MacQueen J et al. (1967) Some methods for classification and analysis of multivariate observations. In: Proceedings of the fifth Berkeley symposium on mathematical statistics and probability, vol 1, pp 281\u2013297"},{"issue":"2","key":"1952_CR48","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1109\/TPAMI.2008.76","volume":"31","author":"P Marteau","year":"2009","unstructured":"Marteau P (2009) Time warp edit distance with stiffness adjustment for time series matching. IEEE Trans Pattern Anal Mach Intell 31(2):306\u2013318","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"1952_CR49","doi-asserted-by":"crossref","unstructured":"McInnes L, Healy J (2017) Accelerated hierarchical density based clustering. In: 2017 IEEE international conference on data mining workshops (ICDMW), pp 33\u201342","DOI":"10.1109\/ICDMW.2017.12"},{"key":"1952_CR50","doi-asserted-by":"publisher","first-page":"3211","DOI":"10.1007\/s10994-021-06057-9","volume":"110","author":"M Middlehurst","year":"2021","unstructured":"Middlehurst M, Large J, Flynn M, Lines J, Bostrom A, Bagnall A (2021) HIVE-COTE 2.0: a new meta ensemble for time series classification. Mach Learn 110:3211\u20133243","journal-title":"Mach Learn"},{"key":"1952_CR51","unstructured":"Newling J, Fleuret F (2017) K-medoids for k-means seeding. In: Advances in neural information processing systems, vol\u00a030. Curran Associates, Inc"},{"key":"1952_CR52","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 (2002) CLARANS: a method for clustering objects for spatial data mining. IEEE Trans Knowl Data Eng 14:1003\u20131016","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1952_CR53","doi-asserted-by":"crossref","unstructured":"Paparrizos J, Gravano L (2015) 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","DOI":"10.1145\/2723372.2737793"},{"issue":"2","key":"1952_CR54","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3044711","volume":"42","author":"J Paparrizos","year":"2017","unstructured":"Paparrizos J, Gravano L (2017) Fast and accurate time-series clustering. ACM Trans Database Syst (TODS) 42(2):1\u201349","journal-title":"ACM Trans Database Syst (TODS)"},{"key":"1952_CR55","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 (2011) A global averaging method for dynamic time warping, with applications to clustering. Pattern Recogn 44:678","journal-title":"Pattern Recogn"},{"key":"1952_CR56","doi-asserted-by":"crossref","unstructured":"Rakthanmanon T, Bilson J, Campana L, Mueen A, Batista G, Westover B, Zhu Q, Zakaria J, Keogh E (2013) Addressing big data time series: mining trillions of time series subsequences under dynamic time warping. ACM Trans Knowl Discov Data 7(3)","DOI":"10.1145\/2513092.2500489"},{"key":"1952_CR57","unstructured":"Ratanamahatana C, Keogh E (2004) Everything you know about dynamic time warping is wrong. In: Proceedings of the 3rd workshop on mining temporal and sequential data"},{"key":"1952_CR58","doi-asserted-by":"crossref","unstructured":"Ratanamahatana C, Keogh E (2005) Three myths about dynamic time warping data mining. In: Proceedings of the 5th SIAM international conference on data mining","DOI":"10.1137\/1.9781611972757.50"},{"key":"1952_CR59","doi-asserted-by":"crossref","unstructured":"R\u00e4s\u00e4nen T, Kolehmainen M (2009) Feature-based clustering for electricity use time series data. vol 5495, pp 401\u2013412","DOI":"10.1007\/978-3-642-04921-7_41"},{"issue":"2","key":"1952_CR60","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s10618-020-00727-3","volume":"35","author":"AP Ruiz","year":"2021","unstructured":"Ruiz AP, Flynn M, Large J, Middlehurst M, Bagnall A (2021) The great multivariate time series classification bake off: a review and experimental evaluation of recent algorithmic advances. Data Min Knowl Disc 35(2):401\u2013449","journal-title":"Data Min Knowl Disc"},{"issue":"1","key":"1952_CR61","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1109\/TASSP.1978.1163055","volume":"26","author":"H Sakoe","year":"1978","unstructured":"Sakoe H, Chiba S (1978) Dynamic programming algorithm optimization for spoken word recognition. IEEE Trans Acoust Speech Signal Process 26(1):43\u201349","journal-title":"IEEE Trans Acoust Speech Signal Process"},{"key":"1952_CR62","doi-asserted-by":"publisher","first-page":"664","DOI":"10.1016\/j.neucom.2017.06.053","volume":"267","author":"A Saxena","year":"2017","unstructured":"Saxena A, Prasad M, Gupta A, Bharill N, Patel OP, Tiwari A, Er MJ, Ding W, Lin C-T (2017) A review of clustering techniques and developments. Neurocomputing 267:664\u2013681","journal-title":"Neurocomputing"},{"key":"1952_CR63","doi-asserted-by":"crossref","unstructured":"Schultz D, Jain BJ (2017) Nonsmooth analysis and subgradient methods for averaging in dynamic time warping spaces. CoRR, arXiv:1701.06393","DOI":"10.1016\/j.patcog.2017.08.012"},{"key":"1952_CR64","doi-asserted-by":"crossref","unstructured":"Shi L, Du L, Shen Y-D (2014) Robust spectral learning for unsupervised feature selection. In: 2014 IEEE international conference on data mining, pp 977\u2013982","DOI":"10.1109\/ICDM.2014.58"},{"key":"1952_CR65","doi-asserted-by":"crossref","unstructured":"Shifaz A, Pelletier C, Petitjean F, Webb G (2023) Elastic similarity and distance measures for multivariate time series. Knowl Inf Syst 65(6)","DOI":"10.1007\/s10115-023-01835-4"},{"key":"1952_CR66","doi-asserted-by":"crossref","unstructured":"Silva D, Batista G, Keogh E (2016) Prefix and suffix invariant dynamic time warping. In: IEEE International conference on data mining","DOI":"10.1109\/ICDM.2016.0161"},{"issue":"6","key":"1952_CR67","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 (2013) The move\u2013split\u2013merge metric for time series. IEEE Trans Knowl Data Eng 25(6):1425\u20131438","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1952_CR68","unstructured":"van\u00a0der Maaten L (2011) Learning discriminative fisher kernels. In: Proceedings of the 28th international conference on international conference on machine learning, ICML\u201911, pp 217\u2013224. Omnipress, Madison"},{"key":"1952_CR69","doi-asserted-by":"crossref","unstructured":"Yang J, Leskovec J (2011) Patterns of temporal variation in online media. In: Proceedings of the fourth ACM international conference on web search and data mining, WSDM \u201911, pp 177\u2013186. Association for Computing Machinery, New York","DOI":"10.1145\/1935826.1935863"},{"key":"1952_CR70","unstructured":"Yang J, Wang Y-K, Yao X, Lin C-T (2019) Adaptive initialization method for k-means algorithm"},{"key":"1952_CR71","doi-asserted-by":"crossref","unstructured":"Zakaria J, Mueen A, Keogh E (2012) Clustering time series using unsupervised-shapelets. In: 2012 IEEE 12th international conference on data mining, pp 785\u2013794","DOI":"10.1109\/ICDM.2012.26"},{"issue":"9","key":"1952_CR72","doi-asserted-by":"publisher","first-page":"2193","DOI":"10.1109\/TPAMI.2018.2847699","volume":"41","author":"Q Zhang","year":"2019","unstructured":"Zhang Q, Wu J, Zhang P, Long G, Zhang C (2019) Salient subsequence learning for time series clustering. IEEE Trans Pattern Anal Mach Intell 41(9):2193\u20132207","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"2","key":"1952_CR73","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/235968.233324","volume":"25","author":"T Zhang","year":"1996","unstructured":"Zhang T, Ramakrishnan R, Livny M (1996) Birch: an efficient data clustering method for very large databases. SIGMOD Rec 25(2):103\u2013114","journal-title":"SIGMOD Rec"},{"key":"1952_CR74","doi-asserted-by":"crossref","unstructured":"Zolhavarieh S, Aghabozorgi S, Teh YW (2014) A review of subsequence time series clustering. Sci World J 2014","DOI":"10.1155\/2014\/312521"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-023-01952-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10115-023-01952-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-023-01952-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,17]],"date-time":"2024-01-17T14:06:23Z","timestamp":1705500383000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10115-023-01952-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,7]]},"references-count":74,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,2]]}},"alternative-id":["1952"],"URL":"https:\/\/doi.org\/10.1007\/s10115-023-01952-0","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,7]]},"assertion":[{"value":"11 May 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 July 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 July 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 September 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}