Adaptive $k$-nearest neighbor classifier based on the local estimation of the shape operator
Alexandre Lu\'is Magalh\~aes Levada, Frank Nielsen, Michel Ferreira, Cardia Haddad

TL;DR
This paper introduces an adaptive $k$-NN classifier that adjusts neighborhood size based on local data curvature, improving accuracy especially with limited data by better capturing data shape.
Contribution
The paper proposes a novel $kK$-NN algorithm that estimates local curvature via the shape operator to adaptively select neighborhood size, enhancing classification performance.
Findings
Outperforms standard $k$-NN in balanced accuracy.
More effective with limited training data.
Provides better data shape approximation.
Abstract
The -nearest neighbor (-NN) algorithm is one of the most popular methods for nonparametric classification. However, a relevant limitation concerns the definition of the number of neighbors . This parameter exerts a direct impact on several properties of the classifier, such as the bias-variance tradeoff, smoothness of decision boundaries, robustness to noise, and class imbalance handling. In the present paper, we introduce a new adaptive -nearest neighbours (-NN) algorithm that explores the local curvature at a sample to adaptively defining the neighborhood size. The rationale is that points with low curvature could have larger neighborhoods (locally, the tangent space approximates well the underlying data shape), whereas points with high curvature could have smaller neighborhoods (locally, the tangent space is a loose approximation). We estimate the local Gaussian…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFace and Expression Recognition
