arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2302.02601cs.LGcs.AI
收藏

学习双层知识图的表示以实现超越链接预测的推理

Learning Representations of Bi-level Knowledge Graphs for Reasoning beyond Link Prediction

KAIST(韩国科学技术院)

Chanyoung Chung, Joyce Jiyoung Whang

AI总结:

提出双层知识图概念及BiVE模型,通过建模三元组间关系并利用随机游走数据增强,在三元组预测和条件链接预测等新任务上显著优于现有方法。

摘要:

知识图使用三元组表示已知事实。现有的知识图嵌入方法仅考虑实体之间的连接,而我们提出考虑三元组之间的关系。例如,考虑两个三元组 $T_1$ 和 $T_2$,其中 $T_1$ 是 (Academy_Awards, Nominates, Avatar),$T_2$ 是 (Avatar, Wins, Academy_Awards)。给定这两个基础层三元组,我们看到 $T_1$ 是 $T_2$ 的先决条件。在本文中,我们定义了一个更高层的三元组来表示三元组之间的关系,例如 $\langle T_1$, PrerequisiteFor, $T_2\rangle$,其中 PrerequisiteFor 是一个更高层的关系。我们定义了一个由基础层和更高层三元组组成的双层知识图。我们还提出了一种基于双层知识图上随机游走的数据增强策略,以增强合理的三元组。我们名为 BiVE 的模型通过考虑基础层和更高层三元组的结构来学习嵌入,并额外考虑了增强的三元组。我们提出了两个新任务:三元组预测和条件链接预测。给定一个三元组 $T_1$ 和一个更高层关系,三元组预测预测一个很可能通过该更高层关系连接到 $T_1$ 的三元组,例如 $\langle T_1$, PrerequisiteFor, ?$\rangle$。条件链接预测预测在给定另一个三元组的条件下,一个三元组中缺失的实体,例如 $\langle T_1$, PrerequisiteFor, (Avatar, Wins, ?)$\rangle$。实验结果表明,BiVE 在两个新任务和现实世界双层知识图中的典型基础层链接预测中显著优于所有其他方法。

英文摘要:

Knowledge graphs represent known facts using triplets. While existing knowledge graph embedding methods only consider the connections between entities, we propose considering the relationships between triplets. For example, let us consider two triplets $T_1$ and $T_2$ where $T_1$ is (Academy_Awards, Nominates, Avatar) and $T_2$ is (Avatar, Wins, Academy_Awards). Given these two base-level triplets, we see that $T_1$ is a prerequisite for $T_2$. In this paper, we define a higher-level triplet to represent a relationship between triplets, e.g., $\langle T_1$, PrerequisiteFor, $T_2\rangle$ where PrerequisiteFor is a higher-level relation. We define a bi-level knowledge graph that consists of the base-level and the higher-level triplets. We also propose a data augmentation strategy based on the random walks on the bi-level knowledge graph to augment plausible triplets. Our model called BiVE learns embeddings by taking into account the structures of the base-level and the higher-level triplets, with additional consideration of the augmented triplets. We propose two new tasks: triplet prediction and conditional link prediction. Given a triplet $T_1$ and a higher-level relation, the triplet prediction predicts a triplet that is likely to be connected to $T_1$ by the higher-level relation, e.g., $\langle T_1$, PrerequisiteFor, ?$\rangle$. The conditional link prediction predicts a missing entity in a triplet conditioned on another triplet, e.g., $\langle T_1$, PrerequisiteFor, (Avatar, Wins, ?)$\rangle$. Experimental results show that BiVE significantly outperforms all other methods in the two new tasks and the typical base-level link prediction in real-world bi-level knowledge graphs.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑