Attributed Graph Learning with 2-D Graph Convolution

Qimai Li, Xiaotong Zhang, Han Liu, Xiao-Ming Wu

TL;DR: We propose a novel 2-D graph convolution framework to jointly model node relations and attribute relations for attributed graph learning.

Abstract: Graph convolutional neural networks have demonstrated promising performance in attributed graph learning, thanks to the use of graph convolution that effectively combines graph structures and node features for learning node representations. However, one intrinsic limitation of the commonly adopted 1-D graph convolution is that it only exploits graph connectivity for feature smoothing, which may lead to inferior performance on sparse and noisy real-world attributed networks. To address this problem, we propose to explore relational information among node attributes to complement node relations for representation learning. In particular, we propose to use 2-D graph convolution to jointly model the two kinds of relations and develop a computationally efficient dimensionwise separable 2-D graph convolution (DSGC). Theoretically, we show that DSGC can reduce intra-class variance of node features on both the node dimension and the attribute dimension to facilitate learning. Empirically, we demonstrate that by incorporating attribute relations, DSGC achieves significant performance gain over state-of-the-art methods on node classification and clustering on several real-world attributed networks.

Keywords: 2-D Graph Convolution, Attributed Graph, Representation learning

Community Implementations: [ 1 code implementation](https://www.catalyzex.com/paper/arxiv:1909.12038/code)