{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T13:48:40Z","timestamp":1770040120992,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,8,24]],"date-time":"2024-08-24T00:00:00Z","timestamp":1724457600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Ministry of Arts and Sciences Research Fund","award":["23K11119"],"award-info":[{"award-number":["23K11119"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,8,25]]},"DOI":"10.1145\/3637528.3671726","type":"proceedings-article","created":{"date-parts":[[2024,8,25]],"date-time":"2024-08-25T04:55:12Z","timestamp":1724561712000},"page":"1188-1198","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Discovery of Time Series Motifs under both Length Differences and Warping"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8308-665X","authenticated-orcid":false,"given":"Makoto","family":"Imamura","sequence":"first","affiliation":[{"name":"Tokai University, Minato-ku, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-0489-1830","authenticated-orcid":false,"given":"Takaaki","family":"Nakamura","sequence":"additional","affiliation":[{"name":"Mitsubishi Electric Corporation, Kamakura, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,8,24]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1974.1100705"},{"key":"e_1_3_2_1_2_1","first-page":"900","article-title":"XXII: Matrix Profile Exact Discovery of Time Series Motifs under DTW","author":"Alee S.","year":"2020","unstructured":"Alee, S., Mercer, R. Kamgar, and Keogh, E., \"XXII: Matrix Profile Exact Discovery of Time Series Motifs under DTW,\" IEEE ICDM, pp. 900--905 (2020).","journal-title":"IEEE ICDM"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-021-00740-0"},{"key":"e_1_3_2_1_4_1","volume-title":"The ucr time series classification archive","author":"Chen Y.","year":"2015","unstructured":"Chen, Y., Keogh, E., Hu, B., Begum, N., Bagnall, A., Mueen, A. and Batista, G., \"The ucr time series classification archive,\" (2015). www.cs.ucr.edu\/~eamonn\/time series data\/."},{"key":"e_1_3_2_1_5_1","first-page":"493","article-title":"Probabilistic discovery of time series Motifs","author":"Chiu B.","year":"2003","unstructured":"Chiu, B., Keogh, E. and Lonardi, S., \"Probabilistic discovery of time series Motifs,\" ACM SIGKDD, pp. 493--498 (2003).","journal-title":"ACM SIGKDD"},{"key":"e_1_3_2_1_6_1","first-page":"125","article-title":"Matrix Profile V: A Generic Technique to Incorporate Domain Knowledge into Motif Discovery","author":"Dau H. A.","year":"2017","unstructured":"Dau, H. A., and Keogh, E., \"Matrix Profile V: A Generic Technique to Incorporate Domain Knowledge into Motif Discovery,\" ACM SIGKDD, pp. 125--134 (2017).","journal-title":"ACM SIGKDD"},{"key":"e_1_3_2_1_7_1","volume-title":"The UCI Machine Learning Repository","author":"Dua D.","year":"2019","unstructured":"Dua, D. and Graff, C., \"The UCI Machine Learning Repository,\" (2019). http:\/\/archive.ics.uci.edu\/ml"},{"key":"e_1_3_2_1_8_1","first-page":"513","volume-title":"discovering variable-length motifs in large-scale time series,\" Knowl Inf Syst 61","author":"Gao Y.","year":"2019","unstructured":"Gao, Y., Lin, J. HIME: \"discovering variable-length motifs in large-scale time series,\" Knowl Inf Syst 61, pp. 513--542 (2019)."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bty555"},{"key":"e_1_3_2_1_10_1","first-page":"1120","article-title":"An Adaptive Symbolic Approximation for Finding Higher-Level Structure in Time Series","author":"Imamura M.","year":"2021","unstructured":"Imamura, M. and Nakamura, T., \"An Adaptive Symbolic Approximation for Finding Higher-Level Structure in Time Series, \" IEEE ICDM, pp. 1120--1125 (2021).","journal-title":"IEEE ICDM"},{"key":"e_1_3_2_1_11_1","first-page":"857","article-title":"Parameter-free Spikelet: Discovering Different Length and Warped Time Series Motifs using an Adaptive Time Series Representation","author":"Imamura M.","year":"2023","unstructured":"Imamura, M. and Nakamura, T., \"Parameter-free Spikelet: Discovering Different Length and Warped Time Series Motifs using an Adaptive Time Series Representation,\" ACM SIGKDD, pp. 857--866 (2023).","journal-title":"ACM SIGKDD"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM58522.2023.00125"},{"key":"e_1_3_2_1_13_1","first-page":"1114","article-title":"Matrix Profile XXI: A Geometric Approach to Time Series Chains Improves Robustness","author":"Imamura M.","year":"2020","unstructured":"Imamura, M., Nakamura, T. and Keogh, E., \"Matrix Profile XXI: A Geometric Approach to Time Series Chains Improves Robustness, \" ACM SIGKDD, pp. 1114--1122 (2020).","journal-title":"ACM SIGKDD"},{"key":"e_1_3_2_1_14_1","first-page":"329","article-title":"Matrix Profile XVI: Time Series Semantic Motifs: A New Primitive for Finding Higher-Level Structure in Time Series","author":"Imani S.","year":"2019","unstructured":"Imani, S. and Keogh, E., \"Matrix Profile XVI: Time Series Semantic Motifs: A New Primitive for Finding Higher-Level Structure in Time Series,\" IEEE ICDM, pp. 329--338 (2019).","journal-title":"IEEE ICDM"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972719.1"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-004-0154-9"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2020.04.009"},{"key":"e_1_3_2_1_18_1","first-page":"1053","article-title":"Matrix Profile X: VALMOD - Scalable Discovery of Variable-Length Motifs in Data Series","author":"Linardi M.","year":"2018","unstructured":"Linardi, M., Zhu, Y., Palpanas, T., and Keogh, E., \"Matrix Profile X: VALMOD - Scalable Discovery of Variable-Length Motifs in Data Series,\" ACM SIGMOD, pp. 1053--1066 (2018).","journal-title":"ACM SIGMOD"},{"key":"e_1_3_2_1_19_1","volume-title":"Matrix Profile XXX: MADRID: A Hyper-Anytime Algorithm to Find Time Series Anomalies of all Lengths,\" IEEE ICDM","author":"Lu Y.","year":"2023","unstructured":"Lu, Y., Srinivas, T. V. A., Nakamura, T., Imamura, M., and Keogh, E., \"Matrix Profile XXX: MADRID: A Hyper-Anytime Algorithm to Find Time Series Anomalies of all Lengths,\" IEEE ICDM (2023)."},{"key":"e_1_3_2_1_20_1","first-page":"175","article-title":"Matrix Profile XX: Finding and Visualizing Time Series Motifs of All Lengths using the Matrix Profile","author":"Madrid F.","year":"2019","unstructured":"Madrid, F., et al., \"Matrix Profile XX: Finding and Visualizing Time Series Motifs of All Lengths using the Matrix Profile,\" IEEE ICBK, pp. 175--182 (2019).","journal-title":"IEEE ICBK"},{"key":"e_1_3_2_1_21_1","first-page":"1240","article-title":"Matrix Profile XXIII: Contrast Profile: A Novel Time Series Primitive that Allows Real World Classification","author":"Mercer R.","year":"2021","unstructured":"Mercer, R., Alaee, S., Abdoli, A. Singh, S., Murillo A., and Keogh, E. \"Matrix Profile XXIII: Contrast Profile: A Novel Time Series Primitive that Allows Real World Classification,\" IEEE ICDM, pp. 1240--1245 (2021).","journal-title":"IEEE ICDM"},{"key":"e_1_3_2_1_22_1","first-page":"547","article-title":"Enumeration of Time Series Motifs of All Lengths","author":"Mueen A.","year":"2013","unstructured":"Mueen, A., \"Enumeration of Time Series Motifs of All Lengths,\" IEEE ICDM, pp. 547--556 (2013).","journal-title":"IEEE ICDM"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2500489"},{"key":"e_1_3_2_1_24_1","first-page":"43","volume-title":"Dynamic programming algorithm optimization for spoken word recognition.\" IEEE transactions on acoustics, speech, and signal processing 26.1","author":"Sakoe H.","year":"1978","unstructured":"Sakoe, H. and Chiba, S., \"Dynamic programming algorithm optimization for spoken word recognition.\" IEEE transactions on acoustics, speech, and signal processing 26.1, pp. 43--49 (1978)."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Silva D.F. and G. E. A. P. A. Batista \"Elastic Time Series Motifs and Discords \" 2018 17th IEEE ICMLA pp. 237--242 (2018).","DOI":"10.1109\/ICMLA.2018.00042"},{"key":"e_1_3_2_1_26_1","series-title":"SIAM SDM","first-page":"522","volume-title":"A new framework and method to lower bound DTW,\"","author":"Tan C.","year":"2019","unstructured":"Tan, C., Petitjean, F. and Webb, G., \"A new framework and method to lower bound DTW,\". SIAM SDM, pp. 522--530 (2019)."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-017-0519-9"},{"key":"e_1_3_2_1_28_1","first-page":"1311","article-title":"Robust Time Series Chain Discovery with Incremental Nearest Neighbors","author":"Zhang L.","year":"2022","unstructured":"Zhang, L., Zhu, Y., Gao,Y. and Lin,J., \"Robust Time Series Chain Discovery with Incremental Nearest Neighbors,\" IEEE ICDM, pp. 1311--1316 (2022).","journal-title":"IEEE ICDM"},{"key":"e_1_3_2_1_29_1","first-page":"739","article-title":"Matrix Profile II: Exploiting a Novel Algorithm and GPUs to Break the One Hundred Million Barrier for Time Series Motifs and Joins","author":"Zhu Y.","year":"2016","unstructured":"Zhu, Y. et. al., \"Matrix Profile II: Exploiting a Novel Algorithm and GPUs to Break the One Hundred Million Barrier for Time Series Motifs and Joins,\" IEEE ICDM, pp. 739--748 (2016).","journal-title":"IEEE ICDM"},{"key":"e_1_3_2_1_30_1","unstructured":"https:\/\/sites.google.com\/view\/pevammotif"}],"event":{"name":"KDD '24: The 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Barcelona Spain","acronym":"KDD '24","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3637528.3671726","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3637528.3671726","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:06:01Z","timestamp":1750291561000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3637528.3671726"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,24]]},"references-count":30,"alternative-id":["10.1145\/3637528.3671726","10.1145\/3637528"],"URL":"https:\/\/doi.org\/10.1145\/3637528.3671726","relation":{},"subject":[],"published":{"date-parts":[[2024,8,24]]},"assertion":[{"value":"2024-08-24","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}