{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T11:08:50Z","timestamp":1730200130283,"version":"3.28.0"},"reference-count":28,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1109\/bigdata47090.2019.9006421","type":"proceedings-article","created":{"date-parts":[[2020,2,25]],"date-time":"2020-02-25T01:05:34Z","timestamp":1582592734000},"page":"2057-2066","source":"Crossref","is-referenced-by-count":0,"title":["Nearest Neighbor Subsequence Search in Time Series Data"],"prefix":"10.1109","author":[{"given":"Ramoza","family":"Ahsan","sequence":"first","affiliation":[]},{"given":"Muzammil","family":"Bashir","sequence":"additional","affiliation":[]},{"given":"Rodica","family":"Neamtu","sequence":"additional","affiliation":[]},{"given":"Elke A.","family":"Rundensteiner","sequence":"additional","affiliation":[]},{"given":"Gabor","family":"Sarkozy","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"200","article-title":"An algorithm for finding best matches in logarithmic expected time","author":"finkel","year":"1977","journal-title":"ACM Transactions on Mathematical Software"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1975.224297"},{"key":"ref12","volume":"23","author":"faloutsos","year":"1994","journal-title":"Fast Subsequence Matching in Time Series Databases"},{"key":"ref13","volume":"14","author":"guttman","year":"1984","journal-title":"R-Trees A dynamic index structure for spatial searching"},{"journal-title":"Additional material and datasets","year":"0","key":"ref14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/0201008"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2608628.2608664"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2460735"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.14778\/3021924.3021933"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2017.8258343"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/b107408"},{"key":"ref4","article-title":"Time series analysis","volume":"2","author":"wei","year":"2006","journal-title":"The Oxford Handbook of Quantitative Methods in Psychology"},{"journal-title":"Fast Algorithms for Nearest Neighbour Search","year":"2007","author":"kibriya","key":"ref27"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1007\/978-3-642-13818-8_34","article-title":"Can shared-neighbor distances defeat the curse of dimensionality?","author":"houle","year":"2010","journal-title":"International Conference on Scientific and Statistical Database Management"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2011.6033373"},{"year":"0","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/83.148613"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.1991.150755"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2379776.2379788"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2016.0179"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2010.09.007"},{"year":"0","key":"ref20"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.14778\/1454159.1454226"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/SSDM.1999.787621"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1155\/2013\/405680"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401966"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1145\/355744.355745","article-title":"An algorithm for finding best matches in logarithmic time","volume":"3","author":"friedman","year":"1976","journal-title":"ACM Trans Math Software"},{"key":"ref25","first-page":"359","article-title":"Using dynamic time warping to find patterns in time series","volume":"10","author":"berndt","year":"0","journal-title":"KDD Workshop"}],"event":{"name":"2019 IEEE International Conference on Big Data (Big Data)","start":{"date-parts":[[2019,12,9]]},"location":"Los Angeles, CA, USA","end":{"date-parts":[[2019,12,12]]}},"container-title":["2019 IEEE International Conference on Big Data (Big Data)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8986695\/9005444\/09006421.pdf?arnumber=9006421","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,17]],"date-time":"2022-07-17T17:47:54Z","timestamp":1658080074000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9006421\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/bigdata47090.2019.9006421","relation":{},"subject":[],"published":{"date-parts":[[2019,12]]}}}