We present graph partition neural networks (GPNN), an extension of graph neural networks (GNNs) able to handle extremely large graphs. GPNNs alternate between locally propagating information between nodes in small subgraphs and globally propagating information between the subgraphs. To efficiently partition graphs, we experiment with several partitioning algorithms and also propose a novel variant for fast processing of large scale graphs. We extensively test our model on a variety of semi-supervised node classification tasks. Experimental results indicate that GPNNs are either superior or comparable to state-of-the-art methods on a wide variety of datasets for graph-based semi-supervised classification. We also show that GPNNs can achieve similar performance as standard GNNs with fewer propagation steps.
Graph Partition Neural Networks for Semi-Supervised Classification
Renjie Liao,Marc Brockschmidt,Daniel Tarlow,Alexander L. Gaunt,R. Urtasun,R. Zemel
Published 2018 in International Conference on Learning Representations
ABSTRACT
PUBLICATION RECORD
- Publication year
2018
- Venue
International Conference on Learning Representations
- Publication date
2018-02-11
- Fields of study
Mathematics, Computer Science
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-50 of 50 references · Page 1 of 1
CITED BY
Showing 1-82 of 82 citing papers · Page 1 of 1