{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T04:28:33Z","timestamp":1778300913641,"version":"3.51.4"},"reference-count":12,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"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":[[2003,1]]},"DOI":"10.1016\/s0167-8655(02)00187-3","type":"journal-article","created":{"date-parts":[[2002,11,5]],"date-time":"2002-11-05T12:16:06Z","timestamp":1036498566000},"page":"47-53","source":"Crossref","is-referenced-by-count":32,"title":["A modification of the LAESA algorithm for approximated k-NN classification"],"prefix":"10.1016","volume":"24","author":[{"given":"Francisco","family":"Moreno-Seco","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luisa","family":"Mic\u00f3","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jose","family":"Oncina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-8655(02)00187-3_BIB1","series-title":"New Advances and Trends in Speech Recognition and Coding","first-page":"23","article-title":"Extensions to the approximating and eliminating search algorithm (aesa) for finding k-nearest-neighbours","author":"Aibar","year":"1993"},{"key":"10.1016\/S0167-8655(02)00187-3_BIB2","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/361002.361007","article-title":"Multidimensional binary search trees used for associative searching","volume":"18","author":"Bentley","year":"1975","journal-title":"Commun. ACM"},{"key":"10.1016\/S0167-8655(02)00187-3_BIB3","series-title":"Pattern Recognition and Scene Analysis","author":"Duda","year":"1973"},{"key":"10.1016\/S0167-8655(02)00187-3_BIB4","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(02)00187-3_BIB5","series-title":"Algorithms for Clustering Data","author":"Jain","year":"1988"},{"key":"10.1016\/S0167-8655(02)00187-3_BIB6","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. Softw. Eng."},{"issue":"5","key":"10.1016\/S0167-8655(02)00187-3_BIB7","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1109\/34.682187","article-title":"Fast design of reduced-complexity nearest-neighbor classifiers using triangular inequality","volume":"20","author":"Lee","year":"1998","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/S0167-8655(02)00187-3_BIB8","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/S0167-8655(98)00007-5","article-title":"Comparison of fast nearest neighbour classifiers for handwritten character recognition","volume":"19","author":"Mic\u00f3","year":"1998","journal-title":"Pattern Recogn. Lett."},{"key":"10.1016\/S0167-8655(02)00187-3_BIB9","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 Recogn. Lett."},{"key":"10.1016\/S0167-8655(02)00187-3_BIB10","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 Recogn. Lett."},{"key":"10.1016\/S0167-8655(02)00187-3_BIB11","doi-asserted-by":"crossref","first-page":"1497","DOI":"10.1016\/S0031-3203(99)00134-X","article-title":"Fast nearest-neighbor search algorithms based on approximation-elimination search","volume":"33","author":"Ramasubramanian","year":"2000","journal-title":"Pattern Recogn."},{"key":"10.1016\/S0167-8655(02)00187-3_BIB12","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0167-8655(86)90013-9","article-title":"An algorithm for finding the nearest neighbour in (approximately) constant time","volume":"4","author":"Vidal","year":"1986","journal-title":"Pattern Recogn. Lett."}],"container-title":["Pattern Recognition Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167865502001873?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167865502001873?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T02:53:40Z","timestamp":1554778420000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167865502001873"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,1]]},"references-count":12,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,1]]}},"alternative-id":["S0167865502001873"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8655(02)00187-3","relation":{},"ISSN":["0167-8655"],"issn-type":[{"value":"0167-8655","type":"print"}],"subject":[],"published":{"date-parts":[[2003,1]]}}}