Efficient GNN-based social recommender systems through social graph refinement

  • Ga, Sangmin
  • Cho, Paul Hyunbin
  • Moon, Gordon Euhyun
  • Jung, Sungwon
Citations

WEB OF SCIENCE

5
Citations

SCOPUS

7

초록

Precisely recommending relevant items to users is a challenging task because the user's rating can be influenced by various features. Therefore, social recommender systems have recently been introduced to leverage both the user-item interaction graph and the user-user social relation graph for more accurate rating predictions. Moreover, as graph neural networks (GNN) have demonstrated superior performance in graph representation learning, several algorithms have been developed to incorporate GNN into social recommender systems. However, when the sizes of the social graph and user-item graph are very large, the computational demands of existing GNN-based social recommender systems for aggregating user and item nodes becomes the primary bottleneck. In this paper, we develop a novel lightweight GNN-based social recommender system (called LiteGSR) that effectively reduces the computational overhead associated with aggregation operations while maintaining accuracy. To achieve this, we propose a new approach for refining the social graph by utilizing PageRank-based centrality scores of users and adapting representative virtual users in the user-item graph. Experimental results demonstrate that our new social recommender systems outperform existing state-of-the-art recommender systems in both accuracy and training time.

키워드

Social recommender systemsGraph neural networksSocial graph refinementPageRank
제목
Efficient GNN-based social recommender systems through social graph refinement
저자
Ga, SangminCho, Paul HyunbinMoon, Gordon EuhyunJung, Sungwon
DOI
10.1007/s11227-024-06682-w
발행일
2025-01
유형
Article
저널명
Journal of Supercomputing
81
1