SweetRS: Dataset for a recommender systems of sweets

10 Sep 2017  ·  Kidziński Łukasz ·

Benchmarking recommender system and matrix completion algorithms could be greatly simplified if the entire matrix was known. We built a \url{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 \textsc{Soft-Impute} algorithm on the dataset.

PDF Abstract

Datasets


Introduced in the Paper:

SweetRS

Results from the Paper


  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.

Methods


No methods listed for this paper. Add relevant methods here