The Sample Complexity of Online One-Class Collaborative Filtering

05/31/2017
by   Reinhard Heckel, et al.
0

We consider the online one-class collaborative filtering (CF) problem that consists of recommending items to users over time in an online fashion based on positive ratings only. This problem arises when users respond only occasionally to a recommendation with a positive rating, and never with a negative one. We study the impact of the probability of a user responding to a recommendation, p_f, on the sample complexity, i.e., the number of ratings required to make `good' recommendations, and ask whether receiving positive and negative ratings, instead of positive ratings only, improves the sample complexity. Both questions arise in the design of recommender systems. We introduce a simple probabilistic user model, and analyze the performance of an online user-based CF algorithm. We prove that after an initial cold start phase, where recommendations are invested in exploring the user's preferences, this algorithm makes---up to a fraction of the recommendations required for updating the user's preferences---perfect recommendations. The number of ratings required for the cold start phase is nearly proportional to 1/p_f, and that for updating the user's preferences is essentially independent of p_f. As a consequence we find that, receiving positive and negative ratings instead of only positive ones improves the number of ratings required for initial exploration by a factor of 1/p_f, which can be significant.

READ FULL TEXT
10/19/2012

Active Collaborative Filtering

Collaborative filtering (CF) allows the preferences of multiple users to...
07/14/2016

Fifty Shades of Ratings: How to Benefit from a Negative Feedback in Top-N Recommendations Tasks

Conventional collaborative filtering techniques treat a top-n recommenda...
11/19/2018

VoCoG: An Intelligent, Non-Intrusive Assistant for Voice-based Collaborative Group-Viewing

There have been significant innovations in media technologies in the rec...
03/12/2022

Discrete, recurrent, and scalable patterns in human judgement underlie affective picture ratings

Operant keypress tasks, where each action has a consequence, have been a...
08/31/2018

Eigenvalue analogy for confidence estimation in item-based recommender systems

Item-item collaborative filtering (CF) models are a well known and studi...
12/06/2015

Explaining reviews and ratings with PACO: Poisson Additive Co-Clustering

Understanding a user's motivations provides valuable information beyond ...
04/05/2022

Positive and Negative Critiquing for VAE-based Recommenders

Providing explanations for recommended items allows users to refine the ...