{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T16:51:01Z","timestamp":1759683061806,"version":"3.37.3"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2022,1,11]],"date-time":"2022-01-11T00:00:00Z","timestamp":1641859200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,11]],"date-time":"2022-01-11T00:00:00Z","timestamp":1641859200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002954","name":"Universit\u00e0 degli Studi di Milano-Bicocca","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002954","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1007\/s10489-021-02897-z","type":"journal-article","created":{"date-parts":[[2022,1,11]],"date-time":"2022-01-11T00:03:06Z","timestamp":1641859386000},"page":"10060-10081","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A fast algorithm for complex discord searches in time series: HOT SAX Time"],"prefix":"10.1007","volume":"52","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5170-4479","authenticated-orcid":false,"given":"Paolo","family":"Avogadro","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8481-6311","authenticated-orcid":false,"given":"Matteo Alessandro","family":"Dominoni","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,11]]},"reference":[{"key":"2897_CR1","doi-asserted-by":"publisher","unstructured":"Avogadro P, Dominoni MA (2020) An approximate high quality nearest neighbor distance profile. In: Communications in Computer and Information Science, Springer International Publishing, pp 158\u2013182. https:\/\/doi.org\/10.1007\/978-3-030-66196-0_8","DOI":"10.1007\/978-3-030-66196-0_8"},{"key":"2897_CR2","doi-asserted-by":"publisher","unstructured":"Avogadro P, Palonca L, Dominoni MA (2020) Online anomaly search in time series: significant online discords. Knowledge and Information Systems. https:\/\/doi.org\/10.1007\/s10115-020-01453-4","DOI":"10.1007\/s10115-020-01453-4"},{"key":"2897_CR3","unstructured":"Benchmarksgame-team (2020) The computer language benchmarks game. https:\/\/benchmarksgame-team.pages.debian.net\/benchmarksgame\/"},{"key":"2897_CR4","doi-asserted-by":"crossref","unstructured":"Bu Y, Leung T W, Fu A W C, Keogh E, Pei J, Meshkin S (2007) Wat: Finding Top-k discords in time series database. In: Proceedings of the 2007 SIAM International Conference on Data Mining","DOI":"10.1137\/1.9781611972771.43"},{"key":"2897_CR5","doi-asserted-by":"publisher","unstructured":"Buu HTQ, Anh DT (2011) Time series discord discovery based on isax symbolic representation. In: 2011 Third International Conference on Knowledge and Systems Engineering, pp 11\u201318. https:\/\/doi.org\/10.1109\/KSE.2011.11","DOI":"10.1109\/KSE.2011.11"},{"key":"2897_CR6","doi-asserted-by":"publisher","unstructured":"Chandola V, Banerjee A, Kumar V (2009) Anomaly detection: a survey. ACM Comput Surv 41(3):15:1\u201315:58. https:\/\/doi.org\/10.1145\/1541880.1541882","DOI":"10.1145\/1541880.1541882"},{"key":"2897_CR7","doi-asserted-by":"publisher","unstructured":"Chau PM, Duc BM, Anh DT (2018) Discord discovery in streaming time series based on an improved HOT SAX algorithm. In: Proceedings of the Ninth International Symposium on Information and Communication Technology - SoICT 2018, ACM Press. https:\/\/doi.org\/10.1145\/3287921.3287929","DOI":"10.1145\/3287921.3287929"},{"issue":"5","key":"2897_CR8","doi-asserted-by":"publisher","first-page":"1200","DOI":"10.1007\/s10618-018-0570-1","volume":"32","author":"Y Gao","year":"2018","unstructured":"Gao Y, Lin J (2018) Exploring variable-length time series motifs in one hundred million length scale. Data Min Knowl Disc 32(5):1200\u20131228. https:\/\/doi.org\/10.1007\/s10618-018-0570-1","journal-title":"Data Min Knowl Disc"},{"key":"2897_CR9","doi-asserted-by":"publisher","unstructured":"Goldberger AL, Amaral LAN, Glass L, Hausdorff JM, Ivanov PC, Mark RG, Mietus JE, Moody GB, Peng CK, Stanley HE (2000) PhysioBank, PhysioToolkit, and PhysioNet: Components of a new research resource for complex physiologic signals. Circulation 101(23):e215\u2013e220. circulation Electronic Pages: http:\/\/circ.ahajournals.org\/content\/101\/23\/e215.fullPMID:1085218; https:\/\/doi.org\/10.1161\/01.CIR.101.23.e215","DOI":"10.1161\/01.CIR.101.23.e215"},{"issue":"9","key":"2897_CR10","doi-asserted-by":"publisher","first-page":"2250","DOI":"10.1109\/TKDE.2013.184","volume":"26","author":"M Gupta","year":"2014","unstructured":"Gupta M, Gao J, Aggarwal C, Han J (2014) Outlier detection for temporal data: a survey. IEEE Trans Knowl Data Eng 26(9):2250\u20132267. https:\/\/doi.org\/10.1109\/TKDE.2013.184","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2897_CR11","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/j.ins.2018.10.047","volume":"477","author":"M Hu","year":"2019","unstructured":"Hu M, Feng X, Ji Z, Yan K, Zhou S (2019) A novel computational approach for discord search with local recurrence rates in multivariate time series. Inf Sci 477:220\u2013233. https:\/\/doi.org\/10.1016\/j.ins.2018.10.047","journal-title":"Inf Sci"},{"key":"2897_CR12","doi-asserted-by":"publisher","unstructured":"Keogh E, Kasetty S (2003) On the need for time series data mining benchmarks: A survey and empirical demonstration. Data Min Knowl Discov 7(4):349\u2013371. https:\/\/doi.org\/10.1023\/A:1024988512476","DOI":"10.1023\/A:1024988512476"},{"key":"2897_CR13","doi-asserted-by":"crossref","unstructured":"Keogh E, Lin J, Fu A (2005) Hot sax: efficiently finding the most unusual time series subsequence. In: Proceedings of the Fifth IEEE International Conference on Data Mining (ICDM\u201905), pp 226\u2013233","DOI":"10.1109\/ICDM.2005.79"},{"key":"2897_CR14","doi-asserted-by":"publisher","unstructured":"Khanh N D K, Anh D T (2012) Time series discord discovery using WAT algorithm and iSAX representation. In: Proceedings of the Third Symposium on Information and Communication Technology - SoICT. ACM Press. https:\/\/doi.org\/10.1145\/2350716.2350748","DOI":"10.1145\/2350716.2350748"},{"key":"2897_CR15","doi-asserted-by":"publisher","unstructured":"Lin J, Keogh E, Lonardi S, Chiu B (2003) 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, DMKD \u201903. ACM, New York, pp 2\u201311. https:\/\/doi.org\/10.1145\/882082.882086","DOI":"10.1145\/882082.882086"},{"issue":"3","key":"2897_CR16","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1109\/51.932724","volume":"20","author":"GB Moody","year":"2001","unstructured":"Moody GB, Mark RG (2001) The impact of the mit-bih arrhythmia database. IEEE Eng Med Biol Mag 20(3):45\u201350. https:\/\/doi.org\/10.1109\/51.932724","journal-title":"IEEE Eng Med Biol Mag"},{"key":"2897_CR17","doi-asserted-by":"crossref","unstructured":"Nakamura T, Imamura M, Mercer R, Keogh E J (2020) (2020) Merlin: Parameter-Free discovery of arbitrary length anomalies in massive time series archives. In: ICDM","DOI":"10.1109\/ICDM50108.2020.00147"},{"key":"2897_CR18","unstructured":"SCAMP (2020) Matrix profile on github. https:\/\/github.com\/zpzim\/SCAMP"},{"key":"2897_CR19","unstructured":"Senin P (2019) Grammarviz 3.0. https:\/\/github.com\/GrammarViz2\/grammarviz2_src\/https:\/\/github.com\/GrammarViz2\/grammarviz2_src\/"},{"key":"2897_CR20","doi-asserted-by":"crossref","unstructured":"Senin P, Lin J, Wang X, Oates T, Gandhi S, Boedihardjo A P, Chen C, Frankenstein S, Lerner M (2014) Grammarviz 2.0: a tool for grammar-based pattern discovery in time series. In: Calders T, Esposito F, H\u00fcllermeier E, Meo R (eds) Machine Learning and Knowledge Discovery in Databases. Springer, Berlin, pp 468\u2013 472","DOI":"10.1007\/978-3-662-44845-8_37"},{"key":"2897_CR21","unstructured":"Senin P, Lin J, Wang XTO, Gandhi S, Boedihardjo A, Chen C, Frankenstein S, Lerner M (2015) Time series anomaly discovery with grammar-based compression. In: The International Conference on Extending Database Technology. EDBT 15, pp 276\u2013281"},{"key":"2897_CR22","doi-asserted-by":"publisher","unstructured":"Senin P, Lin J, Wang X, Oates T, Gandhi S, Boedihardjo A P, Chen C, Frankenstein S (2018) Grammarviz 3.0: Interactive discovery of variable-length time series patterns. ACM Trans Knowl Discov Data 12(1):10:1\u201310:28. https:\/\/doi.org\/10.1145\/3051126","DOI":"10.1145\/3051126"},{"key":"2897_CR23","doi-asserted-by":"publisher","unstructured":"Shieh J, Keogh E (2008) isax: Indexing and mining terabyte sized time series. In: Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, New York, NY, USA, KDD \u201908, pp 623\u2013631, https:\/\/doi.org\/10.1145\/1401890.1401966","DOI":"10.1145\/1401890.1401966"},{"key":"2897_CR24","doi-asserted-by":"publisher","unstructured":"Son NT (2020) An improvement of disk aware discord discovery algorithm for discovering time series discord. In: 2020 5th International Conference on Green Technology and Sustainable Development (GTSD). IEEE, https:\/\/doi.org\/10.1109\/gtsd50082.2020.9303111","DOI":"10.1109\/gtsd50082.2020.9303111"},{"issue":"19","key":"2897_CR25","doi-asserted-by":"publisher","first-page":"6980","DOI":"10.3390\/app10196980","volume":"10","author":"K Song","year":"2020","unstructured":"Song K, Ryu M, Lee K (2020) Transitional SAX representation for knowledge discovery for time series. Appl Sci 10(19):6980. https:\/\/doi.org\/10.3390\/app10196980","journal-title":"Appl Sci"},{"key":"2897_CR26","doi-asserted-by":"publisher","unstructured":"Thuy HTT, Anh DT, Chau VTN (2018) A novel method for time series anomaly detection based on segmentation and clustering. In: 2018 10th International Conference on Knowledge and Systems Engineering (KSE), pp 276\u2013281. https:\/\/doi.org\/10.1109\/KSE.2018.8573409","DOI":"10.1109\/KSE.2018.8573409"},{"key":"2897_CR27","doi-asserted-by":"publisher","unstructured":"Wang L, Lu F, Cui M, Bao Y (2019) Survey of methods for time series symbolic aggregate approximation. In: Communications in Computer and Information Science, Springer Singapore, pp 645\u2013657. https:\/\/doi.org\/10.1007\/978-981-15-0118-0_50","DOI":"10.1007\/978-981-15-0118-0_50"},{"issue":"11","key":"2897_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pcbi.1005158","volume":"12","author":"DS Willett","year":"2016","unstructured":"Willett D S, George J, Willett N S, Stelinski L L, Lapointe S L (2016) Machine learning for characterization of insect vector feeding. PLOS Comput Biol 12(11):1\u201314. https:\/\/doi.org\/10.1371\/journal.pcbi.1005158","journal-title":"PLOS Comput Biol"},{"key":"2897_CR29","doi-asserted-by":"publisher","first-page":"1783","DOI":"10.1016\/j.promfg.2020.01.261","volume":"39","author":"CL Yang","year":"2019","unstructured":"Yang C L, Darwin F, Sutrisno H (2019) Local recurrence rates with automatic time windows for discord search in multivariate time series. Procedia Manuf 39:1783\u20131792. https:\/\/doi.org\/10.1016\/j.promfg.2020.01.261","journal-title":"Procedia Manuf"},{"key":"2897_CR30","doi-asserted-by":"publisher","unstructured":"Yankov D, Keogh E, Rebbapragada U (2008) Disk aware discord discovery: finding unusual time series in terabyte sized datasets. Knowl Inf Syst 17:241\u2013262. https:\/\/doi.org\/10.1007\/s10115-008-0131-9","DOI":"10.1007\/s10115-008-0131-9"},{"key":"2897_CR31","doi-asserted-by":"publisher","unstructured":"Yeh CM, Zhu Y, Ulanova L, Begum N, Ding Y, Dau HA, Silva DF, Mueen A, Keogh E (2016) 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. https:\/\/doi.org\/10.1109\/ICDM.2016.0179","DOI":"10.1109\/ICDM.2016.0179"},{"issue":"8","key":"2897_CR32","doi-asserted-by":"publisher","first-page":"1987","DOI":"10.1109\/TPDS.2021.3055765","volume":"32","author":"B Zhu","year":"2021","unstructured":"Zhu B, Jiang Y, Gu M, Deng Y (2021) A GPU acceleration framework for motif and discord based pattern mining. IEEE Trans Parallel Distrib Syst 32(8):1987\u20132004. https:\/\/doi.org\/10.1109\/tpds.2021.3055765","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"2897_CR33","doi-asserted-by":"publisher","unstructured":"Zhu Y, Zimmerman Z, Senobari NS, Yeh CM, Funning G, Mueen A, Brisk P, Keogh E (2016) Matrix profile ii: 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. https:\/\/doi.org\/10.1109\/ICDM.2016.0085","DOI":"10.1109\/ICDM.2016.0085"},{"key":"2897_CR34","doi-asserted-by":"publisher","unstructured":"Zhu Y, Yeh CM, Zimmerman Z, Kamgar K, Keogh E (2018) Matrix profile xi: Scrimp++: Time series motif discovery at interactive speeds. In: 2018 IEEE International Conference on Data Mining (ICDM), pp 837\u2013846. https:\/\/doi.org\/10.1109\/ICDM.2018.00099","DOI":"10.1109\/ICDM.2018.00099"},{"issue":"1","key":"2897_CR35","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s10115-017-1138-x","volume":"54","author":"Y Zhu","year":"2018","unstructured":"Zhu Y, Zimmerman Z, Shakibay Senobari N, Yeh C C M, Funning G, Mueen A, Brisk P, Keogh E (2018) Exploiting a novel algorithm and gpus to break the ten quadrillion pairwise comparisons barrier for time series motifs and joins. Knowl Inf Syst 54(1):203\u2013236. https:\/\/doi.org\/10.1007\/s10115-017-1138-x","journal-title":"Knowl Inf Syst"},{"key":"2897_CR36","doi-asserted-by":"publisher","unstructured":"Zimmerman Z, Kamgar K, Senobari NS, Crites B, Funning G, Brisk P, Keogh E (2019) Matrix profile xiv: Scaling time series motif discovery with gpus to break a quintillion pairwise comparisons a day and beyond. In: Proceedings of the ACM Symposium on Cloud Computing, SoCC \u201919. Association for Computing Machinery, New York, p 74\u201386. https:\/\/doi.org\/10.1145\/3357223.3362721","DOI":"10.1145\/3357223.3362721"},{"key":"2897_CR37","doi-asserted-by":"crossref","unstructured":"Zymbler M, Polyakov A, Kipnis M (2019) Time series discord discovery on intel many-core systems. In: Sokolinsky L, Zymbler M (eds) Parallel computational technologies. Springer International Publishing, Cham, pp 168\u2013182","DOI":"10.1007\/978-3-030-28163-2_12"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-02897-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-021-02897-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-02897-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,20]],"date-time":"2022-06-20T07:24:20Z","timestamp":1655709860000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-021-02897-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,11]]},"references-count":37,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["2897"],"URL":"https:\/\/doi.org\/10.1007\/s10489-021-02897-z","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"type":"print","value":"0924-669X"},{"type":"electronic","value":"1573-7497"}],"subject":[],"published":{"date-parts":[[2022,1,11]]},"assertion":[{"value":"5 October 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 January 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}