Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
38 tokens/sec
GPT-4o
59 tokens/sec
Gemini 2.5 Pro Pro
41 tokens/sec
o3 Pro
7 tokens/sec
GPT-4.1 Pro
50 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Trustworthy Knowledge Graph Completion Based on Multi-sourced Noisy Data (2201.08580v1)

Published 21 Jan 2022 in cs.IR, cs.AI, and cs.DB

Abstract: 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.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (8)
  1. Jiacheng Huang (15 papers)
  2. Yao Zhao (272 papers)
  3. Wei Hu (308 papers)
  4. Zhen Ning (13 papers)
  5. Qijin Chen (43 papers)
  6. Xiaoxia Qiu (1 paper)
  7. Chengfu Huo (7 papers)
  8. Weijun Ren (20 papers)
Citations (13)