arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2201.08580cs.IRcs.AIcs.DB

Trustworthy Knowledge Graph Completion Based on Multi-sourced Noisy Data

State Key Laboratory for Novel Software Technology(计算机软件新技术国家重点实验室);National Institute of Healthcare Data Science(国家健康医疗大数据研究院);Nanjing University(南京大学);Alibaba Group(阿里巴巴集团)

Jiacheng Huang, Yao Zhao, Wei Hu, Zhen Ning, Qijin Chen, Xiaoxia Qiu, Chengfu Huo, Weijun Ren

英文摘要:

Knowledge graphs (KGs) have become a valuable asset for many AI applications. Although some KGs contain plenty of facts, they are widely acknowledged as incomplete. To address this issue, many KG completion methods are proposed. Among them, open KG completion methods leverage the Web to find missing facts. However, noisy data collected from diverse sources may damage the completion accuracy. In this paper, we propose a new trustworthy method that exploits facts for a KG based on multi-sourced noisy data and existing facts in the KG. Specifically, we introduce a graph neural network with a holistic scoring function to judge the plausibility of facts with various value types. We design value alignment networks to resolve the heterogeneity between values and map them to entities even outside the KG. Furthermore, we present a truth inference model that incorporates data source qualities into the fact scoring function, and design a semi-supervised learning way to infer the truths from heterogeneous values. We conduct extensive experiments to compare our method with the state-of-the-arts. The results show that our method achieves superior accuracy not only in completing missing facts but also in discovering new facts.

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

↑