TL;DR
This paper introduces a novel 2-D graph convolution method that jointly models object links and attribute relations, improving node representation learning for classification and clustering tasks on real-world networks.
Contribution
It proposes a computationally efficient dimensionwise separable 2-D graph convolution (DSGC) that captures attribute relations, enhancing the modeling capability over traditional 1-D GCNs.
Findings
DSGC reduces intra-class variance in node features.
Modeling attribute relations improves performance on node classification.
DSGC outperforms state-of-the-art methods on real-world networks.
Abstract
Graph convolutional neural networks (GCN) have been the model of choice for graph representation learning, which is mainly due to the effective design of graph convolution that computes the representation of a node by aggregating those of its neighbors. However, existing GCN variants commonly use 1-D graph convolution that solely operates on the object link graph without exploring informative relational information among object attributes. This significantly limits their modeling capability and may lead to inferior performance on noisy and sparse real-world networks. In this paper, we explore 2-D graph convolution to jointly model object links and attribute relations for graph representation learning. Specifically, we propose a computationally efficient dimensionwise separable 2-D graph convolution (DSGC) for filtering node features. Theoretically, we show that DSGC can reduce…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsConvolution
