arrow
Return

Multi-granularity graph refinement via granular ball for graph classification

delete2026-04-18
delete0
PRE
AI
J
Jinyuan Ni
S
Shuyin Xia *
Y
Yifan Guan
G
G. F. Xu
L
Long Chen
Y
Yi Liu
Y
Yi Wang
DOI:10.1016/j.neucom.2026.133713delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Graph classification aims to categorize entire graphs based on their topology and node properties. Previous methods have focused on learning graph structure from both the graph-level topology and node-level properties. However, existing pooling and coarsening strategies often suffer from information loss by collapsing nodes into clusters without preserving the intrinsic structural nuances of subdomains. To this end, we propose a novel Multi-Granularity Graph Refinement method (MGGR) that shifts the paradigm from simple graph compression to adaptive structural decomposition. Distinct from traditional methods, MGGR leverages Granular Ball Computing to recursively decompose the graph into subdomains that achieve an optimal balance between topological density and semantic homogeneity. Specifically, we propose a fine-grained segmentation mechanism to resolve the graph into meaningful granules. Furthermore, a Hierarchical Granular Graph Encoder is developed to explicitly capture both the intra-domain granular characteristics and the inter-domain structural dependencies, effectively leveraging the robust inductive bias inherent in the multi-granularity decomposition. We evaluate MGGR on 9 benchmark datasets containing over 169,306 graphs in total. Results show that MGGR notably outperforms current state-of-the-art methods. Moreover, the organic integration of multi-granularity decomposition and hierarchical encoding significantly enhances the model’s structural resilience, enabling MGGR to maintain stable performance even under 20% label noise. Code is available at https://anonymous.4open.science/r/MGGR/ .
Keywords:
Graph classification
Multi-granularity decomposition
Granular Ball Computing
Hierarchical Graph Encoder
Structural resilience

Journal

Neurocomputing cover
Neurocomputing
IF:
6.5
Papers:
2.5W
Citations:
6.5W

Organization

A
ant group
Scholars:
237
Papers: 119
Citations: 0
C
Chongqing University of Posts and Telecommunications
Scholars:
2.5K
Papers: 980
Citations: 3.8K
Cited Papers

Cited Papers

Propagation kernels: efficient graph kernels from propagated information
err2015-07-17
err152
errOAAI
errNeumann, Marion; Garnett, Roman; Bauckhage, Christian; Kersting, Kristian
errShare
errSave
Granular ball computing classifiers for efficient, scalable and robust learning
err2019-05-01
err0
PREAI
errShuyin Xia; Yunsheng Liu; Xin Ding; Guoyin Wang; Hong Yu; Yuoguo Luo
errShare
errSave
An Efficient Spectral Clustering Algorithm Based on Granular-Ball
err2023-09-01
err24
PREAI
errXie, Jiang; Kong, Weiyu; Xia, Shuyin; Wang, Guoyin; Gao, Xinbo
errShare
errSave
Using graph theory to analyze biological networks
err2011-04-28
err540
errOAAI
errPavlopoulos, Georgios A.; Secrier, Maria; Moschopoulos, Charalampos N.; Soldatos, Theodoros G.; Kossida, Sophia; Aerts, Jan; Schneider, Reinhard; Bagos, Pantelis G.
errShare
errSave
CCGIB: A Cross-Channel Graph Information Bottleneck Principle
err2024-01-01
err0
PREAI
errFan, Xiaolong; Gong, Maoguo; Wu, Yue; Zhang, Mingyang; Li, Hao; Jiang, Xiangming
errShare
errSave
Graph representation learning: a survey
err2020-01-01
err0
errOAAI
errFenxiao Chen; Yun-Cheng Wang; Bin Wang; C.-C. Jay Kuo
errShare
errSave
Deep learning
err2015-05-27
err0
PREAI
errYann LeCun; Yoshua Bengio; Geoffrey Hinton
errShare
errSave
researcher View more