arXiv AI

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.

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 Machine Learning
Sep 10

Multi-granularity Adaptive Hypergraph Representation Learning via Granular-ball

The paper introduces MGHRL, a framework for hypergraph representation learning that adapts hyperedge granularity through a granular-ball splitting strategy. It constructs hyperedges at multiple levels of detail, capturing high-order relationships tailored to the graph’s topology. A multi-granularity hypergraph network then processes these hyperedges with sub-networks and hierarchical reversible connections, achieving superior performance on benchmark datasets.

By Sen Zhao, Yifan Guan, Jinyuan Ni, Gaojie Xu, Zhang Xu, Xiaoyu Lian, Yi Liu, Yi Wang, Wei Wang
arXiv AI
Sep 7

Global to Local: Topology-Preserving Adaptive Graph Pooling via Granular-Ball

The paper introduces Topology-Preserving Adaptive Graph Pooling (TPAGP), a method that partitions graphs into granular balls by combining node features and topology to create multi-granularity representations. TPAGP captures both global and local structural patterns, unlike prior pooling methods that coarsen graphs by removing or clustering nodes. Experiments show TPAGP outperforms existing pooling techniques on benchmark datasets, reducing information loss from fixed-granularity strategies.

By Sen Zhao, Gaojie Xu, Shuyin Xia, Yifan Guan, Yi Liu, Yi Wang, Wei Wang