CLiMF
Yue Shi, Alexandros Karatzoglou, Linas Baltrunas et al. · ACM Conference on Recommender Systems (RecSys) · 2012
In this paper we tackle the problem of recommendation in the scenarios with binary relevance data, when only a few (k) items are recommended to individual users. Past work on Collaborative Filtering (CF) has either not addressed the ranking problem for binary relevance datasets, or not specifically focused on improving top-k recommendations. To solve the problem we propose a new CF approach, Collaborative Less-is-More Filtering (CLiMF). In CLiMF the model parameters are learned by directly maximizing the Mean Reciprocal Rank (MRR), which is a well-known information retrieval metric for measuring the performance of top-k recommendations. We achieve linear computational complexity by introducing a lower bound of the smoothed reciprocal rank metric. Experiments on two social network datasets demonstrate the effectiveness and the scalability of CLiMF, and show that CLiMF significantly outperforms a naive baseline and two state-of-the-art CF methods.
Cited by 305 works. doi:10.1145/2365952.2365981
Authors
References
- GroupLens
- Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions
- Matrix Factorization Techniques for Recommender Systems
- Amazon.com recommendations: item-to-item collaborative filtering
- Probabilistic Matrix Factorization
- Collaborative Filtering for Implicit Feedback Datasets
- BPR: Bayesian Personalized Ranking from Implicit Feedback
- Latent semantic models for collaborative filtering
- Item-based top- N recommendation algorithms
- One-Class Collaborative Filtering