A multi-granularity granular-ball coarsening algorithm reduces large graphs in linear time for faster GCN training on node classification, with experiments claiming superior performance over prior methods.
Graph coarsening via convolution matching for scalable graph neural network training
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification
A multi-granularity granular-ball coarsening algorithm reduces large graphs in linear time for faster GCN training on node classification, with experiments claiming superior performance over prior methods.