The Link Prediction is the task of predicting missing relations between entities of the knowledge graph. Recent work in link prediction has attempted to provide a model for increasing link prediction accuracy by using more layers in neural network architecture. In this paper, we propose a novel method of refining the knowledge graph so that link prediction operation can be performed more accurately using relatively fast translational models. Translational link prediction models, such as TransE, TransH, TransD, have less complexity than deep learning approaches. Our method uses the hierarchy of relationships and entities in the knowledge graph to add the entity information as auxiliary nodes to the graph and connect them to the nodes which contain this information in their hierarchy. Our experiments show that our method can significantly increase the performance of translational link prediction methods in H@10, MR, MRR.
翻译:链接预测是预测知识图各实体之间缺失关系的任务。最近进行的链接预测工作试图提供一个模型,通过在神经网络结构中使用更多层来提高链接预测准确性。在本文中,我们提议了一种改进知识图的新方法,以便使用相对快速的翻译模型更准确地进行链接预测操作。翻译链接预测模型,如TransE、TransH、TransD,比深层次的学习方法复杂得多。我们的方法是利用知识图中的关系和实体的等级,将实体信息作为图的辅助节点,并将其与包含其等级结构中信息的节点连接起来。我们的实验表明,我们的方法可以大大提高H@10、MR、MR和MR的翻译链接预测方法的性能。