Dynamic Graph with Similarity-Aware Attention Graph Neural Network for Recommender Systems
Aadarsh Senapati, Neha Kujur, Vivek Yelleti

TL;DR
This paper introduces DG-SA-GNN, a dynamic graph neural network that constructs and updates multiple user similarity graphs during training, improving recommendation accuracy by capturing evolving preferences.
Contribution
It proposes a novel framework combining dynamic multi-similarity graph construction with attention-based fusion for enhanced recommender system performance.
Findings
DG-SA-GNN outperforms LightGCN in Recall@20 on MovieLens100K.
Dynamic graph reconstruction during training improves adaptability.
Multi-similarity propagation enhances user preference modeling.
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
