3260 papers • 126 benchmarks • 313 datasets
This task has no description! Would you like to contribute one?
(Image credit: Papersgraph)
These leaderboards are used to track progress in sequential-skip-prediction
Use these libraries to find sequential-skip-prediction models and implementations
No subtasks available.
The solution of the University of Copenhagen DIKU-IR team in the 'Spotify Sequential Skip Prediction Challenge', where the task was to predict the skip behaviour of the second half in a music listening session conditioned on the first half, is described.
The approach to this problem and the final system that was submitted to the challenge are described, which consists in combining the predictions of multiple boosting trees models trained with features extracted from the sessions and the tracks.
The proposed model initially generates a fixed vector representation of the session, and this additional information is incorporated into an Encoder-Decoder style architecture and achieved the seventh position in the competition, with a mean average accuracy of 0.604 on the test set.
This paper proposed two different kinds of algorithms that were based on metric learning and sequence learning that performed significantly better than the metric learning approach in the WSDM Cup 2019 Spotify Sequential Skip Prediction Challenge.
Adding a benchmark result helps the community track progress.