Nonparametric Preference Completion

05/24/2017
by   Julian Katz-Samuels, et al.
0

We consider the task of collaborative preference completion: given a pool of items, a pool of users and a partially observed item-user rating matrix, the goal is to recover the personalized ranking of each user over all of the items. Our approach is nonparametric: we assume that each item i and each user u have unobserved features x_i and y_u, and that the associated rating is given by g_u(f(x_i,y_u)) where f is Lipschitz and g_u is a monotonic transformation that depends on the user. We propose a k-nearest neighbors-like algorithm and prove that it is consistent. To the best of our knowledge, this is the first consistency result for the collaborative preference completion problem in a nonparametric setting. Finally, we conduct experiments on the Netflix and Movielens datasets that suggest that our algorithm has some advantages over existing neighborhood-based methods and that its performance is comparable to some state-of-the art matrix factorization methods.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/22/2019

Adaptive Matrix Completion for the Users and the Items in Tail

Recommender systems are widely used to recommend the most appealing item...
research
08/21/2019

Boosting the Rating Prediction with Click Data and Textual Contents

Matrix factorization (MF) is one of the most efficient methods for ratin...
research
10/22/2019

From Personalization to Privatization: Meta Matrix Factorization for Private Rating Predictions

Matrix factorization (MF) techniques have been shown to be effective for...
research
06/06/2019

Comprehensive Personalized Ranking Using One-Bit Comparison Data

The task of a personalization system is to recommend items or a set of i...
research
02/11/2023

Regret Guarantees for Adversarial Online Collaborative Filtering

We investigate the problem of online collaborative filtering under no-re...
research
01/12/2011

Extracting Features from Ratings: The Role of Factor Models

Performing effective preference-based data retrieval requires detailed a...
research
11/14/2016

Preference Completion from Partial Rankings

We propose a novel and efficient algorithm for the collaborative prefere...

Please sign up or login with your details

Forgot password? Click here to reset