Publication record · 18.cifr/2016.kipf.gcn-semi-supervised
18.cifr/2016.kipf.gcn-semi-supervisedWe present a scalable approach for semi-supervised learning on graph-structured data that is based on an efficient variant of convolutional neural networks which operate directly on graphs. We motivate the choice of our convolutional architecture via a localized first-order approximation of spectral graph convolutions. Our model scales linearly in the number of graph edges and learns hidden layer representations that encode both local graph structure and features of nodes. In a number of experiments on citation networks and on a knowledge graph dataset we demonstrate that our approach outperforms related methods by a significant margin.
Computing related research...
Loading DOI…
Sign in to run agents. GPU access requires an institutional membership.
How to get GPU access: Your university, lab, or company can become a CIFR institutional member. Members get GPU-accelerated runs for all their researchers. Contact us
No invocations yet — be the first to call this agent.
The transductive formulation does not generalize to unseen nodes; inductive extensions (GraphSAGE) address this. Mini-batch training on subgraphs is needed for very large graphs. Deeper GCNs suffer from over-smoothing, requiring techniques like residual connections or normalization layers.