Relation-aware context aggregation framework for sparse knowledge graph completion

The task of knowledge graph completion (KGC) is to infer missing links that exist between entities in knowledge graphs (KGs). However, real-world KGs are typically structurally sparse, resulting in insufficient neighborhood context and thus degraded KGC performance. Meanwhile, most existing methods adopt coarse-grained relation modeling and overlook meaningful semantic representations of relations. To tackle these issues, we propose relation-aware context aggregation (RACA) for sparse KGC. Specifically, we introduce a dual-mode relational learning mechanism that jointly learns from both within-relation and across-relation perspectives, capturing task-relevant dimensional semantics within each relation and implicit logical regularities across relations. A spatial gating unit is further designed to integrate these relational signals and generate expressive relation representations. Finally, we develop a dynamic relation attention network that leverages relation-aware features to dynamically guide contextual aggregation, enabling more effective context capture under sparsity. Extensive experiments on three benchmark datasets show that RACA achieves superior performance over state-of-the-art baselines, particularly in sparse scenarios.

Authors

Institutions

Publication Details

Journal
Scientific Reports
Published
2026-05-27
DOI
https://doi.org/10.1038/s41598-026-54601-1
Primary Topic
Advanced Graph Neural Networks
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Relation-aware context aggregation framework for sparse knowledge graph completion

Shaoyun Guan, Xuena Han
Scientific Reports
Advanced Graph Neural Networks
article

Relation-aware context aggregation framework for sparse knowledge graph completion

Shaoyun Guan, Xuena Han
article en

Abstract

The task of knowledge graph completion (KGC) is to infer missing links that exist between entities in knowledge graphs (KGs). However, real-world KGs are typically structurally sparse, resulting in insufficient neighborhood context and thus degraded KGC performance. Meanwhile, most existing methods adopt coarse-grained relation modeling and overlook meaningful semantic representations of relations. To tackle these issues, we propose relation-aware context aggregation (RACA) for sparse KGC. Specifically, we introduce a dual-mode relational learning mechanism that jointly learns from both within-relation and across-relation perspectives, capturing task-relevant dimensional semantics within each relation and implicit logical regularities across relations. A spatial gating unit is further designed to integrate these relational signals and generate expressive relation representations. Finally, we develop a dynamic relation attention network that leverages relation-aware features to dynamically guide contextual aggregation, enabling more effective context capture under sparsity. Extensive experiments on three benchmark datasets show that RACA achieves superior performance over state-of-the-art baselines, particularly in sparse scenarios.

Scientific Reports
Harbin Engineering University (CN), Harbin University of Commerce (CN)
Openalex Percentile: Top 5%
Advanced Graph Neural Networks
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Relation-aware context aggregation framework for sparse knowledge graph completion — Shaoyun Guan, Xuena Han · Scientific Reports (2026) | TGRS Research Map | TGRS