Abstract
We present a simple and scalable algorithm for top-N recommen-\ud dation able to deal with very large datasets and (binary rated) im-\ud plicit feedback. We focus on memory-based collaborative filtering\ud algorithms similar to the well known neighboor based technique\ud for explicit feedback. The major difference, that makes the algo-\ud rithm particularly scalable, is that it uses positive feedback only\ud and no explicit computation of the complete (user-by-user or item-\ud by-item) similarity matrix needs to be performed.\ud The study of the proposed algorithm has been conducted on data\ud from the Million Songs Dataset (MSD) challenge whose task was\ud to suggest a set of songs (out of more than 380k available songs)\ud to more than 100k users given half of the user listening history and\ud complete listening history of other 1 million people.\ud In particular, we investigate on the entire recommendation pipeline,\ud starting from the definition of suitable similarity and scoring func-\ud tions and suggestions on how to aggregate multiple ranking strate-\ud gies to define the overall recommendation. The technique we are\ud proposing extends and improves the one that already won the MSD\ud challenge last year