SweetRS: Dataset for a recommender systems of sweets

09/10/2017
by   Łukasz Kidziński, et al.
0

Benchmarking recommender system and matrix completion algorithms could be greatly simplified if the entire matrix was known. We built a <sweetrs.org> platform with 77 candies and sweets to rank. Over 2000 users submitted over 44000 grades resulting in a matrix with 28% coverage. In this report, we give the full description of the environment and we benchmark the Soft-Impute algorithm on the dataset.

READ FULL TEXT

page 1

page 2

research
04/07/2019

Cluster Developing 1-Bit Matrix Completion

Matrix completion has a long-time history of usage as the core technique...
research
08/02/2018

Mixture Matrix Completion

Completing a data matrix X has become an ubiquitous problem in modern da...
research
01/19/2016

Top-N Recommender System via Matrix Completion

Top-N recommender systems have been investigated widely both in industry...
research
06/08/2020

MC2G: An Efficient Algorithm for Matrix Completion with Social and Item Similarity Graphs

We consider a discrete-valued matrix completion problem for recommender ...
research
05/27/2019

Collaborative Self-Attention for Recommender Systems

Recommender systems (RS), which have been an essential part in a wide ra...
research
07/17/2023

An Admissible Shift-Consistent Method for Recommender Systems

In this paper, we propose a new constraint, called shift-consistency, fo...
research
12/08/2014

Probabilistic low-rank matrix completion on finite alphabets

The task of reconstructing a matrix given a sample of observedentries is...

Please sign up or login with your details

Forgot password? Click here to reset