{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T13:43:04Z","timestamp":1743601384919},"reference-count":11,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"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":[[1995,1]]},"DOI":"10.1016\/0167-8655(94)00070-j","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:20:02Z","timestamp":1027639202000},"page":"77-82","source":"Crossref","is-referenced-by-count":8,"title":["A new method of optimizing prototypes for nearest neighbor classifiers using a multi-layer network"],"prefix":"10.1016","volume":"16","author":[{"given":"Yea S.","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ke","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ching Y.","family":"Suen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-8655(94)00070-J_BIB1","doi-asserted-by":"crossref","first-page":"1179","DOI":"10.1109\/T-C.1974.223827","article-title":"Finding prototypes for nearest neighbor classifiers","volume":"23","author":"Chang","year":"1974","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8655(94)00070-J_BIB2","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/TIT.1967.1053964","article-title":"Nearest neighbor pattern classification","volume":"13","author":"Cover","year":"1967","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0167-8655(94)00070-J_BIB3","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(94)00070-J_BIB4","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(94)00070-J_BIB5","first-page":"1468","article-title":"The self-organizing map","volume":"78","author":"Kohonen","year":"1990"},{"issue":"1","key":"10.1016\/0167-8655(94)00070-J_BIB6","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":"Mico","year":"1994","journal-title":"Pattern Recognition Lett."},{"key":"10.1016\/0167-8655(94)00070-J_BIB7","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1109\/TIT.1975.1055464","article-title":"An algorithm for a selective nearest neighbor decision rule","volume":"21","author":"Ritter","year":"1975","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"10.1016\/0167-8655(94)00070-J_BIB8","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","volume":"4","author":"Vidal","year":"1986","journal-title":"Pattern Recognition Lett."},{"issue":"2","key":"10.1016\/0167-8655(94)00070-J_BIB9","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0031-3203(93)90040-4","article-title":"Prototype optimization for nearest neighbor classifiers using a two-layer perceptron","volume":"26","author":"Yan","year":"1993","journal-title":"Pattern Recognition"},{"issue":"2","key":"10.1016\/0167-8655(94)00070-J_BIB10","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0167-8655(94)90050-7","article-title":"Handwritten digit recognition using an optimized nearest neighbor classifier","volume":"15","author":"Yan","year":"1994","journal-title":"Pattern Recognition Lett."},{"key":"10.1016\/0167-8655(94)00070-J_BIB11","doi-asserted-by":"crossref","first-page":"678","DOI":"10.1109\/TSMC.1976.4309418","article-title":"A technique to identify nearest neighbors","volume":"6","author":"Yunck","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:016786559400070J?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016786559400070J?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:26:06Z","timestamp":1555568766000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016786559400070J"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,1]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,1]]}},"alternative-id":["016786559400070J"],"URL":"https:\/\/doi.org\/10.1016\/0167-8655(94)00070-j","relation":{},"ISSN":["0167-8655"],"issn-type":[{"value":"0167-8655","type":"print"}],"subject":[],"published":{"date-parts":[[1995,1]]}}}