Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification
This paper introduces a novel framework called "Efficient and Scalable Granular-ball Graph Coarsening Method" to address the high computational overhead of Graph Convolutional Networks (GCNs) on large-scale graph datasets. The proposed method first employs a multi-granularity granular-ball graph coarsening algorithm to reduce the original graph into multiple subgraphs. This coarsening stage boasts linear time complexity, significantly outperforming existing methods. Subsequently, these granular-ball subgraphs are randomly sampled to form minibatches for GCN training. The algorithm adaptively and substantially reduces graph scale, thereby enhancing GCN training efficiency and scalability. Experimental results on various node classification datasets demonstrate superior performance, and the code is made publicly available.
Read more