Papers › SweetRS: Dataset for a recommender systems of sweets

SweetRS: Dataset for a recommender systems of sweets

10 Sep 2017arXiv:1709.03496archive 2025-07-28

Kidziński Łukasz

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.

PaperPDFCode

Syntology This paper's arXiv id is not in Syntology's Atlas id list (549,449 ids, as this build read them; the read time is in the build record), so this page links to no Syntology page for it. The list is not the whole graph; Syntology's feed shows papers as they enter the graph.

Code

kidzik/sweetrs-analysis officialmentioned in papermentioned on GitHubSyntology: not harvested report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

BenchmarkingMatrix CompletionRecommendation Systems

Datasets

Introduced by this paper, per the archive.

SweetRS

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections