Curvature-Aware Radius Shrinkage for Adaptive Nearest Neighbor Classification (CARSANN) is introduced, a geometry-driven framework that adapts the spatial support of each neighborhood according to local geometric complexity and is competitive with adaptive nearest-neighbor methods.
Abstract
Nearest neighbor classification relies fundamentally on how locality is defined, yet conventional $k$-NN imposes the same neighborhood cardinality throughout the feature space. This assumption can be inadequate for data whose local geometry varies substantially across the underlying manifold. We introduce Curvature-Aware Radius Shrinkage for Adaptive Nearest Neighbor Classification (CARSANN), a geometry-driven framework that adapts the spatial support of each neighborhood according to local geometric complexity. CARSANN first estimates intrinsic dimensionality using TwoNN and constructs an intrinsic representation through principal component analysis. Local mean curvature is then estimated using a shape-operator-based formulation and controls neighborhood scale: highly curved regions receive stronger radius shrinkage, whereas approximately flat regions retain broader spatial support. Unlike methods that modify only the number of neighbors or the local metric, CARSANN explicitly adapts the spatial extent of local evidence. Experiments on more than 70 real-world OpenML datasets show that CARSANN consistently improves upon standard $k$-NN and is competitive with adaptive nearest-neighbor methods. In a controlled comparison using the same base neighborhood size, CARSANN achieves higher balanced accuracy on 40 of 45 datasets, increasing mean balanced accuracy from 0.6506 to 0.7528. The advantage also persists against $k$-NN with fixed $k=5$. Friedman and Nemenyi tests confirm that the improvements are statistically significant. These results indicate that local manifold curvature can serve as an effective geometric control variable for adapting neighborhood support, providing a complementary paradigm to cardinality-based nearest-neighbor adaptation.
SHOPCA is computationally tractable, parameter-efficient, and applicable to domains requiring fully unsupervised, geometry-aware dimensionality reduction, and surpasses UMAP on small-sample settings, where iterative neighborhood-based manifold estimation can degrade.
The results give an empirical separation, on a real hierarchical-classification problem, between two natural latent geometries for a class-structured regularizer.
Experimental results demonstrate that the proposed adaptive and efficient KNN approach via granular-ball computing outperforms existing KNN variants across multiple datasets in terms of both accuracy and efficiency.
Xiao-Yu Lian, Shu-Yin Xia, Hongxuan He et al.· 0 citations
A membership-restricted Shepard rho resolves single-point and minority-population questions that many-pair statistics cannot -- questions on which even DREAMS, a recent local-plus-global hybrid, fails silently.
Manifold-Based Clustering (MBC) is proposed, which returns an explicit bracket interval to quantify the underlying data uncertainty, and suggests that ambiguity in cluster number is often intrinsic, and should be quantified rather than resolved.
Savik Kinger, Luciano Dyballa, Steven W. Zucker· 1 citation
The Johnson-Lindenstrauss (JL) lemma guarantees that a random projection of $n$ points to $m=O(\varepsilon^{-2}\log n)$ dimensions preserves pairwise squared distances within relative error $\varepsilon$ with high probability, and this dimension order is asymptotically optimal. In high dimensions, however, distances co...