Efficient Knowledge Graph Validation via Cross-Graph Representation Learning

• URL: http://arxiv.org/abs/2008.06995v1
• Date: Sun, 16 Aug 2020 20:51:17 GMT
• Title: Efficient Knowledge Graph Validation via Cross-Graph Representation Learning
• Authors: Yaqing Wang, Fenglong Ma, Jing Gao
• Abstract summary: noisy facts are unavoidably introduced into Knowledge Graphs that could be caused by automatic extraction. We propose a cross-graph representation learning framework, i.e., CrossVal, which can leverage an external KG to validate the facts in the target KG efficiently.
• Score: 40.570585195713704
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Recent advances in information extraction have motivated the automatic construction of huge Knowledge Graphs (KGs) by mining from large-scale text corpus. However, noisy facts are unavoidably introduced into KGs that could be caused by automatic extraction. To validate the correctness of facts (i.e., triplets) inside a KG, one possible approach is to map the triplets into vector representations by capturing the semantic meanings of facts. Although many representation learning approaches have been developed for knowledge graphs, these methods are not effective for validation. They usually assume that facts are correct, and thus may overfit noisy facts and fail to detect such facts. Towards effective KG validation, we propose to leverage an external human-curated KG as auxiliary information source to help detect the errors in a target KG. The external KG is built upon human-curated knowledge repositories and tends to have high precision. On the other hand, although the target KG built by information extraction from texts has low precision, it can cover new or domain-specific facts that are not in any human-curated repositories. To tackle this challenging task, we propose a cross-graph representation learning framework, i.e., CrossVal, which can leverage an external KG to validate the facts in the target KG efficiently. This is achieved by embedding triplets based on their semantic meanings, drawing cross-KG negative samples and estimating a confidence score for each triplet based on its degree of correctness. We evaluate the proposed framework on datasets across different domains. Experimental results show that the proposed framework achieves the best performance compared with the state-of-the-art methods on large-scale KGs.

Related papers

• Few-shot Knowledge Graph Relational Reasoning via Subgraph Adaptation [51.47994645529258]
  Few-shot Knowledge Graph (KG) Reasoning aims to predict unseen triplets (i.e., query triplets) for rare relations in KGs. We propose SAFER (Subgraph Adaptation for Few-shot Reasoning), a novel approach that effectively adapts the information in contextualized graphs to various subgraphs.
  arXiv  Detail & Related papers  (2024-06-19T21:40:35Z)
• Context Graph [8.02985792541121]
  We present a context graph reasoning textbfCGR$3$ paradigm that leverages large language models (LLMs) to retrieve candidate entities and related contexts. Our experimental results demonstrate that CGR$3$ significantly improves performance on KG completion (KGC) and KG question answering (KGQA) tasks.
  arXiv  Detail & Related papers  (2024-06-17T02:59:19Z)
• Deep Outdated Fact Detection in Knowledge Graphs [13.711099395945988]
  This paper presents DEAN, a novel deep learning-based framework designed to identify outdated facts within Knowledge Graphs (KGs) DEAN distinguishes itself by capturing implicit structural information among facts through comprehensive modeling of both entities and relations. Experimental results demonstrate the effectiveness and superiority of DEAN over state-of-the-art baseline methods.
  arXiv  Detail & Related papers  (2024-02-06T05:58:15Z)
• Improving the Robustness of Knowledge-Grounded Dialogue via Contrastive Learning [71.8876256714229]
  We propose an entity-based contrastive learning framework for improving the robustness of knowledge-grounded dialogue systems. Our method achieves new state-of-the-art performance in terms of automatic evaluation scores.
  arXiv  Detail & Related papers  (2024-01-09T05:16:52Z)
• Contrastive Knowledge Graph Error Detection [11.637359888052014]
  We propose a novel framework - ContrAstive knowledge Graph Error Detection (CAGED) CAGED introduces contrastive learning into KG learning and provides a novel way of modeling KG. It outperforms state-of-the-art methods in KG error detection.
  arXiv  Detail & Related papers  (2022-11-18T05:01:19Z)
• Explainable Sparse Knowledge Graph Completion via High-order Graph Reasoning Network [111.67744771462873]
  This paper proposes a novel explainable model for sparse Knowledge Graphs (KGs) It combines high-order reasoning into a graph convolutional network, namely HoGRN. It can not only improve the generalization ability to mitigate the information insufficiency issue but also provide interpretability.
  arXiv  Detail & Related papers  (2022-07-14T10:16:56Z)
• BertNet: Harvesting Knowledge Graphs with Arbitrary Relations from Pretrained Language Models [65.51390418485207]
  We propose a new approach of harvesting massive KGs of arbitrary relations from pretrained LMs. With minimal input of a relation definition, the approach efficiently searches in the vast entity pair space to extract diverse accurate knowledge. We deploy the approach to harvest KGs of over 400 new relations from different LMs.
  arXiv  Detail & Related papers  (2022-06-28T19:46:29Z)
• Collaborative Knowledge Graph Fusion by Exploiting the Open Corpus [59.20235923987045]
  It is challenging to enrich a Knowledge Graph with newly harvested triples while maintaining the quality of the knowledge representation. This paper proposes a system to refine a KG using information harvested from an additional corpus.
  arXiv  Detail & Related papers  (2022-06-15T12:16:10Z)
• Trustworthy Knowledge Graph Completion Based on Multi-sourced Noisy Data [35.938323660176145]
  We propose a new trustworthy method that exploits facts for a knowledge graph 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 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.
  arXiv  Detail & Related papers  (2022-01-21T07:59:16Z)
• Link-Intensive Alignment for Incomplete Knowledge Graphs [28.213397255810936]
  In this work, we address the problem of aligning incomplete KGs with representation learning. Our framework exploits two feature channels: transitivity-based and proximity-based. The two feature channels are jointly learned to exchange important features between the input KGs. Also, we develop a missing links detector that discovers and recovers the missing links during the training process.
  arXiv  Detail & Related papers  (2021-12-17T00:41:28Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.