{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T00:06:50Z","timestamp":1729642010944,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008,6]]},"DOI":"10.1109\/ijcnn.2008.4633978","type":"proceedings-article","created":{"date-parts":[[2008,9,29]],"date-time":"2008-09-29T16:31:26Z","timestamp":1222705886000},"page":"1382-1389","source":"Crossref","is-referenced-by-count":0,"title":["Pseudometrics for time series classification by nearest neighbor"],"prefix":"10.1109","author":[{"given":"Teesid","family":"Korsrilabutr","sequence":"first","affiliation":[]},{"given":"Boonserm","family":"Kijsirikul","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"year":"0","key":"13"},{"journal-title":"The UCR Time Series Classification\/Clustering","year":"0","author":"keogh","key":"14"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1023\/A:1025026030880"},{"key":"12","article-title":"binary codes capable of correcting deletions, insertions and reversals","volume":"10","author":"levenshtein","year":"1966","journal-title":"Soviet Physics Doklady"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TASSP.1975.1162641"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TASSP.1978.1163055"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1967.1053964"},{"key":"10","first-page":"426","article-title":"m-tree: an efficient access method for similarity search in metric spaces","author":"ciaccia","year":"1997","journal-title":"VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-004-0154-9"},{"key":"6","article-title":"learned models for continuous planning","author":"schmill","year":"1999","journal-title":"7th international workshop on artificial intelligence and statistics"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/17.6.495"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1121\/1.2016831"},{"key":"9","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1117\/12.234778","article-title":"using the triangle inequality to reduce the number of comparisons required for similarity-based retrieval","author":"barros","year":"1996","journal-title":"Storage and Retrieval for Image and Video Databases (SPIE)"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1145\/223784.223794"}],"event":{"name":"2008 IEEE International Joint Conference on Neural Networks (IJCNN 2008 - Hong Kong)","start":{"date-parts":[[2008,6,1]]},"location":"Hong Kong, China","end":{"date-parts":[[2008,6,8]]}},"container-title":["2008 IEEE International Joint Conference on Neural Networks (IEEE World Congress on Computational Intelligence)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4625775\/4633757\/04633978.pdf?arnumber=4633978","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T05:03:19Z","timestamp":1557810199000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4633978\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/ijcnn.2008.4633978","relation":{},"subject":[],"published":{"date-parts":[[2008,6]]}}}