MearcAll papers

arXiv 1609.02907 · cs.LG stat.ML

Semi-Supervised Classification with Graph Convolutional Networks

Thomas N. Kipf, Max Welling

Claims were extracted automatically by reducer-1 on 2026-11-12. The paper's license does not allow republishing it, so long claims are shortened to a quotation. Read the full text on arXiv.

No reproduction recordedclm_6371163e
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.

ABSTRACT · page 1 · Automated extraction, not reviewed · 0 reviewed reproductions

No reproduction recordedclm_fd975b5c
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.

ABSTRACT · page 1 · Automated extraction, not reviewed · 0 reviewed reproductions

No reproduction recordedclm_bfa61d91
Firstly, we introduce a simple and well-behaved layer-wise propagation rule for neural network models which operate directly on graphs and show how it can be motivated from a first-order approximation … (excerpt)

I NTRODUCTION · page 1 · Automated extraction, not reviewed · 0 reviewed reproductions

No reproduction recordedclm_54103994
Secondly, we demonstrate how this form of a graph-based neural network model can be used for fast and scalable semi-supervised classification of nodes in a graph.

I NTRODUCTION · page 1 · Automated extraction, not reviewed · 0 reviewed reproductions

No reproduction recordedclm_7237f8df
Experiments on a number of datasets demonstrate that our model compares favorably both in classification accuracy and efficiency (measured in wall-clock time) against state-of-the-art methods for semi-supervised learning.

I NTRODUCTION · page 1 · Automated extraction, not reviewed · 0 reviewed reproductions

No reproduction recordedclm_4aec8e07
In the following, we show that the form of this propagation rule can be motivated1 via a first-order approximation of localized spectral filters on graphs (Hammond et al., 2011; Defferrard … (excerpt)

F AST APPROXIMATE CONVOLUTIONS ON GRAPHS · page 2 · Automated extraction, not reviewed · 0 reviewed reproductions

No reproduction recordedres_08cd6416
We show that in this setting, a number of simplifications (see Section 2.2) can be introduced to the original frameworks of Bruna et al. (2014) and Defferrard et al. (2016) … (excerpt)

N EURAL NETWORKS ON GRAPHS · page 5 · Automated extraction, not reviewed · 0 reviewed reproductions

No reproduction recordedclm_133c40bf
In the experiments demonstrated here, our method for semi-supervised node classification outperforms recent related methods by a significant margin.

S EMI -SUPERVISED MODEL · page 8 · Automated extraction, not reviewed · 0 reviewed reproductions

No reproduction recordedres_d9326fb0
We have further demonstrated that the proposed renormalized propagation model (Eq. 8) offers both improved efficiency (fewer parameters and operations, such as multiplication or addition) and better predictive performance on … (excerpt)

S EMI -SUPERVISED MODEL · page 8 · Automated extraction, not reviewed · 0 reviewed reproductions

No reproduction recordedclm_d13cce4e
We have introduced a novel approach for semi-supervised classification on graph-structured data.

C ONCLUSION · page 9 · Automated extraction, not reviewed · 0 reviewed reproductions

No reproduction recordedclm_d3d18063
In this setting, our model outperforms several recently proposed methods by a significant margin, while being computationally efficient.

C ONCLUSION · page 9 · Automated extraction, not reviewed · 0 reviewed reproductions

Reproduced one of these claims?

Record your result in the Mearc app on your own machine, then use Publish this result with this paper's id (1609.02907) and the claim id shown next to the claim. Mearc creates a file that holds only what you choose to publish. Add it to the public claim data by pull request; a maintainer other than you reviews it before it counts.