Collaborative Similarity Embedding For Recommender Systems

Abstract

We present collaborative similarity embedding (CSE), a unified framework that exploits comprehensive collaborative relations available in a user-item bipartite graph for representation learning and recommendation. In the proposed framework, we differentiate two types of proximity relations: direct proximity and k-th order neighborhood proximity. While learning from the former exploits direct user-item associations observable from the graph, learning from the latter makes use of implicit associations such as user-user similarities and item-item similarities, which can provide valuable information especially when the graph is sparse. Moreover, for improving scalability and flexibility, we propose a sampling technique that is specifically designed to capture the two types of proximity relations. Extensive experiments on eight benchmark datasets show that CSE yields significantly better performance than state-of-the-art recommendation methods.

Stats

• citations71
• S2 citations—
• github stars0
• HF likes0
• heat score13.93
• arxiv keychen2019collaborative

Related papers

• Graph Attention Collaborative Similarity Embedding For Recommender System (2021)5.24
• Beyond Similarity: Relation Embedding With Dual Attentions For Item-based Recommendation (2019)0.00
• Embedding In Recommender Systems: A Survey (2023)0.00
• Combigcn: An Effective GCN Model For Recommender System (2025)6.77
• Unsupervised Graph Embeddings For Session-based Recommendation With Item Features (2025)0.00
• Saec: Similarity-aware Embedding Compression In Recommendation Systems (2019)0.00
• HS-GCN: Hamming Spatial Graph Convolutional Networks For Recommendation (2023)11.67
• Learning Similarity Preserving Binary Codes For Recommender Systems (2022)0.00