{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T15:25:15Z","timestamp":1767626715495},"reference-count":9,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[1993,7,1]],"date-time":"1993-07-01T00:00:00Z","timestamp":741484800000},"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":[[1993,7]]},"DOI":"10.1016\/0167-8655(93)90101-i","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T17:46:52Z","timestamp":1056995212000},"page":"531-535","source":"Crossref","is-referenced-by-count":15,"title":["An improved method for finding nearest neighbors"],"prefix":"10.1016","volume":"14","author":[{"given":"Qiyuan","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenshu","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-8655(93)90101-I_BIB1","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/TIT.1967.1053964","article-title":"Nearest neighbor classification","volume":"13","author":"Cover","year":"1967","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0167-8655(93)90101-I_BIB2","series-title":"Proc. 5th Internat. Conf. Pattern Recognition","first-page":"72","article-title":"On the edited nearest neighbor rule","author":"Devijver","year":"1980"},{"key":"10.1016\/0167-8655(93)90101-I_BIB3","doi-asserted-by":"crossref","first-page":"1000","DOI":"10.1109\/T-C.1975.224110","article-title":"An algorithm for finding nearest neighbors","volume":"24","author":"Friedman","year":"1975","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8655(93)90101-I_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(93)90101-I_BIB5","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1109\/TIT.1972.1054809","article-title":"The reduced nearest neighbor rule","volume":"18","author":"Gates","year":"1972","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0167-8655(93)90101-I_BIB6","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1109\/TIT.1968.1054155","article-title":"The condensed nearest neighbor rule","volume":"14","author":"Hart","year":"1968","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0167-8655(93)90101-I_BIB7","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0167-8655(85)90036-4","article-title":"An improved branch and bound algorithm for computing k-nearest neighbors","volume":"3","author":"Kamgar-Parsi","year":"1985","journal-title":"Pattern Recognition Lett."},{"key":"10.1016\/0167-8655(93)90101-I_BIB8","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0167-8655(88)90120-1","article-title":"An efficient branch-and-bound nearest neighbor classifier","volume":"7","author":"Niemann","year":"1988","journal-title":"Pattern Recognition Lett."},{"key":"10.1016\/0167-8655(93)90101-I_BIB9","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1109\/TSMC.1976.4309452","article-title":"Two modifications of CNN","volume":"6","author":"Tomek","year":"1976","journal-title":"IEEE. Trans. Syst. Man Cybernet."}],"container-title":["Pattern Recognition Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016786559390101I?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016786559390101I?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T13:54:57Z","timestamp":1552917297000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016786559390101I"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,7]]},"references-count":9,"journal-issue":{"issue":"7","published-print":{"date-parts":[[1993,7]]}},"alternative-id":["016786559390101I"],"URL":"https:\/\/doi.org\/10.1016\/0167-8655(93)90101-i","relation":{},"ISSN":["0167-8655"],"issn-type":[{"value":"0167-8655","type":"print"}],"subject":[],"published":{"date-parts":[[1993,7]]}}}