BiGCN: A Bi-directional Low-Pass Filtering Graph Neural Network
arXiv:2101.05519
Abstract
Graph convolutional networks (GCNs) have achieved great success on graph-structured data. Many graph convolutional networks can be thought of as low-pass filters for graph signals. In this paper, we propose a more powerful graph convolutional network, named BiGCN, that extends to bidirectional filtering. Specifically, we not only consider the original graph structure information but also the latent correlation between features, thus BiGCN can filter the signals along with both the original graph and a latent feature-connection graph. Compared with most existing GCNs, BiGCN is more robust and has powerful capacities for feature denoising. We perform node classification and link prediction in citation networks and co-purchase networks with three settings: noise-rate, noise-level and structure-mistakes. Extensive experimental results demonstrate that our model outperforms the state-of-the-art graph neural networks in both clean and artificially noisy data.
References in corpus (7)
- Inductive Representation Learning on Large Graphs
- Simplifying Graph Convolutional Networks
- Representation Learning on Graphs with Jumping Knowledge Networks
- Pitfalls of Graph Neural Network Evaluation
- FastGCN: Fast Learning with Graph Convolutional Networks via Importance Sampling
- Graph Neural Networks with convolutional ARMA filters
- Revisiting Graph Neural Networks: All We Have is Low-Pass Filters