{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T23:34:05Z","timestamp":1780356845922,"version":"3.54.1"},"reference-count":12,"publisher":"Elsevier BV","issue":"3-4","license":[{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Pattern Recognition Letters"],"published-print":{"date-parts":[[1998,3]]},"DOI":"10.1016\/s0167-8655(98)00007-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:20:02Z","timestamp":1027639202000},"page":"351-356","source":"Crossref","is-referenced-by-count":18,"title":["Comparison of fast nearest neighbour classifiers for handwritten character recognition"],"prefix":"10.1016","volume":"19","author":[{"given":"Luisa","family":"Mic\u00f3","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jose","family":"Oncina","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-8655(98)00007-5_BIB1","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1109\/T-C.1975.224297","article-title":"A branch and bound algorithm for computing k-nearest neighbors","volume":"24","author":"Fukunaga","year":"1975","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-8655(98)00007-5_BIB2","unstructured":"G\u00f3mez, E., Mic\u00f3, L., Oncina, J., 1995. Testing the linear approximating eliminating search algorithm in handwritten character recognition tasks. In: Actas del VI Simposium Nacional de Reconocimiento de Formas y An\u00e1lisis de Im\u00e1genes, C\u00f3rdoba, pp. 212\u2013217."},{"key":"10.1016\/S0167-8655(98)00007-5_BIB3","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1109\/TSE.1983.235263","article-title":"A data structure and an algorithm for the nearest point problem","volume":"9","author":"Kalantari","year":"1983","journal-title":"IEEE Trans. Software Engineering"},{"key":"10.1016\/S0167-8655(98)00007-5_BIB4","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0167-8655(94)90095-7","article-title":"A new version of the nearest-neighbour approximating and eliminating search algorithm (AESA) with linear preprocessing-time and memory requirements","volume":"15","author":"Mic\u00f3","year":"1994","journal-title":"Pattern Recognition Lett."},{"key":"10.1016\/S0167-8655(98)00007-5_BIB5","unstructured":"Mic\u00f3, L., 1996. Algoritmos de b\u00fasqueda de vecinos m\u00e1s pr\u00f3ximos en espacios m\u00e9tricos. Ph.D. Dissertation. Universidad Polit\u00e9cnica de Valencia."},{"key":"10.1016\/S0167-8655(98)00007-5_BIB6","doi-asserted-by":"crossref","first-page":"731","DOI":"10.1016\/0167-8655(96)00032-3","article-title":"A fast branch and bound nearest neighbour classifier in metric spaces","volume":"17","author":"Mic\u00f3","year":"1996","journal-title":"Pattern Recognition Lett."},{"key":"10.1016\/S0167-8655(98)00007-5_BIB7","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1109\/TCOM.1981.1095031","article-title":"Isolated and connected word recognition \u2013 Theory and selected applications","volume":"29","author":"Rabiner","year":"1984","journal-title":"IEEE Trans. Comm."},{"key":"10.1016\/S0167-8655(98)00007-5_BIB8","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1109\/TPAMI.1985.4767621","article-title":"A metric for comparing relational descriptions","volume":"7","author":"Shapiro","year":"1985","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."},{"key":"10.1016\/S0167-8655(98)00007-5_BIB9","doi-asserted-by":"crossref","unstructured":"Vidal, E., 1985. Some contributions to automatic speech recognition tasks (in Spanish). Ph.D. Dissertation. Universidad de Valencia.","DOI":"10.1007\/978-3-642-82447-0_17"},{"key":"10.1016\/S0167-8655(98)00007-5_BIB10","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0167-6393(85)90058-5","article-title":"Is the DTW distance really a metric? An algorithm reducing the number of DTW comparisons in isolated word recognition","volume":"4","author":"Vidal","year":"1985","journal-title":"Speech Communication"},{"key":"10.1016\/S0167-8655(98)00007-5_BIB11","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1109\/29.1575","article-title":"On the use of a metric-space search algorithm (AESA) for fast DTW-based recognition of isolated words","volume":"36","year":"1988","journal-title":"IEEE Trans. Acoustics Speech Signal Process."},{"issue":"1","key":"10.1016\/S0167-8655(98)00007-5_BIB12","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/321796.321811","article-title":"The string-to-string correction problem","volume":"21","author":"Wagner","year":"1974","journal-title":"J. ACM"}],"container-title":["Pattern Recognition Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167865598000075?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167865598000075?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T06:50:38Z","timestamp":1555570238000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167865598000075"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":12,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["S0167865598000075"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8655(98)00007-5","relation":{},"ISSN":["0167-8655"],"issn-type":[{"value":"0167-8655","type":"print"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}