{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T21:50:00Z","timestamp":1769896200833,"version":"3.49.0"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,11,15]],"date-time":"2025-11-15T00:00:00Z","timestamp":1763164800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,15]],"date-time":"2025-11-15T00:00:00Z","timestamp":1763164800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100011878","name":"Vlaamse regering","doi-asserted-by":"publisher","award":["Onderzoeksprogramma Artifici\u00eble Intelligentie (AI) Vlaanderen"],"award-info":[{"award-number":["Onderzoeksprogramma Artifici\u00eble Intelligentie (AI) Vlaanderen"]}],"id":[{"id":"10.13039\/501100011878","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100011878","name":"Vlaamse regering","doi-asserted-by":"publisher","award":["Onderzoeksprogramma Artifici\u00eble Intelligentie (AI) Vlaanderen"],"award-info":[{"award-number":["Onderzoeksprogramma Artifici\u00eble Intelligentie (AI) Vlaanderen"]}],"id":[{"id":"10.13039\/501100011878","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100011878","name":"Vlaamse regering","doi-asserted-by":"publisher","award":["Onderzoeksprogramma Artifici\u00eble Intelligentie (AI) Vlaanderen"],"award-info":[{"award-number":["Onderzoeksprogramma Artifici\u00eble Intelligentie (AI) Vlaanderen"]}],"id":[{"id":"10.13039\/501100011878","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100011878","name":"Vlaamse regering","doi-asserted-by":"publisher","award":["Onderzoeksprogramma Artifici\u00eble Intelligentie (AI) Vlaanderen"],"award-info":[{"award-number":["Onderzoeksprogramma Artifici\u00eble Intelligentie (AI) Vlaanderen"]}],"id":[{"id":"10.13039\/501100011878","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100012331","name":"Agentschap Innoveren en Ondernemen","doi-asserted-by":"publisher","award":["HBC.2020.2795"],"award-info":[{"award-number":["HBC.2020.2795"]}],"id":[{"id":"10.13039\/100012331","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2026,1]]},"DOI":"10.1007\/s10618-025-01169-5","type":"journal-article","created":{"date-parts":[[2025,11,15]],"date-time":"2025-11-15T08:01:09Z","timestamp":1763193669000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Quantitative evaluation of motif sets in time series"],"prefix":"10.1007","volume":"40","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4941-5480","authenticated-orcid":false,"given":"Daan","family":"Van Wesenbeeck","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6213-5427","authenticated-orcid":false,"given":"Aras","family":"Yurtman","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9560-3872","authenticated-orcid":false,"given":"Wannes","family":"Meert","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0378-3699","authenticated-orcid":false,"given":"Hendrik","family":"Blockeel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,11,15]]},"reference":[{"key":"1169_CR1","doi-asserted-by":"publisher","unstructured":"Alaee S, Kamgar K, Keogh E (2020) Matrix Profile XXII: exact discovery of time series motifs under DTW. In: 2020 IEEE international conference on data mining (ICDM), Sorrento, Italy. IEEE, pp 900\u2013905. https:\/\/doi.org\/10.1109\/ICDM50108.2020.00099","DOI":"10.1109\/ICDM50108.2020.00099"},{"key":"1169_CR2","doi-asserted-by":"publisher","unstructured":"Bagnall A, Hills J, Lines J (2014) Finding motif sets in time series. Preprint at arXiv:1407.3685. https:\/\/doi.org\/10.48550\/arXiv.1407.3685","DOI":"10.48550\/arXiv.1407.3685"},{"issue":"5","key":"1169_CR3","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1109\/JSTSP.2016.2543679","volume":"10","author":"A Balasubramanian","year":"2016","unstructured":"Balasubramanian A, Wang J, Prabhakaran B (2016) Discovering multidimensional motifs in physiological signals for personalized healthcare. IEEE J Sel Top Signal Process 10(5):832\u2013841. https:\/\/doi.org\/10.1109\/JSTSP.2016.2543679","journal-title":"IEEE J Sel Top Signal Process"},{"issue":"5","key":"1169_CR4","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(5):1\u201310","journal-title":"J Mach Learn Res"},{"key":"1169_CR5","doi-asserted-by":"publisher","unstructured":"Cartwright E, Crane M, Ruskin HJ (2019) Financial time series: motif discovery and analysis using VALMOD. In: Computational science\u2014 ICCS 2019. Springer International Publishing, pp 771\u2013778. https:\/\/doi.org\/10.1007\/978-3-030-22750-0_77","DOI":"10.1007\/978-3-030-22750-0_77"},{"key":"1169_CR6","doi-asserted-by":"publisher","unstructured":"Castro N, Azevedo P (2010) Multiresolution motif discovery in time series, pp 665\u2013676. https:\/\/doi.org\/10.1137\/1.9781611972801.73","DOI":"10.1137\/1.9781611972801.73"},{"key":"1169_CR7","doi-asserted-by":"crossref","unstructured":"Dau A, Keogh E, Kamgar K, Yeh C-CM, Zhu Y, Gharghabi S, Ratanamahatana CA, Yanping Hu B, Begum N, Bagnall A, Mueen A, Batista G (2018) The UCR time series classification archive. https:\/\/www.cs.ucr.edu\/eamonn\/time_series_data_2018\/","DOI":"10.1109\/JAS.2019.1911747"},{"key":"1169_CR8","doi-asserted-by":"publisher","unstructured":"Dau HA, Keogh E (2017) Matrix profile V: a generic technique to incorporate domain knowledge into motif discovery. In: Proceedings of the 23rd ACM SIGKDD international conference on knowledge discovery and data mining, pp 125\u2013134. https:\/\/doi.org\/10.1145\/3097983.3097993","DOI":"10.1145\/3097983.3097993"},{"key":"1169_CR9","doi-asserted-by":"publisher","unstructured":"Furtado\u00a0Silva D, Batista G (2018) Elastic time series motifs and discords. In: 2018 17th IEEE international conference on machine learning and applications (ICMLA), pp 237\u2013242. https:\/\/doi.org\/10.1109\/ICMLA.2018.00042","DOI":"10.1109\/ICMLA.2018.00042"},{"issue":"5","key":"1169_CR10","doi-asserted-by":"publisher","first-page":"1200","DOI":"10.1007\/s10618-018-0570-1","volume":"32","author":"Y Gao","year":"2018","unstructured":"Gao Y, Lin J (2018) Exploring variable-length time series motifs in one hundred million length scale. Data Min Knowl Disc 32(5):1200\u20131228. https:\/\/doi.org\/10.1007\/s10618-018-0570-1","journal-title":"Data Min Knowl Disc"},{"key":"1169_CR11","doi-asserted-by":"publisher","unstructured":"Grabocka J, Schilling N, Schmidt-Thieme L (2016) Latent time-series motifs. ACM Trans Knowl Discov Data 11(1). https:\/\/doi.org\/10.1145\/2940329","DOI":"10.1145\/2940329"},{"issue":"4","key":"1169_CR12","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/0165-1765(92)90022-Q","volume":"38","author":"R Harris","year":"1992","unstructured":"Harris R (1992) Testing for unit roots using the augmented dickey-fuller test: some issues relating to the size, power and the lag structure of the test. Econ Lett 38(4):381\u2013386. https:\/\/doi.org\/10.1016\/0165-1765(92)90022-Q","journal-title":"Econ Lett"},{"key":"1169_CR13","doi-asserted-by":"publisher","unstructured":"Javed A, Lee BS, Rizzo DM (2020) A benchmark study on time series clustering. Mach Learn Appl 1. https:\/\/doi.org\/10.1016\/j.mlwa.2020.100001","DOI":"10.1016\/j.mlwa.2020.100001"},{"key":"1169_CR14","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF02278710","volume":"38","author":"R Jonker","year":"1987","unstructured":"Jonker R, Volgenant T (1987) A shortest augmenting path algorithm for dense and sparse linear assignment problems. Computing 38:325\u2013340. https:\/\/doi.org\/10.1007\/BF02278710","journal-title":"Computing"},{"issue":"39","key":"1169_CR15","doi-asserted-by":"publisher","first-page":"1504","DOI":"10.21105\/joss.01504","volume":"4","author":"SM Law","year":"2019","unstructured":"Law SM (2019) STUMPY: a powerful and scalable Python library for time series data mining. J Open Source Softw 4(39):1504. https:\/\/doi.org\/10.21105\/joss.01504","journal-title":"J Open Source Softw"},{"key":"1169_CR16","unstructured":"Lin J, Keogh E, Lonardi S, Patel P (2002) Finding motifs in time series. In: Proceedings of the second workshop on temporal data mining"},{"key":"1169_CR17","doi-asserted-by":"publisher","unstructured":"Linardi M, Zhu Y, Palpanas T, Keogh E (2018) Matrix Profile X: VALMOD - scalable discovery of variable-length motifs in data series. In: Proceedings of the 2018 international conference on management of data, pp 1053\u20131066. https:\/\/doi.org\/10.1145\/3183713.3183744","DOI":"10.1145\/3183713.3183744"},{"key":"1169_CR18","unstructured":"Minnen D, Starner T, Essa I, Jr C (2007) Improving activity discovery with automatic neighborhood estimation. In: Proceedings of the 20th international joint conference on artificial intelligence, pp 2814\u20132819"},{"issue":"1","key":"1169_CR19","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1109\/ICDM.2013.27","volume":"45","author":"A Mueen","year":"2015","unstructured":"Mueen A, Chavoshi N (2015) Enumeration of time series motifs of all lengths. Knowl Inf Syst 45(1):105\u2013132. https:\/\/doi.org\/10.1109\/ICDM.2013.27","journal-title":"Knowl Inf Syst"},{"key":"1169_CR20","doi-asserted-by":"publisher","unstructured":"Nunthanid P, Niennattrakul V, Ratanamahatana CA (2012) Parameter-free motif discovery for time series data. In: 2012 9th international conference on electrical engineering\/electronics, computer, telecommunications and information technology, pp 1\u20134. https:\/\/doi.org\/10.1109\/ECTICon.2012.6254126","DOI":"10.1109\/ECTICon.2012.6254126"},{"key":"1169_CR21","doi-asserted-by":"publisher","unstructured":"Ramezani SB, Amirlatifi A, Rahimi S, Seale M (2024) Arrhythmia detection in ECG signals: a novel framework for signature extraction using self-supervised motif discovery. TechRxiv pre-print. https:\/\/doi.org\/10.36227\/techrxiv.173014180.06535495\/v1","DOI":"10.36227\/techrxiv.173014180.06535495\/v1"},{"key":"1169_CR22","doi-asserted-by":"publisher","first-page":"725","DOI":"10.14778\/3574245.3574257","volume":"16","author":"P Sch\u00e1fer","year":"2023","unstructured":"Sch\u00e1fer P (2023) Motiflets: simple and accurate detection of motifs in time series. Proc VLDB Endow 16:725\u2013737. https:\/\/doi.org\/10.14778\/3574245.3574257","journal-title":"Proc VLDB Endow"},{"key":"1169_CR23","doi-asserted-by":"publisher","unstructured":"Senin P, Lin J, Wang X, Oates T, Gandhi S, Boedihardjo AP, Chen C, Frankenstein S (2018) Grammarviz 3.0: interactive discovery of variable-length time series patterns. ACM Trans Knowl Discov Data 12(1). https:\/\/doi.org\/10.1145\/3051126","DOI":"10.1145\/3051126"},{"issue":"1","key":"1169_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10618-016-0455-0","volume":"31","author":"M Shokoohi-Yekta","year":"2017","unstructured":"Shokoohi-Yekta M, Hu B, Jin H, Wang J, Keogh E (2017) Generalizing DTW to the multi-dimensional case requires an adaptive approach. Data Min Knowl Discov 31(1):1\u201331. https:\/\/doi.org\/10.1007\/s10618-016-0455-0","journal-title":"Data Min Knowl Discov"},{"key":"1169_CR25","doi-asserted-by":"publisher","unstructured":"van Leeuwen F, Bosma B, den Born Av, Postma E (2023) Normalization in motif discovery. In: Machine learning, optimization, and data science. Springer Nature Switzerland, pp 314\u2013325. https:\/\/doi.org\/10.1007\/978-3-031-25891-6_24","DOI":"10.1007\/978-3-031-25891-6_24"},{"key":"1169_CR26","doi-asserted-by":"publisher","first-page":"73754","DOI":"10.1109\/ACCESS.2023.3295995","volume":"11","author":"M Van Onsem","year":"2023","unstructured":"Van Onsem M, Ledoux V, M\u00e9lange W, Dreesen D, Van Hoecke S (2023) Variable length motif discovery in time series data. IEEE Access 11:73754\u201373766. https:\/\/doi.org\/10.1109\/ACCESS.2023.3295995","journal-title":"IEEE Access"},{"key":"1169_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-024-01032-z","author":"D Van Wesenbeeck","year":"2024","unstructured":"Van Wesenbeeck D, Yurtman A, Meert W, Blockeel H (2024) LoCoMotif: discovering time-warped motifs in time series. Data Min Knowl Disc. https:\/\/doi.org\/10.1007\/s10618-024-01032-z","journal-title":"Data Min Knowl Disc"},{"key":"1169_CR28","doi-asserted-by":"publisher","unstructured":"Williams B (2008) Character trajectories. UCI Machine Learning Repository. https:\/\/doi.org\/10.24432\/C58G7V","DOI":"10.24432\/C58G7V"},{"key":"1169_CR29","doi-asserted-by":"publisher","unstructured":"Yeh C-CM, Kavantzas N, Keogh E (2017) Matrix profile VI: meaningful multidimensional motif discovery. In: 2017 IEEE international conference on data mining (ICDM), pp 565\u2013574. https:\/\/doi.org\/10.1109\/ICDM.2017.66","DOI":"10.1109\/ICDM.2017.66"},{"issue":"1","key":"1169_CR30","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s10618-017-0519-9","volume":"32","author":"C-CM Yeh","year":"2018","unstructured":"Yeh C-CM, Zhu Y, Ulanova L, Begum N, Ding Y, Dau HA, Zimmerman Z, Silva DF, Mueen A, Keogh E (2018) Time series joins, motifs, discords and shapelets: a unifying view that exploits the matrix profile. Data Min Knowl Discov 32(1):83\u2013123. https:\/\/doi.org\/10.1007\/s10618-017-0519-9","journal-title":"Data Min Knowl Discov"},{"key":"1169_CR31","doi-asserted-by":"publisher","unstructured":"Yingchareonthawornchai S, Sivaraks H, Rakthanmanon T, Ratanamahatana CA (2013) Efficient proper length time series motif discovery. In: 2013 IEEE 13th international conference on data mining, pp 1265\u20131270. https:\/\/doi.org\/10.1109\/ICDM.2013.111","DOI":"10.1109\/ICDM.2013.111"},{"key":"1169_CR32","doi-asserted-by":"publisher","unstructured":"Zhu Y, Zimmerman Z, Senobari NS, Yeh C-CM, Funning G, Mueen A, Brisk P, Keogh E (2016) Matrix profile II: exploiting a novel algorithm and gpus to break the one hundred million barrier for time series motifs and joins. In: 2016 IEEE 16th international conference on data mining (ICDM), pp 739\u2013748. https:\/\/doi.org\/10.1109\/ICDM.2016.0085","DOI":"10.1109\/ICDM.2016.0085"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-025-01169-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10618-025-01169-5","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-025-01169-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T08:54:11Z","timestamp":1769849651000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10618-025-01169-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,15]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,1]]}},"alternative-id":["1169"],"URL":"https:\/\/doi.org\/10.1007\/s10618-025-01169-5","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,15]]},"assertion":[{"value":"12 December 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 October 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 November 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 declare no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"5"}}