{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T07:13:57Z","timestamp":1779174837594,"version":"3.51.4"},"reference-count":12,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[1996,6,1]],"date-time":"1996-06-01T00:00:00Z","timestamp":833587200000},"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":[[1996,6]]},"DOI":"10.1016\/0167-8655(96)00032-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:20:02Z","timestamp":1027639202000},"page":"731-739","source":"Crossref","is-referenced-by-count":86,"title":["A fast branch & bound nearest neighbour classifier in metric spaces"],"prefix":"10.1016","volume":"17","author":[{"given":"Luisa","family":"Mic\u00f3","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jose","family":"Oncina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rafael C.","family":"Carrasco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-8655(96)00032-3_BIB1","series-title":"Nearest Neighbour (NN) norms: NN Pattern Classification Techniques","author":"Dasarathy","year":"1991"},{"key":"10.1016\/0167-8655(96)00032-3_BIB2","series-title":"Pattern Classification and Scene Analysis","author":"Duda","year":"1973"},{"key":"10.1016\/0167-8655(96)00032-3_BIB3","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1145\/355744.355745","article-title":"An algorithm for finding best matches in logarithmic expected time","volume":"3","author":"Friedman","year":"1977","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/0167-8655(96)00032-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\/0167-8655(96)00032-3_BIB5","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 Engrg."},{"key":"10.1016\/0167-8655(96)00032-3_BIB6","first-page":"557","article-title":"An algorithm for finding nearest neighbours in constant average time with a linear space complexity","volume":"Vol. II","author":"Mic\u00f3","year":"1992"},{"key":"10.1016\/0167-8655(96)00032-3_BIB7","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\/0167-8655(96)00032-3_BIB8","article-title":"Nearest neighbour search algorithms in metric spaces (in Spanish)","author":"Mic\u00f3","year":"1996"},{"key":"10.1016\/0167-8655(96)00032-3_BIB9","series-title":"Proc. EUSIPCO-90","first-page":"1323","article-title":"An efficient approximation-elimination algorithm for fast nearest-neighbour search based on a spherical distance coordinate formulation","author":"Ramasubramanian","year":"1990"},{"key":"10.1016\/0167-8655(96)00032-3_BIB10","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1145\/96105.96111","article-title":"New techniques for best-match retrieval","volume":"8","author":"Shasha","year":"1990","journal-title":"ACM Trans. Inform. Syst."},{"key":"10.1016\/0167-8655(96)00032-3_BIB11","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0167-8655(86)90013-9","article-title":"An algorithm for finding nearest neighbours in (approximately) constant average time complexity","volume":"4","author":"Vidal","year":"1986","journal-title":"Pattern Recognition Lett."},{"key":"10.1016\/0167-8655(96)00032-3_BIB12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-8655(94)90094-9","article-title":"New formulation and improvements of the nearest-neigbour Approximating and Eliminating Search Algorithm (AESA)","volume":"15","author":"Vidal","year":"1994","journal-title":"Pattern Recognition Lett."}],"container-title":["Pattern Recognition Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167865596000323?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167865596000323?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:28:19Z","timestamp":1555568899000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167865596000323"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,6]]},"references-count":12,"journal-issue":{"issue":"7","published-print":{"date-parts":[[1996,6]]}},"alternative-id":["0167865596000323"],"URL":"https:\/\/doi.org\/10.1016\/0167-8655(96)00032-3","relation":{},"ISSN":["0167-8655"],"issn-type":[{"value":"0167-8655","type":"print"}],"subject":[],"published":{"date-parts":[[1996,6]]}}}