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

基于归一化流的神经过程用于少样本知识图谱补全

Normalizing Flow-based Neural Process for Few-Shot Knowledge Graph Completion

Monash University(莫纳什大学);Griffith University(格里菲斯大学)

Linhao Luo, Yuan-Fang Li, Gholamreza Haffari, Shirui Pan

AI总结:

本文提出NP-FKGC方法,将归一化流与神经过程结合建模知识图谱补全函数分布,并引入随机ManifoldE解码器和注意力关系路径图神经网络,以解决少样本知识图谱补全中的不确定性估计、复杂关系处理和路径信息利用问题,在三个公开数据集上取得最先进性能。

摘要:

知识图谱(KGs)作为一种结构化的知识表示形式,已在现实世界中得到广泛应用。近年来,少样本知识图谱补全(FKGC)旨在利用少量关联事实预测未见关系的缺失事实,已引起从业者和研究人员的日益关注。然而,现有的FKGC方法基于度量学习或元学习,往往面临分布外和过拟合问题。同时,它们无法估计预测中的不确定性,而这一点在少样本场景下至关重要,因为模型预测可能非常不可靠。此外,大多数方法无法处理复杂关系,并忽略了知识图谱中的路径信息,这极大地限制了其性能。本文提出了一种基于归一化流的神经过程用于少样本知识图谱补全(NP-FKGC)。具体而言,我们将归一化流与神经过程统一起来,对知识图谱补全函数的复杂分布进行建模。这提供了一种在估计不确定性的同时预测少样本关系事实的新方法。然后,我们提出了一种随机ManifoldE解码器,以结合神经过程并处理少样本场景下的复杂关系。为进一步提升性能,我们引入了一种基于注意力关系路径的图神经网络来捕获知识图谱中的路径信息。在三个公开数据集上的大量实验表明,我们的方法显著优于现有的FKGC方法,并取得了最先进的性能。代码可在 https://github.com/RManLuo/NP-FKGC.git 获取。

英文摘要:

Knowledge graphs (KGs), as a structured form of knowledge representation, have been widely applied in the real world. Recently, few-shot knowledge graph completion (FKGC), which aims to predict missing facts for unseen relations with few-shot associated facts, has attracted increasing attention from practitioners and researchers. However, existing FKGC methods are based on metric learning or meta-learning, which often suffer from the out-of-distribution and overfitting problems. Meanwhile, they are incompetent at estimating uncertainties in predictions, which is critically important as model predictions could be very unreliable in few-shot settings. Furthermore, most of them cannot handle complex relations and ignore path information in KGs, which largely limits their performance. In this paper, we propose a normalizing flow-based neural process for few-shot knowledge graph completion (NP-FKGC). Specifically, we unify normalizing flows and neural processes to model a complex distribution of KG completion functions. This offers a novel way to predict facts for few-shot relations while estimating the uncertainty. Then, we propose a stochastic ManifoldE decoder to incorporate the neural process and handle complex relations in few-shot settings. To further improve performance, we introduce an attentive relation path-based graph neural network to capture path information in KGs. Extensive experiments on three public datasets demonstrate that our method significantly outperforms the existing FKGC methods and achieves state-of-the-art performance. Code is available at https://github.com/RManLuo/NP-FKGC.git.

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

↑