pith. sign in

arxiv: 1709.03496 · v1 · pith:UXNF7Z5Hnew · submitted 2017-09-10 · 💻 cs.IR

SweetRS: Dataset for a recommender systems of sweets

classification 💻 cs.IR
keywords matrixdatasetrecommendersweetrssweetsalgorithmalgorithmsbenchmark
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.