Modeling Relational Data with Graph Convolutional Networks
Michael Schlichtkrull, Thomas Kipf, Peter Bloem et al. · Lecture notes in computer science · 2018
Knowledge graphs enable a wide variety of applications, including question answering and information retrieval. Despite the great effort invested in their creation and maintenance, even the largest (e.g., Yago, DBPedia or Wikidata) remain incomplete. We introduce Relational Graph Convolutional Networks (R-GCNs) and apply them to two standard knowledge base completion tasks: Link prediction (recovery of missing facts, i.e. subject-predicate-object triples) and entity classification (recovery of missing entity attributes). R-GCNs are related to a recent class of neural networks operating on graphs, and are developed specifically to handle the highly multi-relational data characteristic of realistic knowledge bases. We demonstrate the effectiveness of R-GCNs as a stand-alone model for entity classification. We further show that factorization models for link prediction such as DistMult can be significantly improved through the use of an R-GCN encoder model to accumulate evidence over multiple inference steps in the graph, demonstrating a large improvement of 29.8% on FB15k-237 over a decoder-only baseline.
Cited by 5,096 works. doi:10.1007/978-3-319-93417-4_38
Authors
References
- Distributed Representations of Words and Phrases and their Compositionality
- Tensor Decompositions and Applications
- The Graph Neural Network Model
- Semi-Supervised Classification with Graph Convolutional Networks
- Translating Embeddings for Modeling Multi-relational Data
- Inductive Representation Learning on Large Graphs
- Neural Message Passing for Quantum Chemistry
- Reasoning With Neural Tensor Networks for Knowledge Base Completion
- A Three-Way Model for Collective Learning on Multi-Relational Data
- Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering