CLiMF: collaborative less-is-more filtering

Authors:
Yue Shi;Alexandros Karatzoglou;Linas Baltrunas;Martha Larson;Nuria Oliver;Alan Hanjalic
Affiliations:
Delft University of Technology;Telefonica Research;Telefonica Research;Delft University of Technology;Telefonica Research;Delft University of Technology
Venue:
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Year:
2013

Citing 12
Cited 0

GroupLens: an open architecture for collaborative filtering of netnews

CSCW '94 Proceedings of the 1994 ACM conference on Computer supported cooperative work
Toward the Next Generation of Recommender Systems: A Survey of the State-of-the-Art and Possible Extensions

IEEE Transactions on Knowledge and Data Engineering
Less is more: probabilistic models for retrieving fewer relevant documents

SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
A support vector method for optimizing average precision

SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
Collaborative Filtering for Implicit Feedback Datasets

ICDM '08 Proceedings of the 2008 Eighth IEEE International Conference on Data Mining
BPR: Bayesian personalized ranking from implicit feedback

UAI '09 Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence
Gradient descent optimization of smoothed information retrieval metrics

Information Retrieval
On statistical analysis and optimization of information retrieval effectiveness metrics

Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval
Performance of recommender algorithms on top-n recommendation tasks

Proceedings of the fourth ACM conference on Recommender systems
RECON: a reciprocal recommender for online dating

Proceedings of the fourth ACM conference on Recommender systems
Item popularity and recommendation accuracy

Proceedings of the fifth ACM conference on Recommender systems
MyMediaLite: a free recommender system library

Proceedings of the fifth ACM conference on Recommender systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 capturing 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 show that CLiMF significantly outperforms a naive baseline and two state-of-the-art CF methods.