Graph Attention Collaborative Similarity Embedding For Recommender System

Abstract

We present Graph Attention Collaborative Similarity Embedding (GACSE), a new recommendation framework that exploits collaborative information in the user-item bipartite graph for representation learning. Our framework consists of two parts: the first part is to learn explicit graph collaborative filtering information such as user-item association through embedding propagation with attention mechanism, and the second part is to learn implicit graph collaborative information such as user-user similarities and item-item similarities through auxiliary loss. We design a new loss function that combines BPR loss with adaptive margin and similarity loss for the similarities learning. Extensive experiments on three benchmarks show that our model is consistently better than the latest state-of-the-art models.

Stats

• citations4
• S2 citations—
• github stars0
• HF likes0
• heat score5.24
• arxiv keysong2021graph

Related papers

• Collaborative Similarity Embedding For Recommender Systems (2019)13.93
• Combigcn: An Effective GCN Model For Recommender System (2025)6.77
• Unsupervised Graph Embeddings For Session-based Recommendation With Item Features (2025)0.00
• Beyond Similarity: Relation Embedding With Dual Attentions For Item-based Recommendation (2019)0.00
• HS-GCN: Hamming Spatial Graph Convolutional Networks For Recommendation (2023)11.67
• Rankgraph: Unified Heterogeneous Graph Learning For Cross-domain Recommendation (2025)3.58
• Learning To Hash With Graph Neural Networks For Recommender Systems (2020)14.02
• Hebbian Graph Embeddings (2019)0.00