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

VN网络:利用虚拟邻居嵌入新出现实体

VN Network: Embedding Newly Emerging Entities with Virtual Neighbors

University of Chinese Academy of Sciences(中国科学院大学);Institute of Information Engineering, Chinese Academy of Sciences(中国科学院信息工程研究所);Shandong University(山东大学);Tencent AI Lab(腾讯AI实验室)

Yongquan He, Zihan Wang, Peng Zhang, Zhaopeng Tu, Zhaochun Ren

AI总结:

本文提出虚拟邻居(VN)网络,通过规则推断虚拟邻居、利用逻辑与对称路径规则捕获远距离信息,并采用迭代学习方案,有效缓解新出现实体嵌入中的邻居稀疏性问题,在两个知识图谱补全任务上显著优于现有方法。

摘要:

近年来,将实体和关系嵌入到连续向量空间中引起了广泛关注。大多数嵌入方法假设所有测试实体在训练期间都是可用的,这使得为新出现的实体重新训练嵌入非常耗时。为了解决这一问题,近期工作将图神经网络应用于未见实体的现有邻居上。在本文中,我们提出了一种新颖的框架,即虚拟邻居(VN)网络,以应对三个关键挑战。首先,为了缓解邻居稀疏性问题,我们引入了由规则推断出的虚拟邻居的概念。并且我们通过求解一个规则约束问题为这些邻居分配软标签,而不是简单地将它们视为毫无疑问的真实邻居。其次,许多现有方法仅使用一跳或两跳邻居进行聚合,忽略了可能有帮助的远距离信息。相反,我们同时识别逻辑路径规则和对称路径规则以捕获复杂模式。最后,我们不是一次性注入规则,而是在嵌入方法和虚拟邻居预测之间采用迭代学习方案,以捕获其内部的交互。在两个知识图谱补全任务上的实验结果表明,我们的VN网络显著优于最先进的基线方法。此外,在Subject/Object-R上的结果表明,我们提出的VN网络对邻居稀疏性问题具有高度的鲁棒性。

英文摘要:

Embedding entities and relations into continuous vector spaces has attracted a surge of interest in recent years. Most embedding methods assume that all test entities are available during training, which makes it time-consuming to retrain embeddings for newly emerging entities. To address this issue, recent works apply the graph neural network on the existing neighbors of the unseen entities. In this paper, we propose a novel framework, namely Virtual Neighbor (VN) network, to address three key challenges. Firstly, to reduce the neighbor sparsity problem, we introduce the concept of the virtual neighbors inferred by rules. And we assign soft labels to these neighbors by solving a rule-constrained problem, rather than simply regarding them as unquestionably true. Secondly, many existing methods only use one-hop or two-hop neighbors for aggregation and ignore the distant information that may be helpful. Instead, we identify both logic and symmetric path rules to capture complex patterns. Finally, instead of one-time injection of rules, we employ an iterative learning scheme between the embedding method and virtual neighbor prediction to capture the interactions within. Experimental results on two knowledge graph completion tasks demonstrate that our VN network significantly outperforms state-of-the-art baselines. Furthermore, results on Subject/Object-R show that our proposed VN network is highly robust to the neighbor sparsity problem.

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

↑