{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T20:04:30Z","timestamp":1770494670010,"version":"3.49.0"},"reference-count":32,"publisher":"Association for Computing Machinery (ACM)","issue":"4","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2022,12]]},"abstract":"<jats:p>\n            A time series motif intuitively is a short time series that repeats itself approximately the same within a larger time series. Such motifs often represent concealed structures, such as heart beats in an ECG recording, the riff in a pop song, or sleep spindles in EEG sleep data. Motif discovery (MD) is the task of finding such motifs in a given input series. As there are varying definitions of what exactly a motif is, a number of different algorithms exist. As central parameters they all take the length\n            <jats:italic>l<\/jats:italic>\n            of the motif and the maximal distance\n            <jats:italic>r<\/jats:italic>\n            between the motif's occurrences. In practice, however, especially suitable values for\n            <jats:italic>r<\/jats:italic>\n            are very hard to determine upfront, and found motifs show a high variability even for very similar\n            <jats:italic>r<\/jats:italic>\n            values. Accordingly, finding an interesting motif with these methods requires extensive trial-and-error.\n          <\/jats:p>\n          <jats:p>\n            In this paper, we present a different approach to the MD problem. We define\n            <jats:italic>k<\/jats:italic>\n            -Motiflets as the set of exactly\n            <jats:italic>k<\/jats:italic>\n            occurrences of a motif of length\n            <jats:italic>l<\/jats:italic>\n            , whose maximum pairwise distance is minimal. This turns the MD problem upside-down: The central parameter of our approach is not the distance threshold\n            <jats:italic>r<\/jats:italic>\n            , but the desired number of occurrence\n            <jats:italic>k<\/jats:italic>\n            of the motif, which we show is considerably more intuitive and easier to set. Based on this definition, we present exact and approximate algorithms for finding\n            <jats:italic>k<\/jats:italic>\n            -Motiflets and analyze their complexity. To further ease the use of our method, we describe statistical tools to automatically determine meaningful values for its input parameters. Thus, for the first time, extracting meaningful motif sets without any a-priori knowledge becomes feasible. By evaluation on several real-world data sets and comparison to four state-of-the-art MD algorithms, we show that our proposed algorithm is both quantitatively superior to its competitors, finding larger motif sets at higher similarity, and qualitatively better, leading to clearer and easier to interpret motifs without any need for manual tuning.\n          <\/jats:p>","DOI":"10.14778\/3574245.3574257","type":"journal-article","created":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T23:14:12Z","timestamp":1677021252000},"page":"725-737","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":18,"title":["Motiflets"],"prefix":"10.14778","volume":"16","author":[{"given":"Patrick","family":"Sch\u00e4fer","sequence":"first","affiliation":[{"name":"Humboldt-Universit\u00e4t zu Berlin, Berlin, Germany"}]},{"given":"Ulf","family":"Leser","sequence":"additional","affiliation":[{"name":"Humboldt-Universit\u00e4t zu Berlin, Berlin, Germany"}]}],"member":"320","published-online":{"date-parts":[[2023,2,21]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Finding motif sets in time series. arXiv preprint arXiv:1407.3685","author":"Bagnall Anthony","year":"2014","unstructured":"Anthony Bagnall , Jon Hills , and Jason Lines . 2014. Finding motif sets in time series. arXiv preprint arXiv:1407.3685 ( 2014 ). Anthony Bagnall, Jon Hills, and Jason Lines. 2014. Finding motif sets in time series. arXiv preprint arXiv:1407.3685 (2014)."},{"key":"e_1_2_1_2_1","volume-title":"1997 European Control Conference (ECC). IEEE, 2168--2173","author":"Bastogne T","year":"1997","unstructured":"T Bastogne , H Noura , A Richard , and J-M Hittinger . 1997 . Application of subspace methods to the identification of a winding process . In 1997 European Control Conference (ECC). IEEE, 2168--2173 . T Bastogne, H Noura, A Richard, and J-M Hittinger. 1997. Application of subspace methods to the identification of a winding process. In 1997 European Control Conference (ECC). IEEE, 2168--2173."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/JAS.2019.1911747"},{"key":"e_1_2_1_4_1","volume-title":"Proceedings of the 23rd ACM SIGKDD international conference on knowledge discovery and data mining. 125--134","author":"Dau Hoang Anh","year":"2017","unstructured":"Hoang Anh Dau and Eamonn Keogh . 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. 125--134 . Hoang Anh Dau and Eamonn Keogh. 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. 125--134."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2015.2398954"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.0030039"},{"key":"e_1_2_1_7_1","doi-asserted-by":"crossref","first-page":"52","DOI":"10.14257\/astl.2015.97.09","article-title":"Classifying urban sounds using time series motifs","volume":"97","author":"Gomes Elsa Ferreira","year":"2015","unstructured":"Elsa Ferreira Gomes and Fabio Batista . 2015 . Classifying urban sounds using time series motifs . Advanced Science and Technology Letters 97 (2015), 52 -- 57 . Elsa Ferreira Gomes and Fabio Batista. 2015. Classifying urban sounds using time series motifs. Advanced Science and Technology Letters 97 (2015), 52--57.","journal-title":"Advanced Science and Technology Letters"},{"key":"e_1_2_1_8_1","volume-title":"Latent time-series motifs. ACM Transactions on Knowledge Discovery from Data (TKDD) 11, 1","author":"Grabocka Josif","year":"2016","unstructured":"Josif Grabocka , Nicolas Schilling , and Lars Schmidt-Thieme . 2016. Latent time-series motifs. ACM Transactions on Knowledge Discovery from Data (TKDD) 11, 1 ( 2016 ), 1--20. Josif Grabocka, Nicolas Schilling, and Lars Schmidt-Thieme. 2016. Latent time-series motifs. ACM Transactions on Knowledge Discovery from Data (TKDD) 11, 1 (2016), 1--20."},{"key":"e_1_2_1_9_1","unstructured":"k-Motiflets Source Code and Raw Results. 2022. https:\/\/github.com\/patrickzib\/motiflets.  k-Motiflets Source Code and Raw Results. 2022. https:\/\/github.com\/patrickzib\/motiflets."},{"key":"e_1_2_1_10_1","volume-title":"2012 11th International Conference on Machine Learning and Applications","volume":"2","author":"Kamath Chandrika","year":"2012","unstructured":"Chandrika Kamath and Ya Ju Fan . 2012 . Finding motifs in wind generation time series data . In 2012 11th International Conference on Machine Learning and Applications , Vol. 2 . IEEE, 481--486. Chandrika Kamath and Ya Ju Fan. 2012. Finding motifs in wind generation time series data. In 2012 11th International Conference on Machine Learning and Applications, Vol. 2. IEEE, 481--486."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004220000144"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1080\/13102818.2018.1438209"},{"key":"e_1_2_1_13_1","volume-title":"2015 IEEE 31st International Conference on Data Engineering. IEEE, 579--590","author":"Li Yuhong","year":"2015","unstructured":"Yuhong Li , Man Lung Yiu , Zhiguo Gong , 2015 . Quick-motif: An efficient and scalable framework for exact motif discovery . In 2015 IEEE 31st International Conference on Data Engineering. IEEE, 579--590 . Yuhong Li, Man Lung Yiu, Zhiguo Gong, et al. 2015. Quick-motif: An efficient and scalable framework for exact motif discovery. In 2015 IEEE 31st International Conference on Data Engineering. IEEE, 579--590."},{"key":"e_1_2_1_14_1","volume-title":"Proc. of the 2nd Workshop on Temporal Data Mining. 53--68","author":"Lin Jessica","year":"2002","unstructured":"Jessica Lin , Eamonn Keogh , Stefano Lonardi , and Pranav Patel . 2002 . Finding motifs in time series . In Proc. of the 2nd Workshop on Temporal Data Mining. 53--68 . Jessica Lin, Eamonn Keogh, Stefano Lonardi, and Pranav Patel. 2002. Finding motifs in time series. In Proc. of the 2nd Workshop on Temporal Data Mining. 53--68."},{"key":"e_1_2_1_15_1","volume-title":"Experiencing SAX: a novel symbolic representation of time series. Data Mining and knowledge discovery 15, 2","author":"Lin Jessica","year":"2007","unstructured":"Jessica Lin , Eamonn Keogh , Li Wei , and Stefano Lonardi . 2007. Experiencing SAX: a novel symbolic representation of time series. Data Mining and knowledge discovery 15, 2 ( 2007 ), 107--144. Jessica Lin, Eamonn Keogh, Li Wei, and Stefano Lonardi. 2007. Experiencing SAX: a novel symbolic representation of time series. Data Mining and knowledge discovery 15, 2 (2007), 107--144."},{"key":"e_1_2_1_16_1","volume-title":"Proceedings of the 2018 International Conference on Management of Data. 1053--1066","author":"Linardi Michele","year":"2018","unstructured":"Michele Linardi , Yan Zhu , Themis Palpanas , and Eamonn Keogh . 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. 1053--1066 . Michele Linardi, Yan Zhu, Themis Palpanas, and Eamonn Keogh. 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. 1053--1066."},{"key":"e_1_2_1_17_1","volume-title":"Proceedings of the 2018 International Conference on Management of Data. 1757--1760","author":"Linardi Michele","year":"2018","unstructured":"Michele Linardi , Yan Zhu , Themis Palpanas , and Eamonn Keogh . 2018 . VALMOD: A suite for easy and exact detection of variable length motifs in data series . In Proceedings of the 2018 International Conference on Management of Data. 1757--1760 . Michele Linardi, Yan Zhu, Themis Palpanas, and Eamonn Keogh. 2018. VALMOD: A suite for easy and exact detection of variable length motifs in data series. In Proceedings of the 2018 International Conference on Management of Data. 1757--1760."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2015.2411226"},{"key":"e_1_2_1_19_1","volume-title":"Efficient mining of understandable patterns from multivariate interval time series. Data mining and knowledge discovery 15, 2","author":"M\u00f6rchen Fabian","year":"2007","unstructured":"Fabian M\u00f6rchen and Alfred Ultsch . 2007. Efficient mining of understandable patterns from multivariate interval time series. Data mining and knowledge discovery 15, 2 ( 2007 ), 181--215. Fabian M\u00f6rchen and Alfred Ultsch. 2007. Efficient mining of understandable patterns from multivariate interval time series. Data mining and knowledge discovery 15, 2 (2007), 181--215."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972795.41"},{"key":"e_1_2_1_21_1","volume-title":"Proceedings DCC'97","author":"Nevill-Manning Craig G","year":"1997","unstructured":"Craig G Nevill-Manning and Ian H Witten . 1997 . Linear-time, incremental hierarchy inference for compression . In Proceedings DCC'97 . Data Compression Conference. IEEE, 3--11. Craig G Nevill-Manning and Ian H Witten. 1997. Linear-time, incremental hierarchy inference for compression. In Proceedings DCC'97. Data Compression Conference. IEEE, 3--11."},{"key":"e_1_2_1_22_1","volume-title":"2002 IEEE International Conference on Data Mining, 2002. Proceedings. IEEE, 370--377","author":"Patel Pranav","year":"2002","unstructured":"Pranav Patel , Eamonn Keogh , Jessica Lin , and Stefano Lonardi . 2002 . Mining motifs in massive time series databases . In 2002 IEEE International Conference on Data Mining, 2002. Proceedings. IEEE, 370--377 . Pranav Patel, Eamonn Keogh, Jessica Lin, and Stefano Lonardi. 2002. Mining motifs in massive time series databases. In 2002 IEEE International Conference on Data Mining, 2002. Proceedings. IEEE, 370--377."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1093\/europace\/eum096"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCSW.2011.20"},{"key":"e_1_2_1_25_1","volume-title":"Interactive discovery of variable-length time series patterns. ACM Transactions on Knowledge Discovery from Data (TKDD) 12, 1","author":"Senin Pavel","year":"2018","unstructured":"Pavel Senin , Jessica Lin , Xing Wang , Tim Oates , Sunil Gandhi , Arnold P Boedihardjo , Crystal Chen , and Susan Frankenstein . 2018. Grammarviz 3.0 : Interactive discovery of variable-length time series patterns. ACM Transactions on Knowledge Discovery from Data (TKDD) 12, 1 ( 2018 ), 1--28. Pavel Senin, Jessica Lin, Xing Wang, Tim Oates, Sunil Gandhi, Arnold P Boedihardjo, Crystal Chen, and Susan Frankenstein. 2018. Grammarviz 3.0: Interactive discovery of variable-length time series patterns. ACM Transactions on Knowledge Discovery from Data (TKDD) 12, 1 (2018), 1--28."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44845-8_37"},{"key":"e_1_2_1_27_1","volume-title":"Proceedings of the 1st International Workshop on Non-Intrusive Load Monitoring","volume":"7","author":"Shao Huijuan","year":"2012","unstructured":"Huijuan Shao , Manish Marwah , and Naren Ramakrishnan . 2012 . A temporal motif mining approach to unsupervised energy disaggregation . In Proceedings of the 1st International Workshop on Non-Intrusive Load Monitoring , Pittsburgh, PA, USA , Vol. 7 . Huijuan Shao, Manish Marwah, and Naren Ramakrishnan. 2012. A temporal motif mining approach to unsupervised energy disaggregation. In Proceedings of the 1st International Workshop on Non-Intrusive Load Monitoring, Pittsburgh, PA, USA, Vol. 7."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3357931"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1199"},{"key":"e_1_2_1_30_1","volume-title":"2016 IEEE 16th international conference on data mining (ICDM). Ieee, 1317--1322","author":"Michael Yeh Chin-Chia","year":"2016","unstructured":"Chin-Chia Michael Yeh , Yan Zhu , Liudmila Ulanova , Nurjahan Begum , Yifei Ding , Hoang Anh Dau , Diego Furtado Silva , Abdullah Mueen , and Eamonn Keogh . 2016 . Matrix profile I: all pairs similarity joins for time series: a unifying view that includes motifs, discords and shapelets . In 2016 IEEE 16th international conference on data mining (ICDM). Ieee, 1317--1322 . Chin-Chia Michael Yeh, Yan Zhu, Liudmila Ulanova, Nurjahan Begum, Yifei Ding, Hoang Anh Dau, Diego Furtado Silva, Abdullah Mueen, and Eamonn Keogh. 2016. Matrix profile I: all pairs similarity joins for time series: a unifying view that includes motifs, discords and shapelets. In 2016 IEEE 16th international conference on data mining (ICDM). Ieee, 1317--1322."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2018.00099"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2016.0085"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3574245.3574257","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T23:23:51Z","timestamp":1677021831000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3574245.3574257"}},"subtitle":["Simple and Accurate Detection of Motifs in Time Series"],"short-title":[],"issued":{"date-parts":[[2022,12]]},"references-count":32,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["10.14778\/3574245.3574257"],"URL":"https:\/\/doi.org\/10.14778\/3574245.3574257","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2022,12]]},"assertion":[{"value":"2023-02-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}