E-GCN: graph convolution with estimated labels

Abstract

G raph C onvolutional N etwork (GCN) has been commonly applied for semi-supervised learning tasks. However, the established GCN frequently only considers the given labels in the topology optimization, which may not deliver the best performance for semi-supervised learning tasks. In this paper, we propose a novel G raph C onvolutional N etwork with E stimated labels (E-GCN) for semi-supervised learning. The core design of E-GCN is to learn a suitable network topology for semi-supervised learning by linking both estimated labels and given labels in a centralized network framework. The major enhancement is that both given labels and estimated labels are utilized for the topology optimization in E-GCN, which assists the graph convolution implementation for unknown labels evaluation. Experimental results demonstrate that E-GCN is significantly better than s tate-o f-t he-a rt (SOTA) baselines without estimated labels.