论文信息 - Efficient K-NN for Playlist Continuation

Efficient K-NN for Playlist Continuation

We present our solution for the RecSys Challenge 2018, which reached 9th place on the main track leaderboard of the competition. We developed a light-weight playlist-based nearest neighbor method to complete music playlists by using the playlist-track matrix along with track and playlist metadata. Our solution uses a number of domain specific heuristics for improving recommendation quality. One major advantage of our approach is its low computational resource use: our final solution can be computed on a traditional desktop computer within an hour.

[1] Mark Sanderson,et al. The relationship between IR effectiveness measures and user satisfaction , 2007, SIGIR.

[2] Stephen E. Robertson,et al. Understanding inverse document frequency: on theoretical arguments for IDF , 2004, J. Documentation.

[3] Paul Resnick,et al. Recommender systems , 1997, CACM.

[4] David Heckerman,et al. Empirical Analysis of Predictive Algorithms for Collaborative Filtering , 1998, UAI.

[5] Dietmar Jannach,et al. Automated Generation of Music Playlists: Survey and Experiments , 2014, ACM Comput. Surv..

[6] Sophie Ahrens,et al. Recommender Systems , 2012 .

[7] Paul Lamere,et al. Recsys challenge 2018: automatic music playlist continuation , 2018, RecSys.