Collaborative Similarity Embedding for Recommender Systems
Chih-Ming Chen, Chuan-Ju Wang, Ming-Feng Tsai, Yi-Hsuan Yang
Code Available — Be the first to reproduce this paper.
ReproduceCode
- github.com/bdnf/SBX-Recommendation-Enginepytorch★ 0
- github.com/cnclabs/smorenone★ 0
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.
Tasks
Benchmark Results
| Dataset | Model | Metric | Claimed | Verified | Status |
|---|---|---|---|---|---|
| CiteULike | RATE-CSE | Recall@10 | 0.24 | — | Unverified |
| Echonest | RANK-CSE | Recall@10 | 0.14 | — | Unverified |
| Epinions-Extend | RANK-CSE | Recall@10 | 0.18 | — | Unverified |
| Frappe | RATE-CSE | Recall@10 | 33.47 | — | Unverified |
| Last.FM-360k | RANK-CSE | Recall@10 | 0.18 | — | Unverified |
| MovieLens-Latest | RATE-CSE | Recall@10 | 0.32 | — | Unverified |
| Netflix | RATE-CSE | Recall@10 | 0.2 | — | Unverified |