{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:24:09Z","timestamp":1743153849298,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030276140"},{"type":"electronic","value":"9783030276157"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-27615-7_6","type":"book-chapter","created":{"date-parts":[[2019,8,18]],"date-time":"2019-08-18T23:02:41Z","timestamp":1566169361000},"page":"79-94","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Discord Monitoring for Streaming Time-Series"],"prefix":"10.1007","author":[{"given":"Shinya","family":"Kato","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daichi","family":"Amagata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shunya","family":"Nishio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takahiro","family":"Hara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,3]]},"reference":[{"issue":"10","key":"6_CR1","first-page":"2249","volume":"29","author":"D Amagata","year":"2017","unstructured":"Amagata, D., Hara, T.: Mining top-k co-occurrence patterns across multiple streams. TKDE 29(10), 2249\u20132262 (2017)","journal-title":"TKDE"},{"issue":"2","key":"6_CR2","first-page":"149","volume":"8","author":"N Begum","year":"2014","unstructured":"Begum, N., Keogh, E.: Rare time series motif discovery from unbounded streams. PVLDB 8(2), 149\u2013160 (2014)","journal-title":"PVLDB"},{"doi-asserted-by":"crossref","unstructured":"Bu, Y., Leung, T.W., Fu, A.W.C., Keogh, E., Pei, J., Meshkin, S.: WAT: finding top-k discords in time series database. In: SDM, pp. 449\u2013454 (2007)","key":"6_CR3","DOI":"10.1137\/1.9781611972771.43"},{"unstructured":"Chen, Y., et al.: The UCR time series classification archive (2015). www.cs.ucr.edu\/~eamonn\/time_series_data\/","key":"6_CR4"},{"doi-asserted-by":"crossref","unstructured":"Chiu, B., Keogh, E., Lonardi, S.: Probabilistic discovery of time series motifs. In: KDD, pp. 493\u2013498 (2003)","key":"6_CR5","DOI":"10.1145\/956750.956808"},{"issue":"1","key":"6_CR6","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":"9","key":"6_CR7","first-page":"2250","volume":"26","author":"M Gupta","year":"2014","unstructured":"Gupta, M., Gao, J., Aggarwal, C.C., Han, J.: Outlier detection for temporal data: a survey. TKDE 26(9), 2250\u20132267 (2014)","journal-title":"TKDE"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-319-31750-2_19","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"T Huang","year":"2016","unstructured":"Huang, T., et al.: Parallel discord discovery. In: Bailey, J., Khan, L., Washio, T., Dobbie, G., Huang, J.Z., Wang, R. (eds.) PAKDD 2016. LNCS (LNAI), vol. 9652, pp. 233\u2013244. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-31750-2_19"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-319-98809-2_16","volume-title":"Database and Expert Systems Applications","author":"S Kato","year":"2018","unstructured":"Kato, S., Amagata, D., Nishio, S., Hara, T.: Monitoring range motif on streaming time-series. In: Hartmann, S., Ma, H., Hameurlain, A., Pernul, G., Wagner, R.R. (eds.) DEXA 2018. LNCS, vol. 11029, pp. 251\u2013266. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98809-2_16"},{"unstructured":"Keogh, E., Lin, J., Fu, A.: Hot sax: efficiently finding the most unusual time series subsequence. In: ICDM, pp. 226\u2013233 (2005)","key":"6_CR10"},{"issue":"1","key":"6_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10115-006-0034-6","volume":"11","author":"E Keogh","year":"2007","unstructured":"Keogh, E., Lin, J., Lee, S.H., Van Herle, H.: Finding the most unusual time series subsequence: algorithms and applications. Knowl. Inf. Syst. 11(1), 1\u201327 (2007)","journal-title":"Knowl. Inf. Syst."},{"doi-asserted-by":"crossref","unstructured":"Lam, H.T., Pham, N.D., Calders, T.: Online discovery of top-k similar motifs in time series data. In: SDM, pp. 1004\u20131015 (2011)","key":"6_CR12","DOI":"10.1137\/1.9781611972818.86"},{"issue":"3","key":"6_CR13","first-page":"181","volume":"10","author":"Y Li","year":"2016","unstructured":"Li, Y., Zou, L., Zhang, H., Zhao, D.: Computing longest increasing subsequences over sequential data streams. PVLDB 10(3), 181\u2013192 (2016)","journal-title":"PVLDB"},{"doi-asserted-by":"crossref","unstructured":"Li, Y., Yiu, M.L., Gong, Z., et al.: Quick-motif: an efficient and scalable framework for exact motif discovery. In: ICDE, pp. 579\u2013590 (2015)","key":"6_CR14","DOI":"10.1109\/ICDE.2015.7113316"},{"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: SIGMOD, pp. 1053\u20131066 (2018)","key":"6_CR15","DOI":"10.1145\/3183713.3183744"},{"unstructured":"Reiss, C., Wilkes, J., Hellerstein, J.L.: Google cluster-usage traces: format+ schema. Google Inc., White Paper, pp. 1\u201314 (2011)","key":"6_CR16"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-319-11988-5_19","volume-title":"Similarity Search and Applications","author":"H Sanchez","year":"2014","unstructured":"Sanchez, H., Bustos, B.: Anomaly detection in streaming time series based on bounding boxes. In: Traina, A.J.M., Traina, C., Cordeiro, R.L.F. (eds.) SISAP 2014. LNCS, vol. 8821, pp. 201\u2013213. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11988-5_19"},{"doi-asserted-by":"crossref","unstructured":"Teflioudi, C., Gemulla, R., Mykytiuk, O.: LEMP: fast retrieval of large entries in a matrix product. In: SIGMOD, pp. 107\u2013122 (2015)","key":"6_CR18","DOI":"10.1145\/2723372.2747647"},{"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: CIKM, pp. 1823\u20131832 (2016)","key":"6_CR19","DOI":"10.1145\/2983323.2983344"},{"doi-asserted-by":"crossref","unstructured":"Wei, L., Keogh, E., Xi, X.: Saxually explicit images: finding unusual shapes. In: ICDM, pp. 711\u2013720 (2006)","key":"6_CR20","DOI":"10.1109\/ICDM.2006.138"},{"issue":"2","key":"6_CR21","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/s10115-008-0131-9","volume":"17","author":"D Yankov","year":"2008","unstructured":"Yankov, D., Keogh, E., Rebbapragada, U.: Disk aware discord discovery: finding unusual time series in terabyte sized datasets. Knowl. Inf. Syst. 17(2), 241\u2013262 (2008)","journal-title":"Knowl. Inf. Syst."},{"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: ICDM, pp. 1317\u20131322 (2016)","key":"6_CR22","DOI":"10.1109\/ICDM.2016.0179"},{"issue":"10","key":"6_CR23","first-page":"1046","volume":"10","author":"A Zhang","year":"2017","unstructured":"Zhang, A., Song, S., Wang, J., Yu, P.S.: Time series data cleaning: from anomaly detection to anomaly repairing. PVLDB 10(10), 1046\u20131057 (2017)","journal-title":"PVLDB"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-27615-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T13:13:36Z","timestamp":1710249216000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-27615-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030276140","9783030276157"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-27615-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"3 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DEXA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database and Expert Systems Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Linz","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","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":"26 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dexa2019a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.dexa.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mixed (Single-blind and Double-blind)","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"ConfDriver","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"157","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":"32","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":"34","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":"20% - 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":"4-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":"3-4","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)"}}]}}