Modeling Relational Data with Graph Convolutional Networks

Code

• github.com/tkipf/relational-gcn
  Officialtf★ 0
• github.com/INK-USC/MHGRN
  pytorch★ 257
• github.com/shijx12/kqapro_baselines
  pytorch★ 138
• github.com/thiviyanT/torch-rgcn
  pytorch★ 134
• github.com/predict-idlab/RR-GCN
  pytorch★ 37
• github.com/guillaumejaume/tuto-dl-on-graphs
  pytorch★ 14
• github.com/anilakash/indkgc
  pytorch★ 9
• github.com/kracr/document-level-relation-extraction
  pytorch★ 8
• github.com/toooooodo/rgcn-linkprediction
  pytorch★ 0
• github.com/dglai/wsdm2022-challenge
  pytorch★ 0

Abstract

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 deal with 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 by enriching them with an encoder model to accumulate evidence over multiple inference steps in the relational graph, demonstrating a large improvement of 29.8% on FB15k-237 over a decoder-only baseline.

Tasks

Benchmark Results

Reproductions