Dynamic Graph Convolutional Network: A Topology Optimization Perspective

Abstract

Recently, graph convolutional networks(GCNs) have drawn increasing attention in many domains, e.g., social networks, recommendation systems. It's known that, in the task of graph node classification, inter-class edges connecting nodes from different categories often degrade the GCN model performance. On the other hand, a stronger intra-class connection in terms of the edge number and edge weights is always beneficial to node classification. Most existing GCN models assume that the topology and edge weights of the underlying graph are both fixed. However, real-world networks are often noisy and incomplete. To take into account such uncertainty in graph topology, we propose in this paper a dynamic graph convolution network (DyGCN), where edge weights are treated as learnable parameters. A novel adaptive edge dropping (AdaDrop) strategy is developed for DyGCN, such that even graph topology can be optimized. DyGCN is also a flexible architecture that can be readily combined with other deep GCN models to cope with the oversmoothness encountered when the network goes very deep. Experimental results demonstrate that the proposed DyGCN and its deep variants can achieve competitive classification accuracy in many datasets.