Evidence map›Paper›PMID 42288633›Full record

ArticleScientific reports2026

Dual-adaptive imputation graph neural network for knowledge-aware recommendation.

Zhenge Huo, Huanhuan Liu, Xinglong Wu, Chenxing Xia, Bin Ge, Yu Zhang

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

6 authors.

Zhenge HuoSchool of Computer Science and Engineering, Anhui University of Science and Technology, Huainan, 232001, China.
Huanhuan LiuSchool of Computer Science and Engineering, Anhui University of Science and Technology, Huainan, 232001, China. hhliu@aust.edu.cn.
Xinglong WuSchool of Computer Science and Engineering, Anhui University of Science and Technology, Huainan, 232001, China.
Chenxing XiaSchool of Computer Science and Engineering, Anhui University of Science and Technology, Huainan, 232001, China.
Bin GeSchool of Computer Science and Engineering, Anhui University of Science and Technology, Huainan, 232001, China.
Yu ZhangSchool of Computer Science and Engineering, Anhui University of Science and Technology, Huainan, 232001, China.

Funding

Anhui Postdoctoral Science Foundation 2022B623Anhui Province Natural Science Foundation under Grant 1808085QF205Anhui Province New Era Education Quality Project (Graduate Education) Overseas Training 2024dshwyx019Anhui Province Young Key Teachers Overseas Study and Research Funding Project JWFX2023016Anhui University of Science and Technology Talent Introduction Research Fund Project 11941Huainan City Science and Technology Plan Project 2023A316Medical Special Cultivation Project of Anhui University of Science and Technology YZ2023H2B003National Natural Science Foundation of China 62102003Natural Science Foundation of Anhui Province 2508085MF167Research Fund Project of Anhui Provincial Education Department KJ2017A085
6 · The paper itself

Abstract

Recommender systems play a vital role in enhancing user experience by efficiently delivering personalized and relevant content. While knowledge graph-based recommender systems effectively alleviate the data sparsity and cold-start challenges of traditional approaches, they still suffer from two major limitations: (1) insufficient utilization of the user-item interaction matrix and (2) suboptimal integration of heterogeneous knowledge graph signals with collaborative information. In this work, we propose DAIGNN (Dual-Adaptive Imputation Graph Neural Network), a novel recommendation framework designed to overcome these limitations through three key innovations. First, we introduce a similarity-driven imputation mechanism that constructs an Imputation Graph using pseudo-ratings, thereby enhancing graph connectivity and significantly reducing data sparsity. Second, we incorporate multiple auxiliary information sources on both the user and item sides, enabling DAIGNN to capture richer contextual and relational semantics beyond conventional user-item interactions. Third, we develop a dual-adaptive feature fusion mechanism that learns optimal fusion weights to dynamically integrate heterogeneous information from multiple graph sources. Extensive experiments conducted on four real-world datasets demonstrate the superior effectiveness of DAIGNN. On average, it achieves a 3.1% improvement in AUC and a 2.0% improvement in F1-score over state-of-the-art baselines, confirming its robustness across diverse settings.

Indexed as

Feature fusionGraph neural networksKnowledge graphsRecommender systems

Identifiers

PMID42288633
PMCPMC13518815

What OpenQuestion holds

Textmetadata
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.