{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:31:50Z","timestamp":1725489110025},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540679332"},{"type":"electronic","value":"9783540445272"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44527-7_20","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T05:20:26Z","timestamp":1186896026000},"page":"222-233","source":"Crossref","is-referenced-by-count":0,"title":["A Symmetric Nearest Neighbor Learning Rule"],"prefix":"10.1007","author":[{"given":"Richard","family":"Nock","sequence":"first","affiliation":[]},{"given":"Marc","family":"Sebban","sequence":"additional","affiliation":[]},{"given":"Pascal","family":"Jappy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,1,14]]},"reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1016\/0025-326X(95)00085-2","volume":"30","author":"D. Bernard","year":"1995","unstructured":"D. Bernard. Metals in sediments from two lagoons off guadeloupe, west indies. Marine Pollution Bulletin, 30:619\u2013621, 1995.","journal-title":"Marine Pollution Bulletin"},{"key":"20_CR2","unstructured":"C. Blake, E. Keogh, and C.J. Merz. UCI repository of machine learning databases. 1998. http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html ."},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"W. Buntine and T. Niblett. A further comparison of splitting rules for Decision-Tree ind uction. Machine Learning, pages 75\u201385, 1992.","DOI":"10.1007\/BF00994006"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"T. Cover and P. E. Hart. Nearest Neighbor pattern classification. IEEE Transactions on Infomation Theory, pages 21\u201327, 1967.","DOI":"10.1109\/TIT.1967.1053964"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"J. A. Drakopoulos. Bounds on the classification Error of the Nearest Neighbor Rule. In Proc. of the 12 th International Conference on Machine Learning, pages 203\u2013208, 1995.","DOI":"10.1016\/B978-1-55860-377-6.50033-5"},{"key":"20_CR6","volume-title":"Technical Report TR-21-49-004, Rept 4","author":"E. Fix","year":"1951","unstructured":"E. Fix and J. L. Hodges. Discrimatory analysis, nonparametric discrimination. Technical Report TR-21-49-004, Rept 4, USAF School of Aviation Medicine, Randolph Field, TX, 1951."},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"J. H. Freidman, J. L. Baskett, and L. J. Shustek. An algorithm for finding nearest neighbors. IEEE trans. on Computers, 1975.","DOI":"10.1109\/T-C.1975.224110"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"J. H. Freidman, J. L. Bentley, and R. A. Finkel. An algorithm for finding best matches in logarithmic expected time. ACM Trans. on Math. Software, 1977.","DOI":"10.1145\/355744.355745"},{"key":"20_CR9","unstructured":"J. H. Friedman. Flexible metric nearest neighbor classification. Technical report, Stanford University Dept of Statistics, 1994."},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"G. W. Gates. The Reduced Nearest Neighbor rule. IEEE Trans. on Inf. Theory, pages 431\u2013433, 1972.","DOI":"10.1109\/TIT.1972.1054809"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"P. E. Hart. The Condensed Nearest Neighbor rule. IEEE Trans. on Inf. Theory, pages 515\u2013516, 1968.","DOI":"10.1109\/TIT.1968.1054155"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"D. Harwood, S. Subbarao, H. Hakalahti, and L. S. Davis. A new class of edge-preserving smoothing filters. Pattern Recognition Letters, pages 155\u2013162, 1987.","DOI":"10.1016\/0167-8655(87)90002-X"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"T. Hastie and R. Tibshirani. Discriminant adaptive nearest neighbor classification. IEEE PAMI, pages 607\u2013615, 1996.","DOI":"10.1109\/34.506411"},{"key":"20_CR14","unstructured":"R. Meir and R. R. Snapp. Local polynomial models for classification. Draft, 1998."},{"key":"20_CR15","unstructured":"S. Okamoto and N. Yugami. Theoretical analysis of the nearest neighbor classifier in noisy domains. In Proc. of the 13 th International Conference on Machine Learning, pages 355\u2013363, 1996."},{"key":"20_CR16","unstructured":"A. M. Palau and R. Snapp. The labeled cell classifier: a fast approximation to k nearest neighbors. In Proc. of the 14 th International Conference on Pattern Recognition, volume 1, 1998."},{"key":"20_CR17","volume-title":"Technical Report UVM-CS-1998-0101","author":"R. R. Snapp","year":"1998","unstructured":"R. R. Snapp and S. S. Venkatesh. Asymptotic derivation of the finite-sample risk of the k nearest neighbor classifier. Technical Report UVM-CS-1998-0101, University of Vermont, Burlington, 1998."},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"S. S. Venkatesh, R. R. Snapp, and D. Psaltis. BELLMAN STRIKES AGAIN! the growth rate of sample complexity with dimension for the nearest neighbor classifier. In Proc. of the 5 th International Conference on Computational Learning Theory, pages 93\u2013102, 1992.","DOI":"10.1145\/130385.130396"},{"key":"20_CR19","unstructured":"R. D. Wilson and T. R. Martinez. Instance Pruning Techniques. In Proc. of the 14 th International Conference on Machine Learning, pages 404\u2013411, 1997."},{"key":"20_CR20","unstructured":"P. N. Yanilos. Data structures and algorithms for nearest neighbor search in general metric spaces. In Proc. of the 5 th ACM-SIAM Symposium on Discrete Algorithms, 1993."}],"container-title":["Lecture Notes in Computer Science","Advances in Case-Based Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44527-7_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T23:44:10Z","timestamp":1556754250000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44527-7_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679332","9783540445272"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-44527-7_20","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}