arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1909.05495math.STstat.TH
收藏

$k$的最佳选择$k$-最近邻回归

Optimal choice of $k$ for $k$-nearest neighbor regression

Mona Azadkia

摘要:

$k$ -最近邻算法($k$ -NN)是一种广泛使用的非参数分类和回归方法。我们研究了当$k$采用留一法交叉验证时,$k$ -NN估计的均方误差.尽管已知$k$的这种选择是渐进一致的,但之前并不知道它是最佳的$k$。我们表明,具有很高的概率,该估计的均方误差接近最小均方误差使用$k$ -NN估计,其中最小值是在所有选择的$k$。

英文摘要:

The $k$-nearest neighbor algorithm ($k$-NN) is a widely used non-parametric method for classification and regression. We study the mean squared error of the $k$-NN estimator when $k$ is chosen by leave-one-out cross-validation (LOOCV). Although it was known that this choice of $k$ is asymptotically consistent, it was not known previously that it is an optimal $k$. We show, with high probability, the mean squared error of this estimator is close to the minimum mean squared error using the $k$-NN estimate, where the minimum is over all choices of $k$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑