Type-augmented Relation Prediction in Knowledge Graphs

Authors

  • Zijun Cui Rensselaer Polytechnic Institute
  • Pavan Kapanipathi IBM Research
  • Kartik Talamadupula IBM Research
  • Tian Gao IBM Research
  • Qiang Ji Rensselaer Polytechnic Institute

Keywords:

Representation Learning

Abstract

Knowledge graphs (KGs) are of great importance to many real world applications, but they generally suffer from incomplete information in the form of missing relations between entities. Knowledge graph completion (also known as relation prediction) is the task of inferring missing facts given existing ones. Most of the existing work is proposed by maximizing the likelihood of observed instance-level triples. Not much attention, however, is paid to the ontological information, such as type information of entities and relations. In this work, we propose a type-augmented relation prediction (TaRP) method, where we apply both the type information and instance-level information for the relation prediction. In particular, type information and instance-level information are encoded as prior probabilities and likelihoods of relations respectively, and are combined by following the Bayes' rule. Our proposed TaRP method achieves significantly better performance than state-of-the-art methods on four benchmark datasets: FB15K, FB15K-237, YAGO26K-906, and DB111K-174. In addition, we show that the TaRP achieves the significantly improved data efficiency. More importantly, the type information extracted from a specific dataset can generalize well to different datasets through the proposed TaRP model.

Downloads

Published

2021-05-18

How to Cite

Cui, Z., Kapanipathi, P., Talamadupula, K., Gao, T., & Ji, Q. (2021). Type-augmented Relation Prediction in Knowledge Graphs. Proceedings of the AAAI Conference on Artificial Intelligence, 35(8), 7151-7159. Retrieved from https://ojs.aaai.org/index.php/AAAI/article/view/16879

Issue

Section

AAAI Technical Track on Machine Learning I