{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T04:42:25Z","timestamp":1769920945302,"version":"3.49.0"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031258909","type":"print"},{"value":"9783031258916","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-25891-6_24","type":"book-chapter","created":{"date-parts":[[2023,3,9]],"date-time":"2023-03-09T14:03:34Z","timestamp":1678370614000},"page":"314-325","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Normalization in Motif Discovery"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0625-9991","authenticated-orcid":false,"given":"Frederique","family":"van Leeuwen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8654-3134","authenticated-orcid":false,"given":"Bas","family":"Bosma","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0480-4893","authenticated-orcid":false,"given":"Arjan van","family":"den Born","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9627-1523","authenticated-orcid":false,"given":"Eric","family":"Postma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,3,10]]},"reference":[{"issue":"6","key":"24_CR1","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.1109\/jas.2019.1911747","volume":"6","author":"HA Dau","year":"2019","unstructured":"Dau, H.A., et al.: The UCR time series archive. IEEE\/CAA J. Autom. Sin. 6(6), 1293\u20131305 (2019). https:\/\/doi.org\/10.1109\/jas.2019.1911747","journal-title":"IEEE\/CAA J. Autom. Sin."},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Dau, H.A., Keogh, E.: 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 (2017)","DOI":"10.1145\/3097983.3097993"},{"issue":"1","key":"24_CR3","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1145\/2379776.2379788","volume":"45","author":"P Esling","year":"2012","unstructured":"Esling, P., Agon, C.: Time-series data mining. ACM Comput. Surv. 45(1), 12 (2012)","journal-title":"ACM Comput. Surv."},{"issue":"4","key":"24_CR4","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1007\/s10618-019-00619-1","volume":"33","author":"H Ismail Fawaz","year":"2019","unstructured":"Ismail Fawaz, H., Forestier, G., Weber, J., Idoumghar, L., Muller, P.-A.: Deep learning for time series classification: a review. Data Min. Knowl. Disc. 33(4), 917\u2013963 (2019). https:\/\/doi.org\/10.1007\/s10618-019-00619-1","journal-title":"Data Min. Knowl. Disc."},{"issue":"1","key":"24_CR5","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/s10115-018-1279-6","volume":"61","author":"Y Gao","year":"2018","unstructured":"Gao, Y., Lin, J.: HIME: discovering variable-length motifs in large-scale time series. Knowl. Inf. Syst. 61(1), 513\u2013542 (2018). https:\/\/doi.org\/10.1007\/s10115-018-1279-6","journal-title":"Knowl. Inf. Syst."},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Gao, Y., Lin, J., Rangwala, H.: Iterative grammar-based framework for discovering variable-length time series motifs. In: 2017 IEEE International Conference on Data Mining (ICDM), pp. 111\u2013116. IEEE (2017)","DOI":"10.1109\/ICDM.2017.20"},{"issue":"4","key":"24_CR7","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1023\/A:1024988512476","volume":"7","author":"E Keogh","year":"2003","unstructured":"Keogh, E., Kasetty, S.: On the need for time series data mining benchmarks: a survey and empirical demonstration. Data Min. Knowl. Disc. 7(4), 349\u2013371 (2003)","journal-title":"Data Min. Knowl. Disc."},{"key":"24_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1007\/978-3-030-74251-5_33","volume-title":"Advances in Intelligent Data Analysis XIX","author":"F van Leeuwen","year":"2021","unstructured":"van Leeuwen, F., Bosma, B., van den Born, A., Postma, E.: RTL: a robust time series labeling algorithm. In: Abreu, P.H., Rodrigues, P.P., Fern\u00e1ndez, A., Gama, J. (eds.) IDA 2021. LNCS, vol. 12695, pp. 414\u2013425. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-74251-5_33"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Lin, J., Keogh, E., Lonardi, S., Chiu, B.: A symbolic representation of time series, with implications for streaming algorithms. In: Proceedings of the 8th ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, pp. 2\u201311 (2003)","DOI":"10.1145\/882082.882086"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Linardi, M., Zhu, Y., Palpanas, T., Keogh, E.: 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 (2018)","DOI":"10.1145\/3183713.3183744"},{"key":"24_CR11","doi-asserted-by":"publisher","unstructured":"Madrid, F., Singh, S., Chesnais, Q., Mauck, K., Keogh, E.: Matrix profile XVI: efficient and effective labeling of massive time series archives. In: 2019 IEEE International Conference on Data Science and Advanced Analytics (DSAA), pp. 463\u2013472 (2019). https:\/\/doi.org\/10.1109\/DSAA.2019.00061","DOI":"10.1109\/DSAA.2019.00061"},{"key":"24_CR12","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-319-05458-2_3","volume-title":"Intelligent Information and Database Systems","author":"Y Mohammad","year":"2014","unstructured":"Mohammad, Y., Nishida, T.: Exact discovery of length-range motifs. In: Nguyen, N.T., Attachoo, B., Trawi\u0144ski, B., Somboonviwat, K. (eds.) ACIIDS 2014. LNCS (LNAI), vol. 8398, pp. 23\u201332. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-05458-2_3"},{"issue":"1","key":"24_CR13","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s10115-014-0793-4","volume":"45","author":"A Mueen","year":"2015","unstructured":"Mueen, A., Chavoshi, N.: Enumeration of time series motifs of all lengths. Knowl. Inf. Syst. 45(1), 105\u2013132 (2015)","journal-title":"Knowl. Inf. Syst."},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"Mueen, A., Keogh, E.: Online discovery and maintenance of time series motifs. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1089\u20131098 (2010)","DOI":"10.1145\/1835804.1835941"},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"Mueen, A., Keogh, E., Zhu, Q., Cash, S., Westover, B.: Exact discovery of time series motifs. In: Proceedings of the 2009 SIAM International Conference on Data Mining, pp. 473\u2013484. SIAM (2009)","DOI":"10.1137\/1.9781611972795.41"},{"key":"24_CR16","unstructured":"Patel, P., Keogh, E., Lin, J., Lonardi, S.: Mining motifs in massive time series databases. In: 2002 IEEE International Conference on Data Mining, 2002. Proceedings, pp. 370\u2013377. IEEE (2002)"},{"key":"24_CR17","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1007\/978-3-662-44845-8_37","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"P Senin","year":"2014","unstructured":"Senin, P., et al.: GrammarViz 2.0: a tool for grammar-based pattern discovery in time series. In: Calders, T., Esposito, F., H\u00fcllermeier, E., Meo, R. (eds.) ECML PKDD 2014. LNCS (LNAI), vol. 8726, pp. 468\u2013472. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44845-8_37"},{"issue":"3","key":"24_CR18","doi-asserted-by":"publisher","first-page":"742","DOI":"10.1007\/s10618-020-00679-8","volume":"34","author":"A Shifaz","year":"2020","unstructured":"Shifaz, A., Pelletier, C., Petitjean, F., Webb, G.I.: TS-CHIEF: a scalable and accurate forest algorithm for time series classification. Data Min. Knowl. Disc. 34(3), 742\u2013775 (2020)","journal-title":"Data Min. Knowl. Disc."},{"key":"24_CR19","unstructured":"Wang, X., et al.: RPM: representative pattern mining for efficient time series classification. In: EDBT, pp. 185\u2013196 (2016)"},{"key":"24_CR20","doi-asserted-by":"crossref","unstructured":"Yeh, C.C.M., et al.: 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), pp. 1317\u20131322. IEEE (2016)","DOI":"10.1109\/ICDM.2016.0179"},{"key":"24_CR21","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-319-06538-0_8","volume-title":"Recent Advances in Information and Communication Technology","author":"MS Yin","year":"2014","unstructured":"Yin, M.S., Tangsripairoj, S., Pupacdi, B.: Variable length motif-based time series classification. In: Boonkrong, S., Unger, H., Meesad, P. (eds.) Recent Advances in Information and Communication Technology. AISC, vol. 265, pp. 73\u201382. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-06538-0_8"},{"key":"24_CR22","doi-asserted-by":"crossref","unstructured":"Yingchareonthawornchai, S., Sivaraks, H., Rakthanmanon, T., Ratanamahatana, C.A.: Efficient proper length time series motif discovery. In: 2013 IEEE 13th International Conference on Data Mining, pp. 1265\u20131270. IEEE (2013)","DOI":"10.1109\/ICDM.2013.111"},{"key":"24_CR23","doi-asserted-by":"crossref","unstructured":"Zhu, Y., Yeh, C.C.M., Zimmerman, Z., Kamgar, K., Keogh, E.: Matrix profile XI: SCRIMP++: time series motif discovery at interactive speeds. In: 2018 IEEE International Conference on Data Mining (ICDM), pp. 837\u2013846. IEEE (2018)","DOI":"10.1109\/ICDM.2018.00099"}],"container-title":["Lecture Notes in Computer Science","Machine Learning, Optimization, and Data Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-25891-6_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,5]],"date-time":"2023-04-05T10:19:40Z","timestamp":1680689980000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-25891-6_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031258909","9783031258916"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-25891-6_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"10 March 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LOD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Machine Learning, Optimization, and Data Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Certosa di Pontignano","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lod2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lod2022.icas.cc\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"226","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"85","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5.6","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1.5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}