{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T15:25:21Z","timestamp":1772033121591,"version":"3.50.1"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030400132","type":"print"},{"value":"9783030400149","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-40014-9_5","type":"book-chapter","created":{"date-parts":[[2020,1,24]],"date-time":"2020-01-24T18:03:07Z","timestamp":1579888987000},"page":"95-118","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Implications of Z-Normalization in the Matrix Profile"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6661-8474","authenticated-orcid":false,"given":"Dieter","family":"De Paepe","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6215-6439","authenticated-orcid":false,"given":"Diego Nieves","family":"Avendano","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7865-6793","authenticated-orcid":false,"given":"Sofie","family":"Van Hoecke","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,25]]},"reference":[{"key":"5_CR1","unstructured":"Akbarinia, R., Cloez, B.: Efficient Matrix Profile Computation Using Different Distance Functions (2019). https:\/\/arxiv.org\/abs\/1901.05708"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00779-011-0415-z","volume":"16","author":"P Casale","year":"2012","unstructured":"Casale, P., Pujol, O., Radeva, P.: Personalization and user verification in wearable systems using biometric walking patterns. Pers. Ubiquit. Comput. 16, 1\u201318 (2012)","journal-title":"Pers. Ubiquit. Comput."},{"key":"5_CR3","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"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"De Paepe, D., Janssens, O., Van Hoecke, S.: Eliminating noise in the matrix profile. In: Proceedings of the 8th International Conference on Pattern Recognition Applications and Methods, pp. 83\u201393, February 2019","DOI":"10.5220\/0007314100830093"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"De Paepe, D., et al.: A generalized matrix profile framework with support for contextual series analysis. Eng. Appl. Artif. Intell. (2019, accepted)","DOI":"10.1016\/j.engappai.2020.103487"},{"key":"5_CR6","unstructured":"Silva, D.F., Batista, G.E.: Elastic time series motifs and discords. In: 17th IEEE International Conference on Machine Learning and Applications (ICMLA), pp. 237\u2013242 (2018)"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Gharghabi, S., Ding, Y., Yeh, C.C.M., Kamgar, K., Ulanova, L., Keogh, E.: Matrix profile VIII: domain agnostic online semantic segmentation at superhuman performance levels. In: 2017 IEEE International Conference on Data Mining (ICDM), pp. 117\u2013126. IEEE, November 2017","DOI":"10.1109\/ICDM.2017.21"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Gharghabi, S., Imani, S., Bagnall, A., Darvishzadeh, A., Keogh, E.: MPdist: a novel time series distance measure to allow data mining in more challenging scenarios. In: IEEE International Conference on Data Mining (ICDM), pp. 965\u2013970 (2018)","DOI":"10.1109\/ICDM.2018.00119"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Imani, S., Madrid, F., Ding, W., Crouter, S., Keogh, E.: Time series snippets: a new primitive for time series data mining. In: IEEE International Conference on Big Knowledge (ICBK), pp. 382\u2013389. IEEE (2018)","DOI":"10.1109\/ICBK.2018.00058"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Keogh, E., Kasetty, S.: On the need for time series data mining benchmarks. In: Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, p. 102 (2002)","DOI":"10.1145\/775047.775062"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Lavin, A., Ahmad, S.: Evaluating real-time anomaly detection algorithms - the numenta anomaly benchmark. In: IEEE 14th International Conference on Machine Learning and Applications (ICMLA), pp. 38\u201344, December 2015","DOI":"10.1109\/ICMLA.2015.141"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Linardi, M., Zhu, Y., Palpanas, T., Keogh, E.: Matrix profile X. In: Proceedings of the 2018 International Conference on Management of Data (SIGMOD), pp. 1053\u20131066 (2018)","DOI":"10.1145\/3183713.3183744"},{"key":"5_CR13","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 SIAM International Conference on Data Mining (2009)","DOI":"10.1137\/1.9781611972795.41"},{"key":"5_CR14","unstructured":"Mueen, A., Viswanathan, K., Gupta, C., Keogh, E.: The fastest similarity search algorithm for time series subsequences under euclidean distance (2015)"},{"key":"5_CR15","unstructured":"Papadimitriou, S., Faloutsos, C.: Streaming pattern discovery in multiple time-series. In: International Conference on Very Large Data Bases (VLDB), pp. 697\u2013708 (2005)"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Rafiei, D.: On similarity-based queries for time series data. In: Proceedings 15th International Conference on Data Engineering, pp. 410\u2013417. IEEE (1999)","DOI":"10.1109\/ICDE.1999.754957"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Reiss, A., Stricker, D.: Introducing a new benchmarked dataset for activity monitoring. In: International Symposium on Wearable Computers, pp. 108\u2013109 (2012)","DOI":"10.1109\/ISWC.2012.13"},{"issue":"1","key":"5_CR18","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1145\/3147.3165","volume":"11","author":"JS Vitter","year":"1985","unstructured":"Vitter, J.S.: Random sampling with a reservoir. ACM Trans. Math. Softw. (TOMS) 11(1), 37\u201357 (1985)","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Wang, X., Lin, J., Patel, N., Braun, M.: A self-learning and online algorithm for time series anomaly detection, with application in CPU manufacturing. In: Proceedings of the 25th ACM International on Conference on Information and Knowledge Management - CIKM 2016, pp. 1823\u20131832. ACM Press, New York (2016)","DOI":"10.1145\/2983323.2983344"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Yeh, C.C.M., Kavantzas, N., Keogh, E.: Meaningful multidimensional motif discovery. In: IEEE International Conference on Data Mining (ICDM), pp. 565\u2013574. IEEE (2017)","DOI":"10.1109\/ICDM.2017.66"},{"issue":"12","key":"5_CR21","doi-asserted-by":"publisher","first-page":"1802","DOI":"10.14778\/3137765.3137784","volume":"10","author":"CCM Yeh","year":"2017","unstructured":"Yeh, C.C.M., Kavantzas, N., Keogh, E.: Using weakly labeled time series to predict outcomes. Proc. VLDB Endow. 10(12), 1802\u20131812 (2017)","journal-title":"Proc. VLDB Endow."},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Yeh, C.C.M., Van Herle, H., Keogh, E.: The matrix profile allows visualization of salient subsequences in massive time series. In: Proceedings of the IEEE International Conference on Data Mining, ICDM, pp. 579\u2013588 (2017)","DOI":"10.1109\/ICDM.2016.0069"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Yeh, C.C.M., et al.: All pairs similarity joins for time series: a unifying view that includes motifs, discords and shapelets. In: IEEE 16th International Conference on Data Mining (ICDM), pp. 1317\u20131322 (2016)","DOI":"10.1109\/ICDM.2016.0179"},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Zhu, Y., Imamura, M., Nikovski, D., Keogh, E.: Time series chains: a new primitive for time series data mining. In: IEEE International Conference on Data Mining (ICDM), pp. 695\u2013704 (2017)","DOI":"10.1109\/ICDM.2017.79"},{"key":"5_CR25","unstructured":"Zhu, Y., Mueen, A., Keogh, E.: Admissible Time Series Motif Discovery with Missing Data (2018). https:\/\/arxiv.org\/pdf\/1802.05472.pdf"},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"Zhu, Y., Yeh, C.C.M., Zimmerman, Z., Kamgar, K., Keogh, E.: SCRIMP++: time series motif discovery at interactive speeds. In: IEEE International Conference on Data Mining (ICDM), pp. 837\u2013846 (2018)","DOI":"10.1109\/ICDM.2018.00099"},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"Zhu, Y., et al.: 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 (2016)","DOI":"10.1109\/ICDM.2016.0085"}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition Applications and Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-40014-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,24]],"date-time":"2024-01-24T14:26:11Z","timestamp":1706106371000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-40014-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030400132","9783030400149"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-40014-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"25 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICPRAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Pattern Recognition Applications and Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 February 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 February 2019","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":"icpram2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.icpram.org\/?y=2019","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":"Primoris","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"138","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":"25","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":"52","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":"18% - 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":"3","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":"3","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}