A note on ties in voting with the k-NN rule

doi:10.1016/0031-3203(78)90039-0

Pattern Recognition

Volume 10, Issue 4, 1978, Pages 297-298

https://doi.org/10.1016/0031-3203(78)90039-0 Get rights and content

Abstract

It is shown that in the two-class case and when ties in voting are broken at random, the (2k′) and (2k′−1)-NN rules achieve identical large-sample performances. Slightly sharpened error-bounds are derived.

References (1)

T.M. Cover et al.
Nearest neighbor pattern classification
IEEE Trans. Inf. Theory
(1967)

Cited by (3)

Discrete discriminant models: A performance simulation with reference to expert systems' applications
1987, Proceedings of the 20th Annual Symposium on Simulation, ANSS 1987
Statistical Properties of Error Estimators in Performance Assessment of Recognition Systems
1982, IEEE Transactions on Pattern Analysis and Machine Intelligence
New Error Bounds with the Nearest Neighbor Rule
1979, IEEE Transactions on Information Theory

View full text

A note on ties in voting with the k-NN rule

Abstract

Nearest neighbor pattern classification

IEEE Trans. Inf. Theory