Skip to yearly menu bar Skip to main content


k*-Nearest Neighbors: From Global to Local

Oren Anava · Kfir Y. Levy

Area 5+6+7+8 #40

Keywords: [ (Other) Regression ] [ (Other) Classification ] [ Kernel Methods ]


The weighted k-nearest neighbors algorithm is one of the most fundamental non-parametric methods in pattern recognition and machine learning. The question of setting the optimal number of neighbors as well as the optimal weights has received much attention throughout the years, nevertheless this problem seems to have remained unsettled. In this paper we offer a simple approach to locally weighted regression/classification, where we make the bias-variance tradeoff explicit. Our formulation enables us to phrase a notion of optimal weights, and to efficiently find these weights as well as the optimal number of neighbors efficiently and adaptively, for each data point whose value we wish to estimate. The applicability of our approach is demonstrated on several datasets, showing superior performance over standard locally weighted methods.

Live content is unavailable. Log in and register to view live content