{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T18:19:49Z","timestamp":1783707589910,"version":"3.55.0"},"reference-count":66,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,4,15]],"date-time":"2025-04-15T00:00:00Z","timestamp":1744675200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,4,15]],"date-time":"2025-04-15T00:00:00Z","timestamp":1744675200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000780","name":"European Union","doi-asserted-by":"crossref","award":["PNRR-M4C2-I1.3 Project PE\\_00000019"],"award-info":[{"award-number":["PNRR-M4C2-I1.3 Project PE\\_00000019"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100007052","name":"Universit\u00e0 degli Studi di Verona","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100007052","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2025,5]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>This paper presents , a novel distance between time series based on Random Forests (<jats:sc>RF<\/jats:sc>s). We extend to the time-series domain concepts and tools of <jats:sc>RF<\/jats:sc> distances, a recent class of robust data-dependent distances defined for vectorial representations, thus proposing the <jats:italic>first<\/jats:italic>\n            <jats:sc>RF<\/jats:sc> distance for time series. The distance is determined by (i) creating an RF to model a set of time series, and (ii) exploiting the trained RF to quantify the similarity between time series. As for the first step, we introduce in this paper the <jats:italic>Extremely Randomized Canonical Interval Forest<\/jats:italic> (<jats:sc>ERCIF<\/jats:sc>), a novel extension of Canonical Interval Forests that can model time series and can be trained without labels. We then exploit three different schemes, following ideas already employed in the vectorial case. The proposed distance, in different variants, has been thoroughly evaluated with 128 datasets from the  archive, showing promising results compared with literature alternatives.<\/jats:p>","DOI":"10.1007\/s10618-025-01098-3","type":"journal-article","created":{"date-parts":[[2025,4,15]],"date-time":"2025-04-15T17:59:46Z","timestamp":1744739986000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["TSRF-Dist: a novel time series distance based on extremely randomized canonical interval forests"],"prefix":"10.1007","volume":"39","author":[{"given":"Alberto","family":"Azzari","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Manuele","family":"Bicego","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Carlo","family":"Combi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrea","family":"Cracco","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pietro","family":"Sala","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,4,15]]},"reference":[{"key":"1098_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 JA (2019) A review on distance based time series classification. Data Min Knowl Discov 33:378\u2013412","journal-title":"Data Min Knowl Discov"},{"key":"1098_CR2","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/s10115-017-1046-0","volume":"53","author":"S Aryal","year":"2017","unstructured":"Aryal S, Ting KM, Washio T, Haffari G (2017) Data-dependent dissimilarity measure: an effective alternative to geometric distance measures. Knowl Inf Syst 53:479\u2013506","journal-title":"Knowl Inf Syst"},{"key":"1098_CR3","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/s10618-019-00660-0","volume":"34","author":"S Aryal","year":"2020","unstructured":"Aryal S, Ting KM, Washio T, Haffari G (2020) A comparative study of data-dependent approaches without learning in measuring similarities of data objects. Data Min Knowl Discov 34:124\u2013162","journal-title":"Data Min Knowl Discov"},{"key":"1098_CR4","doi-asserted-by":"crossref","unstructured":"Aryal S, Ting KM, Haffari G, Washio T (2014) Mp-dissimilarity: a data dependent dissimilarity measure. In: 2014 IEEE international conference on data mining","DOI":"10.1109\/ICDM.2014.33"},{"key":"1098_CR5","doi-asserted-by":"crossref","unstructured":"Bicego M (2019) K-random forests: a K-means style algorithm for random forest clustering. In: Proc Int Joint Conf Neural Netw (IJCNN2019)","DOI":"10.1109\/IJCNN.2019.8851820"},{"key":"1098_CR6","first-page":"830","volume":"35","author":"M Bicego","year":"2023","unstructured":"Bicego M, Cicalese F, Mensi A (2023) RatioRF: a novel measure for random forest clustering based on the Tversky\u2019s ratio model. IEEE Trans Knowl Data Eng 35:830\u2013841","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1098_CR7","doi-asserted-by":"crossref","unstructured":"Bicego M, Cicalese F (2023) On the good behaviour of extremely randomized trees in random forest-distance computation. In: Joint European conference on machine learning and knowledge discovery in databases","DOI":"10.1007\/978-3-031-43421-1_38"},{"key":"1098_CR8","doi-asserted-by":"crossref","unstructured":"Bicego M, Escolano F (2020) On learning random forests for random forest-clustering. In: 25th International conference on pattern recognition","DOI":"10.1109\/ICDM50108.2020.00105"},{"key":"1098_CR9","volume-title":"Some infinity theory for predictor ensembles","author":"L Breiman","year":"2000","unstructured":"Breiman L (2000) Some infinity theory for predictor ensembles. Technical report, Citeseer"},{"key":"1098_CR10","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman L (2001) Random forests. Mach Learn 45:5\u201332","journal-title":"Mach Learn"},{"key":"1098_CR11","unstructured":"Breiman L, Friedman JH, Olshen RA, Stone CJ (1984) Classification and regression trees"},{"key":"1098_CR12","first-page":"1","volume":"54","author":"K Chen","year":"2021","unstructured":"Chen K, Zhang D, Yao L, Guo B, Yu Z, Liu Y (2021) Deep learning for sensor-based human activity recognition: overview, challenges, and opportunities. ACM Comput Surv 54:1\u201340","journal-title":"ACM Comput Surv"},{"key":"1098_CR13","doi-asserted-by":"crossref","unstructured":"Chen L, Ng RT (2004) On the marriage of lp-norms and edit distance. In: (e)Proceedings of the thirtieth international conference on very large data bases, VLDB 2004, Toronto, Canada, August 31\u2013September 3 2004","DOI":"10.1016\/B978-012088469-8\/50070-X"},{"key":"1098_CR14","doi-asserted-by":"crossref","unstructured":"Chen L, \u00d6zsu 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, Baltimore, Maryland, USA, June 14-16, 2005","DOI":"10.1145\/1066157.1066213"},{"key":"1098_CR15","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1561\/0600000035","volume":"7","author":"A Criminisi","year":"2012","unstructured":"Criminisi A, Shotton J, Konukoglu E (2012) Decision forests: a unified framework for classification, regression, density estimation, manifold learning and semi-supervised learning. Found Trends Comput Graph Vis 7:81\u2013227","journal-title":"Found Trends Comput Graph Vis"},{"key":"1098_CR16","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.1109\/JAS.2019.1911747","volume":"6","author":"HA Dau","year":"2019","unstructured":"Dau HA, Bagnall A, Kamgar K, Yeh C-CM, Zhu Y, Gharghabi S, Ratanamahatana CA, Keogh E (2019) The UCR time series archive. IEEE\/CAA J Automatica Sinica 6:1293\u20131305","journal-title":"IEEE\/CAA J Automatica Sinica"},{"key":"1098_CR17","unstructured":"Davies A, Ghahramani Z (2014) The random forest kernel and other kernels for big data from random partitions. arXiv preprint arXiv:1402.4293"},{"key":"1098_CR18","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":"1098_CR19","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/j.ins.2013.02.030","volume":"239","author":"H Deng","year":"2013","unstructured":"Deng H, Runger GC, Tuv E, Martyanov V (2013) A time series forest for classification and feature extraction. Inf Sci 239:142\u2013153","journal-title":"Inf Sci"},{"key":"1098_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2379776.2379788","volume":"45","author":"P Esling","year":"2012","unstructured":"Esling P, Agon C (2012) Time-series data mining. ACM Comput Surv (CSUR) 45:1\u201334","journal-title":"ACM Comput Surv (CSUR)"},{"key":"1098_CR21","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1016\/j.cels.2017.10.001","volume":"5","author":"BD Fulcher","year":"2017","unstructured":"Fulcher BD, Jones NS (2017) hctsa: a computational framework for automated time-series phenotyping using massive feature extraction. Cell Syst 5:527\u2013531","journal-title":"Cell Syst"},{"key":"1098_CR22","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10994-006-6226-1","volume":"63","author":"P Geurts","year":"2006","unstructured":"Geurts P, Ernst D, Wehenkel L (2006) Extremely randomized trees. Mach Learn 63:3\u201342","journal-title":"Mach Learn"},{"key":"1098_CR23","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.patrec.2014.03.009","volume":"45","author":"T G\u00f3recki","year":"2014","unstructured":"G\u00f3recki T (2014) Using derivatives in a longest common subsequence dissimilarity measure for time series classification. Pattern Recognit Lett 45:99\u2013105","journal-title":"Pattern Recognit Lett"},{"key":"1098_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2023.109333","volume":"137","author":"M Herrmann","year":"2023","unstructured":"Herrmann M, Webb GI (2023) Amercing: an intuitive and effective constraint for dynamic time warping. Pattern Recognit 137:109333","journal-title":"Pattern Recognit"},{"key":"1098_CR25","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1007\/s10115-023-01952-0","volume":"66","author":"C Holder","year":"2024","unstructured":"Holder C, Middlehurst M, Bagnall A (2024) A review and evaluation of elastic distance functions for time series clustering. Knowl Inf Syst 66:765\u2013809","journal-title":"Knowl Inf Syst"},{"key":"1098_CR26","doi-asserted-by":"crossref","unstructured":"Hubert L, Arabie P (1985) Comparing partitions. J Classif","DOI":"10.1007\/BF01908075"},{"key":"1098_CR27","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.patcog.2019.05.016","volume":"94","author":"BJ Jain","year":"2019","unstructured":"Jain BJ (2019) Making the dynamic time warping distance warping-invariant. Pattern Recognit 94:35\u201352","journal-title":"Pattern Recognit"},{"key":"1098_CR28","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 MK, Omitaomu OA (2011) Weighted dynamic time warping for time series classification. Pattern Recognit 44:2231\u20132240","journal-title":"Pattern Recognit"},{"key":"1098_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.neunet.2019.12.030","volume":"125","author":"Z Karevan","year":"2020","unstructured":"Karevan Z, Suykens JAK (2020) Transductive LSTM for time-series prediction: an application to weather forecasting. Neural Netw 125:1\u20139","journal-title":"Neural Netw"},{"key":"1098_CR30","doi-asserted-by":"publisher","first-page":"1053","DOI":"10.1007\/s10618-016-0473-y","volume":"30","author":"I Karlsson","year":"2016","unstructured":"Karlsson I, Papapetrou P, Bostr\u00f6m H (2016) Generalized random shapelet forests. Data Min Knowl Discov 30:1053\u20131085","journal-title":"Data Min Knowl Discov"},{"key":"1098_CR31","doi-asserted-by":"crossref","unstructured":"Keogh EJ, Pazzani MJ (2001) Derivative dynamic time warping. In: Proceedings of the first SIAM international conference on data mining, SDM 2001, Chicago, IL, USA, April 5\u20137, 2001","DOI":"10.1137\/1.9781611972719.1"},{"key":"1098_CR32","doi-asserted-by":"crossref","unstructured":"Liu FT, Ting KM, Zhou Z-H (2008) Isolation forest. In: 2008 Eighth IEEE international conference on data mining","DOI":"10.1109\/ICDM.2008.17"},{"key":"1098_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2133360.2133363","volume":"6","author":"FT Liu","year":"2012","unstructured":"Liu FT, Ting KM, Zhou Z (2012) Isolation-based anomaly detection. ACM Trans Knowl Discov Data 6:1\u201339","journal-title":"ACM Trans Knowl Discov Data"},{"key":"1098_CR34","doi-asserted-by":"publisher","first-page":"11093","DOI":"10.1109\/JIOT.2023.3239944","volume":"10","author":"S Lu","year":"2023","unstructured":"Lu S, Lu J, An K, Wang X, He Q (2023) Edge computing on IoT for machine signal processing and fault diagnosis: a review. IEEE Internet of Things J 10:11093\u201311116","journal-title":"IEEE Internet of Things J"},{"key":"1098_CR35","doi-asserted-by":"publisher","first-page":"1821","DOI":"10.1007\/s10618-019-00647-x","volume":"33","author":"CH Lubba","year":"2019","unstructured":"Lubba CH, Sethi SS, Knaute P, Schultz SR, Fulcher BD, Jones NS (2019) catch22: Canonical time-series characteristics: selected through highly comparative time-series analysis. Data Min Knowl Discov 33:1821\u20131852","journal-title":"Data Min Knowl Discov"},{"issue":"3","key":"1098_CR36","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1007\/s10618-019-00617-3","volume":"33","author":"B Lucas","year":"2019","unstructured":"Lucas B, Shifaz A, Pelletier C, O\u2019Neill L, Zaidi N, Goethals B, Petitjean F, Webb GI (2019) Proximity forest: an effective and scalable distance-based classifier for time series. Data Min Knowl Discov 33(3):607\u2013635. https:\/\/doi.org\/10.1007\/s10618-019-00617-3","journal-title":"Data Min Knowl Discov"},{"key":"1098_CR37","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:306\u2013318","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"1098_CR38","doi-asserted-by":"publisher","DOI":"10.1016\/J.PATCOG.2023.109334","volume":"138","author":"A Mensi","year":"2023","unstructured":"Mensi A, Tax DMJ, Bicego M (2023) Detecting outliers from pairwise proximities: proximity isolation forests. Pattern Recognit 138:109334. https:\/\/doi.org\/10.1016\/J.PATCOG.2023.109334","journal-title":"Pattern Recognit"},{"key":"1098_CR39","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 AJ (2021) HIVE-COTE 2.0: a new meta ensemble for time series classification. Mach Learn 110:3211\u20133243","journal-title":"Mach Learn"},{"key":"1098_CR40","unstructured":"Middlehurst M, Ismail-Fawaz A, Guillaume A, Holder C, Guijo-Rubio D, Bulatova G, Tsaprounis L, Mentel L, Walter M, Sch\u00e4fer P, Bagnall AJ (2024) aeon: a python toolkit for learning from time series. CoRR arxiv: 2406.14231"},{"key":"1098_CR41","doi-asserted-by":"crossref","unstructured":"Middlehurst M, Large J, Bagnall A (2020) The canonical interval forest (CIF) classifier for time series classification. In: 2020 IEEE international conference on big data (big data)","DOI":"10.1109\/BigData50022.2020.9378424"},{"key":"1098_CR42","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1136\/heart.88.4.378","volume":"88","author":"JE Mietus","year":"2002","unstructured":"Mietus JE (2002) The pNNx files: re-examining a widely used heart rate variability measure. Heart 88:378\u2013380","journal-title":"Heart"},{"key":"1098_CR43","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2022.104695","volume":"110","author":"K Mishra","year":"2022","unstructured":"Mishra K, Basu S, Maulik U (2022) Graft: a graph based time series data mining framework. Eng Appl Artif Intell 110:104695","journal-title":"Eng Appl Artif Intell"},{"key":"1098_CR44","doi-asserted-by":"publisher","first-page":"3252","DOI":"10.1093\/bioinformatics\/btab260","volume":"37","author":"R Mitra","year":"2021","unstructured":"Mitra R, MacLean AL (2021) Rvagene: generative modeling of gene expression time series data. Bioinformatics 37:3252\u20133262","journal-title":"Bioinformatics"},{"key":"1098_CR45","doi-asserted-by":"crossref","unstructured":"Moosmann F, Triggs B, Jurie F (2006) Fast discriminative visual codebooks using randomized clustering forests. In: Advances in neural information processing systems 19","DOI":"10.7551\/mitpress\/7503.003.0128"},{"key":"1098_CR46","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3531326","volume":"14","author":"MA Morid","year":"2023","unstructured":"Morid MA, Sheng ORL, Dunbar J (2023) Time series prediction using deep learning methods in healthcare. ACM Trans Manag Inf Syst 14:1\u201329","journal-title":"ACM Trans Manag Inf Syst"},{"key":"1098_CR47","doi-asserted-by":"crossref","unstructured":"Paparrizos J, Gravano L (2015) k-shape: efficient and accurate clustering of time series. SIGMOD Rec","DOI":"10.1145\/2723372.2737793"},{"key":"1098_CR48","unstructured":"Pedregosa F, Varoquaux G, Gramfort A, Michel V, Thirion B, Grisel O, Blondel M, Prettenhofer P, Weiss R, Dubourg V, VanderPlas J, Passos A, Cournapeau D, Brucher M, Perrot M, Duchesnay E (2019) Scikit-learn: Machine learning in python. J Mach Learn Res"},{"key":"1098_CR49","unstructured":"Quinlan JR (1993) C4.5: programs for machine learning"},{"key":"1098_CR50","doi-asserted-by":"publisher","first-page":"8219","DOI":"10.1007\/s10462-022-10366-3","volume":"56","author":"X Ran","year":"2023","unstructured":"Ran X, Xi Y, Lu Y, Wang X, Lu Z (2023) Comprehensive survey on hierarchical clustering algorithms and the recent developments. Artif Intell Rev 56:8219\u20138264","journal-title":"Artif Intell Rev"},{"key":"1098_CR51","doi-asserted-by":"crossref","unstructured":"Ratanamahatana CA, Keogh EJ (2005) Three myths about dynamic time warping data mining. In: Proceedings of the 2005 SIAM international conference on data mining, SDM 2005, Newport Beach, CA, USA, April 21\u201323, 2005","DOI":"10.1137\/1.9781611972757.50"},{"key":"1098_CR52","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 Discov 35:401\u2013449","journal-title":"Data Min Knowl Discov"},{"key":"1098_CR53","doi-asserted-by":"publisher","DOI":"10.1016\/j.compbiomed.2022.105458","volume":"145","author":"M Shehab","year":"2022","unstructured":"Shehab M, Abualigah L, Shambour Q, Abu-Hashem MA, Shambour MKY, Alsalibi AI, Gandomi AH (2022) Machine learning in medical applications: a review of state-of-the-art methods. Comput Biol Med 145:105458","journal-title":"Comput Biol Med"},{"key":"1098_CR54","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1198\/106186006X94072","volume":"15","author":"T Shi","year":"2006","unstructured":"Shi T, Horvath S (2006) Unsupervised learning with random forest predictors. J Comput Graph Stat 15:118\u2013138","journal-title":"J Comput Graph Stat"},{"key":"1098_CR55","doi-asserted-by":"crossref","unstructured":"Shotton J, Johnson M, Cipolla R (2008) Semantic texton forests for image categorization and segmentation. In: IEEE computer society conference on computer vision and pattern recognition (CVPR 2008)","DOI":"10.1109\/CVPR.2008.4587503"},{"key":"1098_CR56","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-split-merge metric for time series. IEEE Trans Knowl Data Eng 25:1425\u20131438","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1098_CR57","doi-asserted-by":"crossref","unstructured":"Ting KM, Zhu Y, Carman M, Zhu Y, Washio T, Zhou Z-H (2019) Lowest probability mass neighbour algorithms: relaxing the metric constraint in distance-based neighbourhood algorithms. Mach Learn","DOI":"10.1007\/s10994-018-5737-x"},{"key":"1098_CR58","doi-asserted-by":"crossref","unstructured":"Ting KM, Zhu Y, Carman M, Zhu Y, Zhou Z (2016) Overcoming key weaknesses of distance-based neighbourhood methods using a data dependent dissimilarity measure. In: Proc Int Conf Knowl Discov Data Min","DOI":"10.1145\/2939672.2939779"},{"key":"1098_CR59","doi-asserted-by":"crossref","unstructured":"Ting KM, Zhu Y, Zhou Z-H (2018) Isolation kernel and its effect on SVM. In: Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data mining","DOI":"10.1145\/3219819.3219990"},{"key":"1098_CR60","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1037\/0033-295X.84.4.327","volume":"84","author":"A Tversky","year":"1977","unstructured":"Tversky A (1977) Features of similarity. Psychol Rev 84:327","journal-title":"Psychol Rev"},{"key":"1098_CR61","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s10618-012-0250-5","volume":"26","author":"X Wang","year":"2013","unstructured":"Wang X, Mueen A, Ding H, Trajcevski G, Scheuermann P, Keogh E (2013) Experimental comparison of representation methods and distance measures for time series data. Data Min Knowl Discov 26:275\u2013309","journal-title":"Data Min Knowl Discov"},{"key":"1098_CR62","doi-asserted-by":"crossref","unstructured":"Wang X, Wirth A, Wang L (2007) Structure-based statistical features and multivariate time series clustering. In: Proceedings-IEEE international conference on data mining, ICDM","DOI":"10.1109\/ICDM.2007.103"},{"key":"1098_CR63","doi-asserted-by":"crossref","unstructured":"Wilcoxon F (1945) Individual comparisons by ranking methods. Biom Bull","DOI":"10.2307\/3001968"},{"key":"1098_CR64","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.csda.2013.04.010","volume":"66","author":"D Yan","year":"2013","unstructured":"Yan D, Chen A, Jordan MI (2013) Cluster forests. Comput Stat Data Anal 66:178\u2013192","journal-title":"Comput Stat Data Anal"},{"key":"1098_CR65","doi-asserted-by":"publisher","DOI":"10.1016\/j.rse.2019.04.034","volume":"232","author":"K Zhao","year":"2019","unstructured":"Zhao K, Wulder MA, Hu T, Bright R, Wu Q, Qin H, Li Y, Toman E, Mallick B, Zhang X, Brown M (2019) Detecting change-point, trend, and seasonality in satellite time series data to track abrupt changes and nonlinear dynamics: a Bayesian ensemble algorithm. Remote Sens Environ 232:111181","journal-title":"Remote Sens Environ"},{"key":"1098_CR66","doi-asserted-by":"crossref","unstructured":"Zhu X, Loy CC, Gong S (2014) Constructing robust affinity graphs for spectral clustering. In: Proc Int Conf Comput Vision Pattern Recognit, CVPR 2014","DOI":"10.1109\/CVPR.2014.188"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-025-01098-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10618-025-01098-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-025-01098-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,26]],"date-time":"2025-04-26T01:35:48Z","timestamp":1745631348000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10618-025-01098-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,15]]},"references-count":66,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,5]]}},"alternative-id":["1098"],"URL":"https:\/\/doi.org\/10.1007\/s10618-025-01098-3","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4,15]]},"assertion":[{"value":"10 October 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 March 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 April 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"27"}}