arXiv Machine Learning

Adaptive $k$ Nearest Neighbors Classifier via Granular Ball Computing

arXiv:2608. 12903v1 Announce Type: new Abstract: The $k$-Nearest Neighbor~(KNN) algorithm is widely used across various tasks.

arXiv Machine Learning
Sep 25

GBFRVFL: Granular-Ball Computing-Based Fuzzy Random Vector Functional Link Network

The paper introduces GBFRVFL, a fuzzy granular-ball random vector functional link network designed to improve robustness in noisy, imbalanced, or uncertain data settings. It employs granular-ball computing to group raw samples into adaptive balls and proposes two membership assignment schemes: F-GBRVFL, which uses fuzzy membership to gauge ball reliability, and SDAP-GBRVFL, which introduces a statistical density‑adaptive Pythagorean membership that adjusts based on class variance, local sparsity, and ball compactness. Experiments on 37 UCI and KEEL datasets show that these models outperform baseline methods in both clean and noisy conditions, achieving higher accuracy and stability.

By A. Quadir, A. Rahaman, P. N. Suganthan, M. Tanveer
arXiv AI
Jun 30

Granular-ball computing: an efficient, robust, and interpretable adaptive multi-granularity representation and computation method

arXiv:2304. 11171v5 Announce Type: replace-cross Abstract: To overcome the limitations of point-based inputs, overly fine computation and limited adaptability in existing artificial intelligence methods, Guoyin Wang and Shuyin Xia proposed granular-ball computing as a new artificial intelligence learning paradigm.

By Shuyin Xia, Guoyin Wang, Xinbo Gao, Xiaoyu Lian, Hongzhi Kuai
arXiv Machine Learning
Aug 31

Curvature-Aware Radius Shrinkage for Adaptive Nearest Neighbor Classification

Curvature-Aware Radius Shrinkage for Adaptive Nearest Neighbor Classification (CARSANN) is a geometry-driven framework that adapts the spatial support of each neighborhood based on local geometric complexity. It estimates intrinsic dimensionality with TwoNN, builds an intrinsic representation via PCA, and uses a shape-operator-based estimate of local mean curvature to shrink the radius in highly curved regions while keeping a broader support in flatter areas. Experiments on over 70 OpenML datasets show that CARSANN consistently outperforms standard k‑NN and rivals other adaptive nearest‑neighbor methods, achieving a mean balanced accuracy increase from 0.6506 to 0.7528 and statistically significant improvements on most datasets.

By Alexandre L. M. Levada
arXiv Machine Learning
Sep 23

Exact and Approximate Range Queries in Ball Mapper

arXiv:2601.01405v3 Announce Type: replace-cross Abstract: Ball Mapper summarizes a finite metric dataset by covering the sample with closed balls centered at selected landmarks and connecting landmar...

By Jay-Anne Bulauan, John Rick Manzanares