The popular approaches to recommendation and ad-hoc retrieval tasks are largely distinct in the literature. In this work, we argue that many recommendation problems can also be cast as ad-hoc retrieval tasks. To demonstrate this, we build a solution for the RecSys 2018 Spotify challenge by combining standard ad-hoc retrieval models and using popular retrieval tools sets. We draw a parallel between the playlist continuation task and the task of finding good expansion terms for queries in ad-hoc retrieval, and show that standard pseudo-relevance feedback can be effective as a collaborative filtering approach. We also use ad-hoc retrieval for content-based recommendation by treating the input playlist title as a query and associating all candidate tracks with meta-descriptions extracted from the background data. The recommendations from these two approaches are further supplemented by a nearest neighbor search based on track embeddings learned by a popular neural model. Our final ranked list of recommendations is produced by a learning to rank model. Our proposed solution using ad-hoc retrieval models achieved a competitive performance on the music recommendation task at RecSys 2018 challenge---finishing at rank 7 out of 112 participating teams and at rank 5 out of 31 teams for the main and the creative tracks, respectively.
翻译:在文献中,对建议和特别的检索任务的流行办法在很大程度上在文献中是不同的。在这项工作中,我们争辩说,许多建议问题也可以作为临时的检索任务来处理。为了证明这一点,我们为RecSys 2018 Spotify 挑战设计了一个解决办法,方法是将标准的 ad-hoc 检索模型和使用流行检索工具集成;我们把播放列表的延续任务与为在临时检索中查询找到良好的扩展条件的任务相平行,并表明标准假冒相关性反馈可以作为一种合作的过滤方法而有效。我们还利用基于内容的建议的自动检索方法,将输入播放列表的标题作为查询处理,并将所有候选路径与从背景数据中提取的元描述联系起来。这两种方法产生的建议进一步得到近邻搜索的补充,这些搜索以流行神经模型所学的轨迹嵌入为基础。我们最后的排位建议清单是通过学习排名模型制作的。我们提议的使用自动检索模型的解决方案在Recys 2018 挑战-finish 的音乐建议任务上取得了竞争性的成绩。