INDIGO: GNN-Based Inductive Knowledge Graph Completion Using Pair-Wise EncodingDownload PDF

May 21, 2021 (edited Oct 30, 2021)NeurIPS 2021 PosterReaders: Everyone
  • Keywords: Knowledge Graph Completion, Graph Neural Networks
  • TL;DR: We propose a novel GNN-based approach with pair-wise encoding for inductive knowledge graph completion problem.
  • Abstract: The aim of knowledge graph (KG) completion is to extend an incomplete KG with missing triples. Popular approaches based on graph embeddings typically work by first representing the KG in a vector space, and then applying a predefined scoring function to the resulting vectors to complete the KG. These approaches work well in transductive settings, where predicted triples involve only constants seen during training; however, they are not applicable in inductive settings, where the KG on which the model was trained is extended with new constants or merged with other KGs. The use of Graph Neural Networks (GNNs) has recently been proposed as a way to overcome these limitations; however, existing approaches do not fully exploit the capabilities of GNNs and still rely on heuristics and ad-hoc scoring functions. In this paper, we propose a novel approach, where the KG is fully encoded into a GNN in a transparent way, and where the predicted triples can be read out directly from the last layer of the GNN without the need for additional components or scoring functions. Our experiments show that our model outperforms state-of-the-art approaches on inductive KG completion benchmarks.
  • Supplementary Material: zip
  • Code Of Conduct: I certify that all co-authors of this work have read and commit to adhering to the NeurIPS Statement on Ethics, Fairness, Inclusivity, and Code of Conduct.
  • Code: https://github.com/shuwen-liu-ox/INDIGO
10 Replies

Loading