{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T04:04:00Z","timestamp":1772769840450,"version":"3.50.1"},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1981,1,1]],"date-time":"1981-01-01T00:00:00Z","timestamp":347155200000},"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"],"published-print":{"date-parts":[[1981,1]]},"DOI":"10.1016\/0031-3203(81)90102-3","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T14:41:01Z","timestamp":1056984061000},"page":"251-255","source":"Crossref","is-referenced-by-count":66,"title":["On the relation of performance to editing in nearest neighbor rules"],"prefix":"10.1016","volume":"13","author":[{"given":"Jack","family":"Koplowitz","sequence":"first","affiliation":[]},{"given":"Thomas A.","family":"Brown","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0031-3203(81)90102-3_BIB1","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/TIT.1967.1053964","article-title":"Nearest neighbor pattern classification","author":"Cover","year":"1967","journal-title":"IEEE Trans. Inf. Theory IT-13"},{"key":"10.1016\/0031-3203(81)90102-3_BIB2","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1109\/TIT.1971.1054698","article-title":"Convergence of the nearest neighbor rule","author":"Wagner","year":"1971","journal-title":"IEEE Trans. Inf. Theory IT-17"},{"key":"10.1016\/0031-3203(81)90102-3_BIB3","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1109\/TSMC.1976.5409182","article-title":"A generalization of the k-NN rule","author":"Tomek","year":"1976","journal-title":"IEEE Trans. Syst., Man Cybernet. SMC-6"},{"key":"10.1016\/0031-3203(81)90102-3_BIB4","first-page":"448","article-title":"An experiment with the edited nearest neighbor rule","author":"Tomek","year":"1976","journal-title":"IEEE Trans. Syst., Man Cybernet. SMC-6"},{"key":"10.1016\/0031-3203(81)90102-3_BIB5","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1109\/TSMC.1972.4309137","article-title":"Asymptotic properties of NN rules using edited data","author":"Wilson","year":"1972","journal-title":"IEEE Trans. Syst., Man Cybernet. SMC-2"},{"key":"10.1016\/0031-3203(81)90102-3_BIB6","doi-asserted-by":"crossref","first-page":"696","DOI":"10.1109\/TIT.1973.1055059","article-title":"Convergence of the edited nearest neighbor","author":"Wagner","year":"1973","journal-title":"IEEE Trans. Inf. Theory IT-19"},{"key":"10.1016\/0031-3203(81)90102-3_BIB7","first-page":"92","article-title":"Another look at the edited nearest neighbor rule","author":"Penrod","year":"1977","journal-title":"IEEE Trans. Syst., Man Cybernet. SMC-7"}],"container-title":["Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0031320381901023?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0031320381901023?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T05:52:39Z","timestamp":1552888359000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0031320381901023"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,1]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1981,1]]}},"alternative-id":["0031320381901023"],"URL":"https:\/\/doi.org\/10.1016\/0031-3203(81)90102-3","relation":{},"ISSN":["0031-3203"],"issn-type":[{"value":"0031-3203","type":"print"}],"subject":[],"published":{"date-parts":[[1981,1]]}}}