Evidence map›Paper›PMID 42204336›Full record

ArticleScientific reports2026

Relation-aware context aggregation framework for sparse knowledge graph completion.

Shaoyun Guan, Xuena Han

Abstract read
In one paragraph

Article in Scientific reports, 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

2 authors.

Shaoyun GuanHeilongjiang Provincial Key Laboratory of Fluid Engineering Equipment and Digital Intelligence Technology, Harbin University of Commerce, Harbin, 150028, China. guanshy@hrbcu.edu.cn.
Xuena HanHarbin University of Commerce, Harbin, 150028, China.

Funding

Social Science Foundation of Heilongjian 25EDE020
6 · The paper itself

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.

Indexed as

Knowledge graph completionRelation-awareSparse knowledge graph

Identifiers

PMID42204336
PMCPMC13443622

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC-ND
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.