S$^2$DN: Learning to Denoise Unconvincing Knowledge for Inductive Knowledge Graph Completion

• URL: http://arxiv.org/abs/2412.15822v1
• Date: Fri, 20 Dec 2024 12:03:33 GMT
• Title: S$^2$DN: Learning to Denoise Unconvincing Knowledge for Inductive Knowledge Graph Completion
• Authors: Tengfei Ma, Yujie Chen, Liang Wang, Xuan Lin, Bosheng Song, Xiangxiang Zeng,
• Abstract summary: We propose a Semantic Structure-aware Denoising Network (S$2$DN) for inductive Knowledge Graph Completion. Our goal is to learn adaptable general semantics and reliable structures to distill consistent semantic knowledge. Experiments conducted on three benchmark KGs demonstrate that S$2$DN surpasses the performance of state-of-the-art models.
• Score: 19.09682423796942
• License:
• Abstract: Inductive Knowledge Graph Completion (KGC) aims to infer missing facts between newly emerged entities within knowledge graphs (KGs), posing a significant challenge. While recent studies have shown promising results in inferring such entities through knowledge subgraph reasoning, they suffer from (i) the semantic inconsistencies of similar relations, and (ii) noisy interactions inherent in KGs due to the presence of unconvincing knowledge for emerging entities. To address these challenges, we propose a Semantic Structure-aware Denoising Network (S$^2$DN) for inductive KGC. Our goal is to learn adaptable general semantics and reliable structures to distill consistent semantic knowledge while preserving reliable interactions within KGs. Specifically, we introduce a semantic smoothing module over the enclosing subgraphs to retain the universal semantic knowledge of relations. We incorporate a structure refining module to filter out unreliable interactions and offer additional knowledge, retaining robust structure surrounding target links. Extensive experiments conducted on three benchmark KGs demonstrate that S$^2$DN surpasses the performance of state-of-the-art models. These results demonstrate the effectiveness of S$^2$DN in preserving semantic consistency and enhancing the robustness of filtering out unreliable interactions in contaminated KGs.

Related papers

• ADKGD: Anomaly Detection in Knowledge Graphs with Dual-Channel Training [38.3788247358102]
  This paper presents an anomaly detection algorithm in knowledge graphs with dual-channel learning (ADKGD) We introduce a kullback-leibler (KL)-loss component to improve the accuracy of the scoring function between the dual channels. Experimental results demonstrate that ADKGD outperforms the state-of-the-art anomaly detection algorithms.
  arXiv  Detail & Related papers  (2025-01-13T06:22:52Z)
• Query-Enhanced Adaptive Semantic Path Reasoning for Inductive Knowledge Graph Completion [45.9995456784049]
  This paper proposes the Query-Enhanced Adaptive Semantic Path Reasoning (QASPR) framework. QASPR captures both the structural and semantic information of KGs to enhance the inductive KGC task. experimental results demonstrate that QASPR achieves state-of-the-art performance.
  arXiv  Detail & Related papers  (2024-06-04T11:02:15Z)
• EntailE: Introducing Textual Entailment in Commonsense Knowledge Graph Completion [54.12709176438264]
  Commonsense knowledge graphs (CSKGs) utilize free-form text to represent named entities, short phrases, and events as their nodes. Current methods leverage semantic similarities to increase the graph density, but the semantic plausibility of the nodes and their relations are under-explored. We propose to adopt textual entailment to find implicit entailment relations between CSKG nodes, to effectively densify the subgraph connecting nodes within the same conceptual class.
  arXiv  Detail & Related papers  (2024-02-15T02:27:23Z)
• 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)
• KGTrust: Evaluating Trustworthiness of SIoT via Knowledge Enhanced Graph Neural Networks [63.531790269009704]
  Social Internet of Things (SIoT) is a promising and emerging paradigm that injects the notion of social networking into smart objects (i.e., things) Due to the risks and uncertainty, a crucial and urgent problem to be settled is establishing reliable relationships within SIoT, that is, trust evaluation. We propose a novel knowledge-enhanced graph neural network (KGTrust) for better trust evaluation in SIoT.
  arXiv  Detail & Related papers  (2023-02-22T14:24:45Z)
• 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)
• Knowledge Graph Augmented Network Towards Multiview Representation Learning for Aspect-based Sentiment Analysis [96.53859361560505]
  We propose a knowledge graph augmented network (KGAN) to incorporate external knowledge with explicitly syntactic and contextual information. KGAN captures the sentiment feature representations from multiple perspectives, i.e., context-, syntax- and knowledge-based. Experiments on three popular ABSA benchmarks demonstrate the effectiveness and robustness of our KGAN.
  arXiv  Detail & Related papers  (2022-01-13T08:25:53Z)
• 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)
• KGSynNet: A Novel Entity Synonyms Discovery Framework with Knowledge Graph [23.053995137917994]
  We propose a novel entity synonyms discovery framework, named emphKGSynNet. Specifically, we pre-train subword embeddings for mentions and entities using a large-scale domain-specific corpus. We employ a specifically designed emphfusion gate to adaptively absorb the entities' knowledge information into their semantic features.
  arXiv  Detail & Related papers  (2021-03-16T07:32:33Z)
• Learning Intents behind Interactions with Knowledge Graph for Recommendation [93.08709357435991]
  Knowledge graph (KG) plays an increasingly important role in recommender systems. Existing GNN-based models fail to identify user-item relation at a fine-grained level of intents. We propose a new model, Knowledge Graph-based Intent Network (KGIN)
  arXiv  Detail & Related papers  (2021-02-14T03:21:36Z)

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.