IRLGSIMay 2

Dynamic Graph with Similarity-Aware Attention Graph Neural Network for Recommender Systems

arXiv:2605.052387.8h-index: 2
Predicted impact top 98% in IR · last 90 daysOriginality Incremental advance
AI Analysis

For recommender systems, this work addresses the limitation of static graphs and lack of explicit user-user modeling, but the improvements are incremental and limited to a single small benchmark.

The paper proposes DG-SA-GNN, a framework that constructs dynamic user similarity graphs using multiple similarity functions and attention-based fusion, achieving Recall@20 of 0.162 and NDCG@20 of 0.065 on MovieLens100K, outperforming LightGCN in recall.

Recommender systems are essential components of modern online platforms which presents personalized content in various domain. The traditional collaborative filtering methods depends on static user-item interaction graphs and a limited subset of similarity measures which fail to capture the changing nature of preferences of an individual. Recent graph neural network (GNN) based approaches focus on user-item bipartite graphs which do not use explicit user-user relational modelling and dynamic graph evolution during training. To address these limitations, this paper proposes a Dynamic Graph SimilarityAware Attention Graph Neural Network (DG-SA-GNN) framework that integrates dynamic user similarity graph construction with multi-similarity propagation and attention-based aggregation. The proposed architecture constructs four parallel user similarity graphs using Cosine, Jaccard, Discounted Pearson Correlation Coefficient (Discount PCC), and IPIJ similarity functions, each processed by a dedicated UserGNN module. A Graph Transformer fuses the four graph views, and a CrossAttention module refines user embeddings through interaction with item embeddings. Crucially, the graphs are reconstructed at scheduled epochs during training, enabling the model to adapt to the learned embedding space constituting the dynamic graph component. Mini-batch training with hard negative sampling improves scalability and convergence. Experiments on the MovieLens100K benchmark demonstrate that DG-SA-GNN achieves a Recall@20 of 0.162 and NDCG@20 of 0.065 which is better than the LightGCN baseline in recall. The results validate that dynamic multi-similarity graph construction coupled with attention-based fusion which produce recommendation performance

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes