A note on ties in voting with the k-NN rule
作者：
Highlights：
•
摘要
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.
论文关键词：Pattern recognition,k nearest neighbor decision rules,Error-bounds
论文评审过程：Received 20 February 1978, Available online 19 May 2003.
论文官网地址：https://doi.org/10.1016/0031-3203(78)90039-0
