S$^2$DN: Learning to Denoise Unconvincing Knowledge for Inductive Knowledge Graph Completion
Tengfei Ma, Yujie Chen, Liang Wang, Xuan Lin, Bosheng Song, Xiangxiang, Zeng

TL;DR
This paper introduces S$^2$DN, a novel denoising network for inductive knowledge graph completion that improves semantic consistency and robustness by filtering unreliable interactions and preserving reliable structures.
Contribution
The paper proposes a semantic smoothing and structure refining modules within S$^2$DN to address noise and semantic inconsistency in inductive KGC, outperforming existing models.
Findings
S$^2$DN outperforms state-of-the-art models on three benchmark KGs.
The semantic smoothing module retains universal relation semantics.
The structure refining module effectively filters unreliable interactions.
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 (SDN) 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
Taxonomy
TopicsNeural Networks and Applications · Advanced Graph Neural Networks · Domain Adaptation and Few-Shot Learning
