TL;DR该论文提出了一种改进的 K 近邻分类器,它可以自适应地为每个查询选择 K,该选择取决于每个邻域的属性,因此可能在不同点之间显着变化,并且可以利用条件概率推导推导出一些收敛界限。
Abstract
We introduce a variant of the $k$-nearest neighbor classifier in which $k$ is
chosen adaptively for each query, rather than supplied as a parameter. The
choice of $k$ depends on properties of each neighborhood, and therefore may
significantly vary between different points. (For example, the algorithm will
use larger $k$ for predicting the labels of points in