{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T21:36:53Z","timestamp":1773524213679,"version":"3.50.1"},"reference-count":31,"publisher":"Association for Computing Machinery (ACM)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2016,11]]},"abstract":"<jats:p>Finding similar trends among time series data is critical for applications ranging from financial planning to policy making. The detection of these multifaceted relationships, especially time warped matching of time series of different lengths and alignments is prohibitively expensive to compute. To achieve real time responsiveness on large time series datasets, we propose a novel paradigm called Online Exploration of Time Series (ONEX) employing a powerful one-time preprocessing step that encodes critical similarity relationships to support subsequent rapid data exploration. Since the encoding of a huge number of pairwise similarity relationships for all variable lengths time series segments is not feasible, our work rests on the important insight that clustering with inexpensive point-to-point distances such as the Euclidean Distance can support subsequent time warped matching. Our ONEX framework overcomes the prohibitive computational costs associated with a more robust elastic distance namely the DTW by applying it over the surprisingly compact knowledge base instead of the raw data. Our comparative study reveals that ONEX is up to 19% more accurate and several times faster than the state-of-the-art. Beyond being a highly accurate and fast domain independent solution, ONEX offers a truly interactive exploration experience supporting novel time series operations.<\/jats:p>","DOI":"10.14778\/3021924.3021933","type":"journal-article","created":{"date-parts":[[2017,1,24]],"date-time":"2017-01-24T15:29:41Z","timestamp":1485271781000},"page":"169-180","source":"Crossref","is-referenced-by-count":20,"title":["Interactive time series exploration powered by the marriage of similarity distances"],"prefix":"10.14778","volume":"10","author":[{"given":"Rodica","family":"Neamtu","sequence":"first","affiliation":[{"name":"Worcester Polytechnic Institute Worcester"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ramoza","family":"Ahsan","sequence":"additional","affiliation":[{"name":"Worcester Polytechnic Institute Worcester"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elke","family":"Rundensteiner","sequence":"additional","affiliation":[{"name":"Worcester Polytechnic Institute Worcester"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gabor","family":"Sarkozy","sequence":"additional","affiliation":[{"name":"Worcester Polytechnic Institute Worcester"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,11]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-57301-1_5"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376656"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783286"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/25681.25685"},{"key":"e_1_2_1_5_1","first-page":"359","volume-title":"KDD workshop","volume":"10","author":"Berndt D. J.","year":"1994"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1316689.1316758"},{"key":"e_1_2_1_7_1","first-page":"195","volume-title":"SDM","author":"Chu S.","year":"2002"},{"key":"e_1_2_1_8_1","unstructured":"T. H. Cormen. Introduction to algorithms. MIT press 2009.   T. H. Cormen. Introduction to algorithms . MIT press 2009."},{"key":"e_1_2_1_9_1","volume-title":"KDD","author":"Das G.","year":"1998"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001402002052"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.14778\/1454159.1454226"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/191839.191925"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-006-0040-z"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.33"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/359581.359603"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/376284.375680"},{"key":"e_1_2_1_17_1","doi-asserted-by":"crossref","unstructured":"E. Keogh K. Chakrabarti M. Pazzani and S. Mehrotra. Dimensionality reduction for fast similarity search in large time series databases. Knowledge and information Systems 3(3):263--286 2001.  E. Keogh K. Chakrabarti M. Pazzani and S. Mehrotra. Dimensionality reduction for fast similarity search in large time series databases. Knowledge and information Systems 3(3):263--286 2001.","DOI":"10.1007\/PL00011669"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/2993953.2994027"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/347090.347153"},{"key":"e_1_2_1_20_1","unstructured":"J. Kruskall and M. Liberman. The symmetric time warping algorithm: From continuous to discrete. time warps string edits and macromolecules 1983.  J. Kruskall and M. Liberman. The symmetric time warping algorithm: From continuous to discrete. time warps string edits and macromolecules 1983."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-015-0878-8"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339576"},{"key":"e_1_2_1_23_1","doi-asserted-by":"crossref","unstructured":"R. Rivest. The md5 message-digest algorithm. 1992.  R. Rivest. The md5 message-digest algorithm. 1992.","DOI":"10.17487\/rfc1321"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2124295.2124358"},{"key":"e_1_2_1_25_1","doi-asserted-by":"crossref","unstructured":"H. Sakoe and S. Chiba. Dynamic programming algorithm optimization for spoken word recognition. IEEE transactions on acoustics speech and signal processing 26(1):43--49 1978.  H. Sakoe and S. Chiba. Dynamic programming algorithm optimization for spoken word recognition. IEEE transactions on acoustics speech and signal processing 26(1):43--49 1978.","DOI":"10.1109\/TASSP.1978.1163055"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.368963"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/993490"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.082099299"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/876875.878994"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/238355.238365"},{"key":"e_1_2_1_31_1","volume-title":"VLDB","author":"Yi B.-K.","year":"2000"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3021924.3021933","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T09:30:01Z","timestamp":1672219801000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3021924.3021933"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,11]]}},"alternative-id":["10.14778\/3021924.3021933"],"URL":"https:\/\/doi.org\/10.14778\/3021924.3021933","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2016,11]]}}}