A Benchmark for Semi-Inductive Link Prediction in Knowledge Graphs
Submission Type: Regular Short Paper
Submission Track: Question Answering
Submission Track 2: Resources and Evaluation
Keywords: semi-inductive, link prediction, knowledge graph, unseen entity
TL;DR: We describe a large-scale benchmark for semi-induct link prediction study the performance of recent approaches.
Abstract: Semi-inductive link prediction (LP) in knowledge graphs (KG) is the task of predicting facts for new, previously unseen entities based on context information. Although new entities can be integrated by retraining the model from scratch in principle, such an approach is infeasible for large-scale KGs, where retraining is expensive and new entities may arise frequently. In this paper, we propose and describe a large-scale benchmark to evaluate semi-inductive LP models. The benchmark is based on and extends Wikidata5M: It provides transductive, k-shot, and 0-shot LP tasks, each varying the available information from (i) only KG structure, to (ii) including textual mentions, and (iii) detailed descriptions of the entities. We report on a small study of recent approaches and found that semi-inductive LP performance is far from transductive performance on long-tail entities throughout all experiments. The benchmark provides a test bed for further research into integrating context and textual information in semi-inductive LP models.
Submission Number: 3964
Loading