On the finite sample performance of the nearest neighbor classifier

DOI10.1109/18.335893zbMath0820.62060OpenAlexW2098374505MaRDI QIDQ4838636

Demetri Psaltis, Santosh S. Venkatesh, Robert R. Snapp

Publication date: 14 September 1995

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://resolver.caltech.edu/CaltechAUTHORS:20170530-155148945

zbMATH Keywords

asymptotic expansionscurse of dimensionalitynearest neighbor classifierfinite sample performanceexact integral expression\(m\)-sample riskfixed class-conditional probability distributionsLaplace's asymptotic method of integrationtwo-class pattern recognition problem

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Pattern recognition, speech recognition (68T10) Asymptotic approximations, asymptotic expansions (steepest descent, etc.) (41A60) Numerical integration (65D30)

Related Items (7)

GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING ⋮ Properties of Bagged Nearest Neighbour Classifiers ⋮ Choice of neighbor order in nearest-neighbor classification ⋮ Bandwidth choice for nonparametric classification ⋮ Asymptotic expansions of the \(k\) nearest neighbor risk ⋮ Theoretical analysis of cross-validation for estimating the risk of the k-Nearest Neighbor classifier ⋮ Robust nearest-neighbor methods for classifying high-dimensional data

This page was built for publication: On the finite sample performance of the nearest neighbor classifier