Dual-adaptive imputation graph neural network for knowledge-aware recommendation
Abstract
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.
Article Details
Authors (6)
Zhenge Huo
Huanhuan Liu
Xinglong Wu
Chenxing Xia
Bin Ge
Yu Zhang
Xiangya Hospital, Central South University Changsha China