Inductive Relation Prediction by BERT
TL
TL;DR
This work proposes an all-in-one solution, called BERTRL (BERT-based Relational Learning), which leverages pre-trained language model and fine-tunes it by taking relation instances and their possible reasoning paths as training samples.
Abstract
Relation prediction in knowledge graphs is dominated by embedding based methods which mainly focus on the transductive setting. Unfortunately, they are not able to handle inductive learning where unseen entities and relations are present and cannot take advantage of prior knowledge. Furthermore, their inference process is not easily explainable. In this work, we propose an all-in-one solution, called BERTRL (BERT-based Relational Learning), which leverages pre-trained language model and fine-tunes it by taking relation instances and their possible reasoning paths as training samples. BERTRL outperforms the SOTAs in 15 out of 18 cases in both inductive and transductive settings. Meanwhile, it demonstrates strong generalization capability in few-shot learning and is explainable. The data and code can be found at https://github.com/zhw12/BERTRL.
References39 items
1
Topology-Aware Correlations Between Relations for Inductive Link Prediction in Knowledge Graphs
2
Communicative Message Passing for Inductive Relation Reasoning
3
Autoregressive Entity Retrieval
4
LibKGE - A knowledge graph embedding library for reproducible research
5