Asymptotic expansions of the k nearest neighbor risk

Annals of Statistics

Volumn 26, Issue 3, 1998, Pages 850-878

  Snapp, Robert R ^a   Venkatesh, Santosh S ^b  

^a University of Vermont   (United States)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

Asymptotic expansions; Finite sample risk; k nearest neighbor classifier; Laplace's method

Indexed keywords

EID: 0032350923     PISSN: 00905364     EISSN: None     Source Type: Journal    
DOI: 10.1214/aos/1024691080     Document Type: Article

References (19)

1. BREIMAN, L., FRIEDMAN, J. H., OLSHEN, R. A. and STONE, C. J. (1984). Classification and Regression Trees. Wadsworth & Brooks/Cole, Pacific Grove, CA.
2. COVER, T. M. (1968). Rates of convergence of nearest neighbor decision procedures. In Proceedings First Annual Hawaii Conference on Systems Theory 413-415.
3. COVER, T. M. and HART, P. E. (1967). Nearest neighbor pattern classification. IEEE Trans. Inform. Theory 13 21-27.
4. DEVROYE, L. (1982). Any discrimination rule can have an arbitrarily bad probability of error for finite sample size. IEEE Trans. Pattern Anal. Machine Intelligence 4 154-157.
5. ERDÉLYI, A. (1956). Asymptotic Expansions. Dover, New York.
6. FIX, E. and HODGES, J. L., JR. (1951). Discriminatory analysis - nonparametric discrimination: consistency properties. Project 21-49-004, Report No. 4. 261-279. USAF School of Aviation Medicine, Randolf Field, TX.
7. FRIEDMAN, J. H., BENTLEY, J. L. and FINKEL, R. A. (1977). An algorithm for finding best matches in logarithmic expected time. ACM Trans. Math. Software 3 209-226.
8. FUKUNAGA, K. and HUMMELS, D. M. (1987). Bias of nearest neighbor estimates. IEEE Trans. Pattern Anal. Machine Intelligence 9 103-112.
9. FUKUNAGA, K. and FLICK, T. E. (1984). An optimal global nearest neighbor metric. IEEE Trans. Pattern Anal. Machine Intelligence 6 314-318.
10. FULKS, W. and SATHER, J. O. (1961). Asymptotics II: Laplace's method for multiple integrals. Pacific J. Math. 11 185-192.
11. HELLMAN, M. E. (1970). The nearest-neighbor classification rule with a reject option. IEEE Trans. Systems Man Cybernet. 6 179-185.
12. KNUTH, D. E. (1976). Big omicron and big omega and big theta. ACM SIGACT News 8 18-23.
13. PSALTIS, D., SNAPP, R. R. and VENKATESH, S. S. (1994). On the finite sample performance of the nearest neighbor classifier. IEEE Trans. Inform. Theory 40 820-837.
14. SMITH, S. J., BOURGOIN, M. O., SIMS, K. and VOORHEES, H. L. (1994). Handwritten character classification using nearest neighbor in large databases. IEEE Trans. Pattern Anal. Machine Intelligence 16 915-919, 1994.
15. SNAPP, R. R. and VENKATESH, S. S. (1994). Asymptotic predictions of the finite-sample risk of the k-nearest-neighbor classifier. In Proceedings of the 12th International Conference on Pattern Recognition 2 1-7. IEEE Computer Society Press, Los Alamitos, CA.
16. SNAPP, R. R. and VENKATESH, S. S. (1998). Asymptotic derivation of the finite-sample risk of the k nearest neighbor classifier. Technical Report UVM-CS-1998-0101, Dept. Computer Science, Univ. Vermont.
17. SNAPP, R. R. and XU, T. (1996). Estimating the Bayes risk from sample data. In Advances in Neural Information Processing Systems 8 (D. S. Touretzky, M. C. Moser, and M. E. Hasselmo, eds.) MIT Press.
18. STONE, C. J. (1977). Consistent nonparametric regression. Ann. Statist. 5 595-645.
19. WATSON, G. N. (1918). The harmonic functions associated with the parabolic cylinder. Proc. London Math. Soc. 17 116-148.