Artist-driven layering and user's behaviour impact on recommendations in a playlist continuation scenario

October 13, 2020 ยท Entered Twilight ยท ๐Ÿ› RecSys Challenge

๐ŸŒ… TWILIGHT: Old Age
Predates the code-sharing era โ€” a pioneer of its time

"Last commit was 5.0 years ago (โ‰ฅ5 year threshold)"

Evidence collected by the PWNC Scanner

Repo contents: .gitignore, LICENSE, README.md, __init__.py, bayesian_scikit, boosts, data, fast_import.py, final_npz_creative, final_npz_main, images, jnotebook, personal, pytests, recommenders, results, run, scores, scripts, setup.py, setup_ubuntu.sh, submissions, tune, utils

Authors Sebastiano Antenucci, Simone Boglio, Emanuele Chioso, Ervin Dervishaj, Shuwen Kang, Tommaso Scarlatti, Maurizio Ferrari Dacrema arXiv ID 2010.06233 Category cs.IR: Information Retrieval Cross-listed cs.LG Citations 19 Venue RecSys Challenge Repository https://github.com/MaurizioFD/spotify-recsys-challenge โญ 2 Last Checked 2 months ago
Abstract
In this paper we provide an overview of the approach we used as team Creamy Fireflies for the ACM RecSys Challenge 2018. The competition, organized by Spotify, focuses on the problem of playlist continuation, that is suggesting which tracks the user may add to an existing playlist. The challenge addresses this issue in many use cases, from playlist cold start to playlists already composed by up to a hundred tracks. Our team proposes a solution based on a few well known models both content based and collaborative, whose predictions are aggregated via an ensembling step. Moreover by analyzing the underlying structure of the data, we propose a series of boosts to be applied on top of the final predictions and improve the recommendation quality. The proposed approach leverages well-known algorithms and is able to offer a high recommendation quality while requiring a limited amount of computational resources.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Information Retrieval