Sequential modeling of Sessions using Recurrent Neural Networks for Skip Prediction

April 23, 2019 ยท Entered Twilight ยท ๐Ÿ› arXiv.org

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

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

Evidence collected by the PWNC Scanner

Repo contents: 01-dataset-sample-rows.ipynb, 02-track-features-exploration.ipynb, 03-train-data-exploration.ipynb, 04-create-samples.ipynb, 05-track-weights.ipynb, 05-train-each-len.py, 06-predict-each-len-val-set.py, 07-process-test-file.py, 07-runner-all-files.py, 08-predict-each-len-test-set.py, 09-create-submission-one-test-file.py, 09-runner-all-files.py, LICENSE, README.md, workshop-paper-source

Authors Sainath Adapa arXiv ID 1904.10273 Category cs.IR: Information Retrieval Cross-listed cs.LG Citations 3 Venue arXiv.org Repository https://github.com/sainathadapa/spotify-sequential-skip-prediction โญ 27 Last Checked 2 months ago
Abstract
Recommender systems play an essential role in music streaming services, prominently in the form of personalized playlists. Exploring the user interactions within these listening sessions can be beneficial to understanding the user preferences in the context of a single session. In the 'Spotify Sequential Skip Prediction Challenge', WSDM, and Spotify are challenging people to understand the way users sequentially interact with music. We describe our solution approach in this paper and also state proposals for further improvements to the model. The proposed model initially generates a fixed vector representation of the session, and this additional information is incorporated into an Encoder-Decoder style architecture. This method achieved the seventh position in the competition, with a mean average accuracy of 0.604 on the test set. The solution code is available at https://github.com/sainathadapa/spotify-sequential-skip-prediction.
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