A graph neural network recommendation algorithm based on multi-scale attention and contrastive learning

When facing sparse user-item interaction data, recommendation systems often struggle to learn high-quality representations, which in turn affects the recommendation performance. To address this issue, this paper proposes a graph neural network-based recommendation algorithm with multi-scale attention and contrastive learning (GR-MC). First, a dedicated graph structure augmentation strategy based on user-focused edge dropout is designed to intentionally reduce the dominance of high-degree user nodes in neighbor aggregation, effectively alleviating degree bias and improving the model's generalization ability. Second, a multi-scale attention embedding propagation mechanism is proposed to enhance the modeling of higher-order neighbor relationships. Finally, by treating node self-discrimination as a self-supervised task, contrastive learning is introduced to provide auxiliary signals for representation learning, thereby improving the discriminative ability of embeddings and the robustness of the model. Experimental results show that GR-MC outperforms existing methods on multiple public datasets, especially on the highly sparse Amazon-book dataset, where Recall@20 improves by 24.69%, fully demonstrating its effectiveness and robustness in sparse environments.

Authors

Institutions

Publication Details

Journal
Scientific Reports
Published
2025-09-01
DOI
https://doi.org/10.1038/s41598-025-17925-y
Citations
2
Primary Topic
Recommender Systems and Techniques
Type
article
Field-Weighted Citation Impact
6.49

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A graph neural network recommendation algorithm based on multi-scale attention and contrastive learning

De-Yong Pu, Guofu Xie, Zhenghong Qian, Yaming Zhang
2 citations
Scientific Reports
Recommender Systems and Techniques
6.49
article

A graph neural network recommendation algorithm based on multi-scale attention and contrastive learning

De-Yong Pu, Guofu Xie, Zhenghong Qian, Yaming Zhang
article en
2 citations

Abstract

When facing sparse user-item interaction data, recommendation systems often struggle to learn high-quality representations, which in turn affects the recommendation performance. To address this issue, this paper proposes a graph neural network-based recommendation algorithm with multi-scale attention and contrastive learning (GR-MC). First, a dedicated graph structure augmentation strategy based on user-focused edge dropout is designed to intentionally reduce the dominance of high-degree user nodes in neighbor aggregation, effectively alleviating degree bias and improving the model's generalization ability. Second, a multi-scale attention embedding propagation mechanism is proposed to enhance the modeling of higher-order neighbor relationships. Finally, by treating node self-discrimination as a self-supervised task, contrastive learning is introduced to provide auxiliary signals for representation learning, thereby improving the discriminative ability of embeddings and the robustness of the model. Experimental results show that GR-MC outperforms existing methods on multiple public datasets, especially on the highly sparse Amazon-book dataset, where Recall@20 improves by 24.69%, fully demonstrating its effectiveness and robustness in sparse environments.

Scientific ReportsVol. 15(1)
Yunnan Normal University (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 3%
Recommender Systems and Techniques
6.49
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.