{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T15:08:44Z","timestamp":1744902524905},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540417675"},{"type":"electronic","value":"9783540447320"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44732-6_23","type":"book-chapter","created":{"date-parts":[[2007,11,19]],"date-time":"2007-11-19T12:49:17Z","timestamp":1195476557000},"page":"224-231","source":"Crossref","is-referenced-by-count":5,"title":["Improvements in K-Nearest Neighbor Classification"],"prefix":"10.1007","author":[{"given":"Yingquan","family":"Wu","sequence":"first","affiliation":[]},{"given":"Krasimir G.","family":"Ianakiev","sequence":"additional","affiliation":[]},{"given":"Venu","family":"Govindaraju","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,5,9]]},"reference":[{"issue":"7","key":"23_CR1","doi-asserted-by":"publisher","first-page":"1147","DOI":"10.1016\/0031-3203(95)00146-8","volume":"29","author":"S. W. Lam","year":"1996","unstructured":"S. W. Lam, G. Srikantan, and S. N. Srihari, \u201cGradient-based contour encoding for character recognition\u201d, Pattern Recognition, vol. 29, no. 7, pp. 1147\u20131160, 1996.","journal-title":"Pattern Recognition"},{"issue":"3","key":"23_CR2","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/S0031-3203(98)00097-1","volume":"32","author":"K. Hattori","year":"1999","unstructured":"K. Hattori and M. Takahashi, \u201cA new nearest-neighbor rule in the pattern classification problem\u201d, Pattern Recognition, vol. 32, no. 3, pp. 425\u2013432, Mar. 1999.","journal-title":"Pattern Recognition"},{"key":"23_CR3","first-page":"92","volume-title":"The distance-weighted k-nearest neighbor rule, neighbor neighbor norms: NN pattern classification techniques","author":"S. A. Dudani","year":"1991","unstructured":"S. A. Dudani, The distance-weighted k-nearest neighbor rule, neighbor neighbor norms: NN pattern classification techniques, IEEE Comp. Soc. Press, Los Alamitos, California, pp. 92\u201394, 1991."},{"key":"23_CR4","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1109\/TSMC.1985.6313426","volume":"15","author":"J. M. Keller","year":"1985","unstructured":"J. M. Keller, M. R. Gray, and J. A. Givens, Jr., \u201cA fuzzy k-nearest neighbor algorithm\u201d, IEEE Trans, on Systems, Man, and Cybernetics, vol. 15, pp. 580\u2013585, 1985.","journal-title":"IEEE Trans, on Systems, Man, and Cybernetics"},{"key":"23_CR5","volume-title":"Pattern Classification and Scene Analysis","author":"R. O. Duda","year":"1973","unstructured":"R. O. Duda and P. E. Hart, \u201cPattern Classification and Scene Analysis\u201d, Wiley, New York, 1973."},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TIT.1967.1053964","volume":"13","author":"T. M. Cover","year":"1967","unstructured":"T. M. Cover, and P. E. Hart, \u201cNearest neighbor pattern classification\u201d, IEEE Trans, on Inform. Theory, vol. 13, pp. 21\u201327, 1967","journal-title":"IEEE Trans, on Inform. Theory"},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1109\/TIT.1975.1055373","volume":"21","author":"K. Fukunaga","year":"1975","unstructured":"K. Fukunaga and L. D. Hostetler, \u201cK-nearest-neighbor Bayes-risk estimation\u201d, IEEE Trans. Inform. Theory, vol. 21, pp. 285\u2013293, 1975.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1109\/TIT.1968.1054155","volume":"14","author":"P. E. Hart","year":"1968","unstructured":"P. E. Hart, \u201cThe condensed neatest neighbor rule\u201d, IEEE Trans. Inform. Theory, vol. 14, pp. 515\u2013516, 1968.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"G. W. Gates, \u201cThe reduced nearest neighbor rule\u201d, IEEE Trans. Inform. Theory, pp. 431\u2013433, May 1972.","DOI":"10.1109\/TIT.1972.1054809"},{"issue":"11","key":"23_CR10","doi-asserted-by":"publisher","first-page":"1179","DOI":"10.1109\/T-C.1974.223827","volume":"23","author":"C. L. Chang","year":"1974","unstructured":"C. L. Chang, \u201cFinding prototypes for nearest neighbor classifiers\u201d, IEEE Trans. Comput., vol. 23, no. 11, pp. 1179\u20131184, Nov. 1974.","journal-title":"IEEE Trans. Comput."},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"G. L. Ritter, H. B. Woodruff, S. R. Lowry, and T. L. Isenhour, \u201cAn algorithm for a selective nearest neighbor decision rule\u201d, IEEE Trans. Inform. Theory, pp. 665\u2013669, 1975.","DOI":"10.1109\/TIT.1975.1055464"}],"container-title":["Lecture Notes in Computer Science","Advances in Pattern Recognition \u2014 ICAPR 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44732-6_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T19:18:13Z","timestamp":1551122293000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44732-6_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540417675","9783540447320"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-44732-6_23","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}