{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:44:10Z","timestamp":1760597050243},"reference-count":10,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,2,1]],"date-time":"2002-02-01T00:00:00Z","timestamp":1012521600000},"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":[[2002,2]]},"DOI":"10.1016\/s0031-3203(00)00184-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T05:56:44Z","timestamp":1027576604000},"page":"505-513","source":"Crossref","is-referenced-by-count":70,"title":["An incremental prototype set building technique"],"prefix":"10.1016","volume":"35","author":[{"given":"V.","family":"Susheela Devi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.Narasimha","family":"Murty","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S0031-3203(00)00184-9_BIB1","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1109\/TIT.1968.1054155","article-title":"The condensed nearest neighbor rule","volume":"IT-14","author":"Hart","year":"1968","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0031-3203(00)00184-9_BIB2","first-page":"511","article-title":"Sample set condensation for a condensed nearest neighbor decision rule for pattern recognition","author":"Swonger","year":"1972","journal-title":"Front. Pattern Recognition"},{"issue":"3","key":"10.1016\/S0031-3203(00)00184-9_BIB3","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1109\/TIT.1972.1054809","article-title":"The reduced nearest neighbour rule","volume":"IT-18","author":"Gates","year":"1972","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"10.1016\/S0031-3203(00)00184-9_BIB4","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1016\/S0167-8655(97)00035-4","article-title":"Prototype selection for the nearest neighbour rule through proximity graphs","volume":"18","author":"Sanchez","year":"1995","journal-title":"Pattern Recognition Lett."},{"issue":"5","key":"10.1016\/S0031-3203(00)00184-9_BIB5","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1109\/3477.790454","article-title":"Considerations about sample-size sensitivity of a family of edited nearest neighbour rules","volume":"29","author":"Ferri","year":"1999","journal-title":"IEEE Trans. Systems Man Cybernet. Part B: Cybernetics"},{"key":"10.1016\/S0031-3203(00)00184-9_BIB6","series-title":"Soft Computing for Image Processing","article-title":"Handwritten digit recognition using soft computing tools","author":"Susheela Devi","year":"2000"},{"key":"10.1016\/S0031-3203(00)00184-9_BIB7","unstructured":"P.M. Murphy, D.W. Aha, UCI Repository of machine learning databases [http:\/\/www.ics.uci.edu\/ mlearn\/MLRepository.html], Department of Information and Computer Science, University of California, Irvine, CA, 1994."},{"key":"10.1016\/S0031-3203(00)00184-9_BIB8","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/TIT.1967.1053964","article-title":"Nearest neighbor pattern classification","volume":"IT-13","author":"Cover","year":"1967","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"8","key":"10.1016\/S0031-3203(00)00184-9_BIB9","doi-asserted-by":"crossref","first-page":"809","DOI":"10.1016\/0167-8655(95)00047-K","article-title":"Editing for the k-nearest neighbours rule by a genetic algorithm","volume":"16","author":"Kuncheva","year":"1995","journal-title":"Pattern Recognition Lett."},{"key":"10.1016\/S0031-3203(00)00184-9_BIB10","doi-asserted-by":"crossref","first-page":"1149","DOI":"10.1016\/S0167-8655(99)00082-3","article-title":"Nearest neighbor classifier: simultaneous editing and feature selection","volume":"20","author":"Kuncheva","year":"1999","journal-title":"Pattern Recognition Lett."}],"container-title":["Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0031320300001849?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0031320300001849?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T10:24:53Z","timestamp":1556879093000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0031320300001849"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,2]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,2]]}},"alternative-id":["S0031320300001849"],"URL":"https:\/\/doi.org\/10.1016\/s0031-3203(00)00184-9","relation":{},"ISSN":["0031-3203"],"issn-type":[{"value":"0031-3203","type":"print"}],"subject":[],"published":{"date-parts":[[2002,2]]}}}