Semi-Supervised Classification with Graph Convolutional Networks
T. Kipf, and M. Welling. Proceedings of the 5th International Conference on Learning Representations, (2017)
Abstract
We 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.
%0 Conference Paper
%1 Kipf:2016tc
%A Kipf, Thomas N.
%A Welling, Max
%B Proceedings of the 5th International Conference on Learning Representations
%D 2017
%K cnn embeddings graph thema thema:graph thema:ma
%T Semi-Supervised Classification with Graph Convolutional Networks
%U https://openreview.net/forum?id=SJU4ayYgl
%X We 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.
@inproceedings{Kipf:2016tc,
abstract = {We 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.},
added-at = {2019-08-12T10:14:24.000+0200},
author = {Kipf, Thomas N. and Welling, Max},
biburl = {https://www.bibsonomy.org/bibtex/271ee5be8cafc25d7a3869bcb49fc5c3c/tobias.koopmann},
booktitle = {Proceedings of the 5th International Conference on Learning Representations},
interhash = {54b65044b71f10c31476ed76422ab85d},
intrahash = {71ee5be8cafc25d7a3869bcb49fc5c3c},
keywords = {cnn embeddings graph thema thema:graph thema:ma},
location = {Palais des Congr{\`e}s Neptune, Toulon, France},
series = {ICLR '17},
timestamp = {2021-10-01T12:43:26.000+0200},
title = {{Semi-Supervised Classification with Graph Convolutional Networks}},
url = {https://openreview.net/forum?id=SJU4ayYgl},
venue = {ICLR},
year = 2017
}