Distribution-free exponential error bound for nearest neighbor pattern classification
From MaRDI portal
Publication:4072650
DOI10.1109/TIT.1975.1055443zbMath0313.62030OpenAlexW2004343933MaRDI QIDQ4072650
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
Nonparametric hypothesis testing (62G10) Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)
Related Items (9)
An M-stage version of the \(k\)-RNN rule in statistical discrimination ⋮ Benefit of Interpolation in Nearest Neighbor Algorithms ⋮ Choice of neighbor order in nearest-neighbor classification ⋮ Classification with multiple independent measurements under a separate sampling scheme ⋮ The limit distribution of the maximum probability nearest-neighbour ball ⋮ Robust nearest-neighbor methods for classifying high-dimensional data ⋮ Classification of multiple observations using multi-stage rank nearest neighbor rule. ⋮ Nonparametric regression: An up–to–date bibliography ⋮ Convergence rate of the fuzzy generalized nearest neighbor rule
This page was built for publication: Distribution-free exponential error bound for nearest neighbor pattern classification
