Two-stage Model for Automatic Playlist Continuation at Scale

M. Volkovs, Himanshu Rai, Zhaoyue Cheng, Ga Wu, Y. Lu, S. Sanner
{"title":"Two-stage Model for Automatic Playlist Continuation at Scale","authors":"M. Volkovs, Himanshu Rai, Zhaoyue Cheng, Ga Wu, Y. Lu, S. Sanner","doi":"10.1145/3267471.3267480","DOIUrl":null,"url":null,"abstract":"Automatic playlist continuation is a prominent problem in music recommendation. Significant portion of music consumption is now done online through playlists and playlist-like online radio stations. Manually compiling playlists for consumers is a highly time consuming task that is difficult to do at scale given the diversity of tastes and the large amount of musical content available. Consequently, automated playlist continuation has received increasing attention recently [1, 7, 11]. The 2018 ACM RecSys Challenge [14] is dedicated to evaluating and advancing current state-of-the-art in automated playlist continuation using a large scale dataset released by Spotify. In this paper we present our approach to this challenge. We use a two-stage model where the first stage is optimized for fast retrieval, and the second stage re-ranks retrieved candidates maximizing the accuracy at the top of the recommended list. Our team vl6 achieved 1'st place in both main and creative tracks out of over 100 teams.","PeriodicalId":430663,"journal":{"name":"Proceedings of the ACM Recommender Systems Challenge 2018","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"35","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the ACM Recommender Systems Challenge 2018","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3267471.3267480","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 35

Abstract

Automatic playlist continuation is a prominent problem in music recommendation. Significant portion of music consumption is now done online through playlists and playlist-like online radio stations. Manually compiling playlists for consumers is a highly time consuming task that is difficult to do at scale given the diversity of tastes and the large amount of musical content available. Consequently, automated playlist continuation has received increasing attention recently [1, 7, 11]. The 2018 ACM RecSys Challenge [14] is dedicated to evaluating and advancing current state-of-the-art in automated playlist continuation using a large scale dataset released by Spotify. In this paper we present our approach to this challenge. We use a two-stage model where the first stage is optimized for fast retrieval, and the second stage re-ranks retrieved candidates maximizing the accuracy at the top of the recommended list. Our team vl6 achieved 1'st place in both main and creative tracks out of over 100 teams.
大规模自动播放列表延续的两阶段模型
播放列表的自动延续是音乐推荐中的一个突出问题。现在,很大一部分音乐消费是通过播放列表和类似播放列表的在线广播电台在线完成的。手动为消费者编制播放列表是一项非常耗时的任务,考虑到品味的多样性和大量可用的音乐内容,很难大规模完成。因此,自动播放列表的延续最近受到了越来越多的关注[1,7,11]。2018 ACM RecSys挑战赛[14]致力于使用Spotify发布的大规模数据集评估和推进当前最先进的自动播放列表延续。在本文中,我们提出了应对这一挑战的方法。我们使用了一个两阶段的模型,其中第一阶段是为了快速检索而优化的,第二阶段是为了最大限度地提高推荐列表顶部的准确性而对检索到的候选进行重新排序。我们的团队vl6在100多个团队中获得了主要和创意赛道的第一名。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信