Distribution-free exponential error bound for nearest neighbor pattern classification

DOI10.1109/TIT.1975.1055443MaRDI QIDQ4072650zbMATH OpenOpenAlexFDO

Authors Jozsef Fritz

Publication date 1975

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

Full work available at URL https://doi.org/10.1109/tit.1975.1055443

Mathematics Subject Classification ID

Nonparametric hypothesis testing (62G10) Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Cited in

(9)

• Classification with multiple independent measurements under a separate sampling scheme
• Choice of neighbor order in nearest-neighbor classification
• Robust nearest-neighbor methods for classifying high-dimensional data
• Classification of multiple observations using multi-stage rank nearest neighbor rule.
• An M-stage version of the \(k\)-RNN rule in statistical discrimination
• Convergence rate of the fuzzy generalized nearest neighbor rule
• Benefit of Interpolation in Nearest Neighbor Algorithms
• The limit distribution of the maximum probability nearest-neighbour ball
• Nonparametric regression: An up–to–date bibliography

This page was built for publication: Distribution-free exponential error bound for nearest neighbor pattern classification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4072650)