Enhancing graph transformer encoding with graph heterogeneous memory for improved recommendation performance

Recommender systems are crucial for mitigating information overload, yet their effectiveness is often constrained by data sparsity. While graph neural networks (GNNs) have shown promise, existing models face a critical limitation: they typically handle either complex heterogeneous relationships or capture historical user dependencies, but struggle to address both simultaneously. To bridge this gap, we propose the Heterogeneous Graph Memory Transformer (HMT), a novel architecture that synergistically integrates a heterogeneous graph transformer with dedicated graph memory modules. HMT is designed to concurrently learn rich semantic representations from heterogeneous graphs and preserve long-range contextual information from user interaction histories, thereby creating more robust and accurate user and item embeddings. Extensive experiments on three benchmark datasets-Amazon, iFashion, and Yelp2018-demonstrate HMT's superior performance. Notably, our model achieves state-of-the-art N@5 scores of 0.3295, 0.4273, and 0.2748, respectively, significantly outperforming strong baselines. Further analyses confirm the model's robustness against data imbalance and noise. The HMT framework offers a promising direction for developing next-generation recommender systems capable of contending with the complex and dynamic nature of real-world user-item ecosystems.

Authors

Institutions

Publication Details

Journal
Scientific Reports
Published
2025-12-24
DOI
https://doi.org/10.1038/s41598-025-28266-1
Primary Topic
Advanced Graph Neural Networks
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Enhancing graph transformer encoding with graph heterogeneous memory for improved recommendation performance

Yuxi Lin, Tianhe Hou, Haiying Yu
Scientific Reports
Advanced Graph Neural Networks
article

Enhancing graph transformer encoding with graph heterogeneous memory for improved recommendation performance

Yuxi Lin, Tianhe Hou, Haiying Yu
article en

Abstract

Recommender systems are crucial for mitigating information overload, yet their effectiveness is often constrained by data sparsity. While graph neural networks (GNNs) have shown promise, existing models face a critical limitation: they typically handle either complex heterogeneous relationships or capture historical user dependencies, but struggle to address both simultaneously. To bridge this gap, we propose the Heterogeneous Graph Memory Transformer (HMT), a novel architecture that synergistically integrates a heterogeneous graph transformer with dedicated graph memory modules. HMT is designed to concurrently learn rich semantic representations from heterogeneous graphs and preserve long-range contextual information from user interaction histories, thereby creating more robust and accurate user and item embeddings. Extensive experiments on three benchmark datasets-Amazon, iFashion, and Yelp2018-demonstrate HMT's superior performance. Notably, our model achieves state-of-the-art N@5 scores of 0.3295, 0.4273, and 0.2748, respectively, significantly outperforming strong baselines. Further analyses confirm the model's robustness against data imbalance and noise. The HMT framework offers a promising direction for developing next-generation recommender systems capable of contending with the complex and dynamic nature of real-world user-item ecosystems.

Scientific ReportsVol. 15(1)
Heilongjiang University of Science and Technology (CN), Jingdong (China) (CN)
Responsible consumption and production
Openalex Percentile: Top 18%
Advanced Graph Neural Networks
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.