{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:11:32Z","timestamp":1743149492527,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031098499"},{"type":"electronic","value":"9783031098505"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-09850-5_17","type":"book-chapter","created":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T23:02:48Z","timestamp":1656284568000},"page":"251-266","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Computation of\u00a0All-Window Length Correlations"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0339-5322","authenticated-orcid":false,"given":"Adam","family":"Charane","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2783-0218","authenticated-orcid":false,"given":"Matteo","family":"Ceccarello","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7621-967X","authenticated-orcid":false,"given":"Anton","family":"Dign\u00f6s","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7128-507X","authenticated-orcid":false,"given":"Johann","family":"Gamper","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,27]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","unstructured":"Alseghayer, R., Petrov, D., Chrysanthis, P.K., Sharaf, M., Labrinidis, A.: Detection of highly correlated live data streams. In: Proceedings of the International Workshop on Real-Time Business Intelligence and Analytics, BIRTE 2017. Association for Computing Machinery, New York (2017). https:\/\/doi.org\/10.1145\/3129292.3129298","DOI":"10.1145\/3129292.3129298"},{"issue":"1","key":"17_CR2","doi-asserted-by":"publisher","first-page":"1","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), 1\u201334 (2012). https:\/\/doi.org\/10.1145\/2379776.2379788","journal-title":"ACM Comput. Surv."},{"issue":"1","key":"17_CR3","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/j.engappai.2010.09.007","volume":"24","author":"TC Fu","year":"2011","unstructured":"Fu, T.C.: A review on time series data mining. Eng. Appl. Artif. Intell. 24(1), 164\u2013181 (2011). https:\/\/doi.org\/10.1016\/j.engappai.2010.09.007","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"3","key":"17_CR4","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/pl00011669","volume":"3","author":"E Keogh","year":"2001","unstructured":"Keogh, E., Chakrabarti, K., Pazzani, M., Mehrotra, S.: Dimensionality reduction for fast similarity search in large time series databases. Knowl. Inf. Syst. 3(3), 263\u2013286 (2001). https:\/\/doi.org\/10.1007\/pl00011669","journal-title":"Knowl. Inf. Syst."},{"key":"17_CR5","doi-asserted-by":"publisher","unstructured":"Keogh, E., Lin, J., Fu, A.: Hot sax: efficiently finding the most unusual time series subsequence. In: Proceedings of the Fifth IEEE International Conference on Data Mining, ICDM 2005, pp. 226\u2013233. IEEE Computer Society, USA (2005). https:\/\/doi.org\/10.1109\/ICDM.2005.79","DOI":"10.1109\/ICDM.2005.79"},{"key":"17_CR6","doi-asserted-by":"publisher","unstructured":"Li, Y., U, L.H., Yiu, M.L., Gong, Z.: Discovering longest-lasting correlation in sequence databases. Proc. VLDB Endow. 6(14), 1666\u20131677 (2013). https:\/\/doi.org\/10.14778\/2556549.2556552","DOI":"10.14778\/2556549.2556552"},{"key":"17_CR7","unstructured":"Papadimitriou, S., Sun, J., Faloutsos, C.: Streaming pattern discovery in multiple time-series. In: Proceedings of the 31st International Conference on Very Large Data Bases, VLDB 2005, pp. 697\u2013708. VLDB Endowment (2005)"},{"key":"17_CR8","doi-asserted-by":"publisher","unstructured":"Patel, P., Keogh, E.J., Lin, J., Lonardi, S.: Mining motifs in massive time series databases. In: Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM 2002), 9\u201312 December 2002, Maebashi City, Japan, pp. 370\u2013377. IEEE Computer Society (2002). https:\/\/doi.org\/10.1109\/ICDM.2002.1183925","DOI":"10.1109\/ICDM.2002.1183925"},{"key":"17_CR9","doi-asserted-by":"publisher","unstructured":"Rong, K., Bailis, P.: ASAP: prioritizing attention via time series smoothing. Proc. VLDB Endow. 10(11), 1358\u20131369 (2017). https:\/\/doi.org\/10.14778\/3137628.3137645","DOI":"10.14778\/3137628.3137645"},{"key":"17_CR10","doi-asserted-by":"publisher","unstructured":"Sakurai, Y., Papadimitriou, S., Faloutsos, C.: Braid: stream mining through group lag correlations. In: Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data, SIGMOD 2005, pp. 599\u2013610. Association for Computing Machinery, New York (2005). https:\/\/doi.org\/10.1145\/1066157.1066226","DOI":"10.1145\/1066157.1066226"},{"key":"17_CR11","doi-asserted-by":"publisher","unstructured":"Sobel, J., Bertram, N., Ding, C., Nargesian, F., Gildea, D.: AWLCO: all-window length co-occurrence. In: 32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021). Leibniz International Proceedings in Informatics (LIPIcs), vol. 191, pp. 24:1\u201324:21. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2021). https:\/\/doi.org\/10.4230\/LIPIcs.CPM.2021.24. https:\/\/drops.dagstuhl.de\/opus\/volltexte\/2021\/13975","DOI":"10.4230\/LIPIcs.CPM.2021.24"},{"key":"17_CR12","doi-asserted-by":"publisher","unstructured":"Ye, L., Keogh, E.: Time series shapelets: a new primitive for data mining. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2009, pp. 947\u2013956. Association for Computing Machinery, New York (2009). https:\/\/doi.org\/10.1145\/1557019.1557122","DOI":"10.1145\/1557019.1557122"},{"key":"17_CR13","doi-asserted-by":"publisher","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 (2016). https:\/\/doi.org\/10.1109\/ICDM.2016.0179","DOI":"10.1109\/ICDM.2016.0179"}],"container-title":["Communications in Computer and Information Science","Digital Business and Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-09850-5_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T17:42:22Z","timestamp":1709833342000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-09850-5_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031098499","9783031098505"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-09850-5_17","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"27 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Baltic DB&IS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Baltic Conference on Digital Business and Intelligent Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Riga","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latvia","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":"4 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dbis2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dbis2022.lu.lv\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"42","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":"16","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":"1","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":"3,5","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,8","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)"}}]}}