Metraipolis › archive › dc_236ce70d641d

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

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.29670
License (as archived)
CC0-1.0
Archived
2026-10-08T05:26:07.580Z
SHA-256 of the archived text
db37268d61bd30b7f28605f3308fac0625f3f9c2eb3a437054b83b7ac92419ff
Stable URL of this page
https://metraipolis.com/documento/dc_236ce70d641d

How to cite

GBFRVFL: Granular-Ball Computing-Based Fuzzy Random Vector Functional Link Network — arXiv:2609.29670 — arXiv (en), https://arxiv.org/abs/2609.29670 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_236ce70d641d (Metraipolis archive dc_236ce70d641d, sha256 db37268d61bd30b7f28605f3308fac0625f3f9c2eb3a437054b83b7ac92419ff)
BibTeX
@misc{dc236ce70d641d,
  title = {GBFRVFL: Granular-Ball Computing-Based Fuzzy Random Vector Functional Link Network — arXiv:2609.29670},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.29670},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_236ce70d641d; sha256 db37268d61bd30b7f28605f3308fac0625f3f9c2eb3a437054b83b7ac92419ff},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.29670. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In practical machine learning tasks, data are often contaminated with noise, outliers, and class imbalance, which can degrade the performance of conventional models. While random vector functional link (RVFL) networks offer fast training and strong generalization, they do not explicitly handle uncertainty or exploit local data structure. To address these limitations, we propose a fuzzy granular-ball random vector functional link (GBFRVFL) framework that leverages granular-ball computing to abstract raw samples into adaptive granular balls. Within this framework, we introduce two membership assignment schemes: (i) F-GBRVFL, which incorporates fuzzy membership to quantify the reliability of each granular ball, and (ii) SDAP-GBRVFL, which we propose, incorporates a novel statistical density-adaptive pythagorean membership (SDAPM) scheme that dynamically adjusts membership and non-membership values based on class variance, local sparsity, and granular-ball compactness. These schemes enhance robustness to noise, outliers, class imbalance, and uncertainty in granular-ball distributions, while retaining the computational efficiency of RVFL networks. Extensive experiments on 37 benchmark UCI and KEEL datasets under both clean and noisy conditions demonstrate that the proposed models consistently outperform baseline models, achieving superior accuracy and stability. The results validate the effectiveness of integrating granular-ball computing with adaptive membership schemes for reliable, scalable, and noise-tolerant learning.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-25 in cs.LG).
Categorie arXiv: Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2609.29670 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T04:50:39.455Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-09-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).