Name
Abstract | ||
|---|---|---|
Graphs are ubiquitous across the globe and within science and engineering. Some powerful classifiers are proposed to classify nodes in graphs, such as Graph Convolutional Networks (GCNs). However, as graphs are growing in size, node classification on large graphs can be space and time consuming due to using whole graphs. Hence, some questions are raised, particularly, whether one can prune some of the edges of a graph while maintaining prediction performance for node classification, or train classifiers on specific subgraphs instead of a whole graph with limited performance loss in node classification. To address these questions, we propose Sparsified Graph Convolutional Network (SGCN), a neural network graph sparsifier that sparsifies a graph by pruning some edges. We formulate sparsification as an optimization problem and solve it by an Alternating Direction Method of Multipliers (ADMM). The experiment illustrates that SGCN can identify highly effective subgraphs for node classification in GCN compared to other sparsifiers such as Random Pruning, Spectral Sparsifier and DropEdge. We also show that sparsified graphs provided by SGCN can be inputs to GCN, which leads to better or comparable node classification performance with that of original graphs in GCN, DeepWalk, GraphSAGE, and GAT. We provide insights on why SGCN performs well by analyzing its performance from the view of a low-pass filter. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1007/s41060-021-00288-8 | INTERNATIONAL JOURNAL OF DATA SCIENCE AND ANALYTICS |
Keywords | DocType | Volume |
Graph sparsification, Node classification, Graph convolutional network | Journal | 13 |
Issue | ISSN | Citations |
1 | 2364-415X | 0 |
PageRank | References | Authors |
0.34 | 0 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jiayu Li | 1 | 0 | 0.34 |
| Tianyun Zhang | 2 | 0 | 0.34 |
| Hao Tian | 3 | 0 | 0.68 |
| Shengmin Jin | 4 | 9 | 4.59 |
| Makan Fardad | 5 | 0 | 0.34 |
| Reza Zafarani | 6 | 0 | 0.34 |