Translational distance-based knowledge graph embedding has shown progressive
improvements on the link prediction task, from TransE to the latest
state-of-the-art RotatE. However, N-1, 1-N and N-N predictions still remain
challenging. In this work, we propose a novel translational distance-based
approach for knowledge graph link prediction. The proposed method includes
two-folds, first we extend the RotatE from 2D complex domain to high dimension
space with orthogonal transforms to model relations for better modeling
capacity. Second, the graph context is explicitly modeled via two directed
context representations. These context representations are used as part of the
distance scoring function to measure the plausibility of the triples during
training and inference. The proposed approach effectively improves prediction
accuracy on the difficult N-1, 1-N and N-N cases for knowledge graph link
prediction task. The experimental results show that it achieves better
performance on two benchmark data sets compared to the baseline RotatE,
especially on data set (FB15k-237) with many high in-degree connection nodes.

本文提出了一种新的基于转化距离的知识图谱链接预测方法，通过将 RotatE 从二维复杂域扩展到高维空间以及利用两个有向关系的上下文表示方法，有效地提高了难以预测的 N-1、1-N 和 N-N 情形的预测精度。实验结果表明，与基线 RotatE 相比，该方法在两个基准数据集上表现得更好，特别是在连接节点数量较高的数据集（FB15k-237）上。