Proceedings of the ACM Recommender Systems Challenge 2018最新文献

筛选
英文 中文
Artist-driven layering and user's behaviour impact on recommendations in a playlist continuation scenario 艺术家驱动的分层和用户行为影响播放列表延续场景中的推荐
Proceedings of the ACM Recommender Systems Challenge 2018 Pub Date : 2018-10-02 DOI: 10.1145/3267471.3267475
Sebastiano Antenucci, Simone Boglio, Emanuele Chioso, Ervin Dervishaj, Shuwen Kang, Tommaso Scarlatti, Maurizio Ferrari Dacrema
{"title":"Artist-driven layering and user's behaviour impact on recommendations in a playlist continuation scenario","authors":"Sebastiano Antenucci, Simone Boglio, Emanuele Chioso, Ervin Dervishaj, Shuwen Kang, Tommaso Scarlatti, Maurizio Ferrari Dacrema","doi":"10.1145/3267471.3267475","DOIUrl":"https://doi.org/10.1145/3267471.3267475","url":null,"abstract":"In this paper we provide an overview of the approach we used as team Creamy Fireflies for the ACM RecSys Challenge 2018. The competition, organized by Spotify, focuses on the problem of playlist continuation, that is suggesting which tracks the user may add to an existing playlist. The challenge addresses this issue in many use cases, from playlist cold start to playlists already composed by up to a hundred tracks. Our team proposes a solution based on a few well known models both content based and collaborative, whose predictions are aggregated via an ensembling step. Moreover by analyzing the underlying structure of the data, we propose a series of boosts to be applied on top of the final predictions and improve the recommendation quality. The proposed approach leverages well-known algorithms and is able to offer a high recommendation quality while requiring a limited amount of computational resources.","PeriodicalId":430663,"journal":{"name":"Proceedings of the ACM Recommender Systems Challenge 2018","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121202511","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 18
Automatic Playlist Continuation using Subprofile-Aware Diversification 使用子配置文件感知多样化自动播放列表延续
Proceedings of the ACM Recommender Systems Challenge 2018 Pub Date : 2018-10-02 DOI: 10.1145/3267471.3267472
Mesut Kaya, D. Bridge
{"title":"Automatic Playlist Continuation using Subprofile-Aware Diversification","authors":"Mesut Kaya, D. Bridge","doi":"10.1145/3267471.3267472","DOIUrl":"https://doi.org/10.1145/3267471.3267472","url":null,"abstract":"The ACM RecSys Challenge 2018 involves the task of automatic playlist continuation (APC), aiming to help users to create and extend their own music playlists. In this paper, we explain teamrozik's approach to the Challenge. Our approach to APC is twofold: Cold-Start-APC for short playlists and SPAD-APC for other playlists. Cold-Start-APC is a rudimentary popularity-based recommender. SPAD-APC treats playlists as if they were user profiles. It builds an implicit matrix factorization model to generate initial recommendations. But it re-ranks those recommendations using SubProfile-Aware Diversification (SPAD), which is a personalized intent-aware diversification method. The SPAD re-ranking method aims to ensure that the final set of recommendations covers different interests or tastes in the playlists of the users, which we refer to as subprofiles. We show that such subprofiles do exist within playlists and we show that the SPAD method achieves higher precision than matrix factorization alone.","PeriodicalId":430663,"journal":{"name":"Proceedings of the ACM Recommender Systems Challenge 2018","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128333830","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
Two-stage Model for Automatic Playlist Continuation at Scale 大规模自动播放列表延续的两阶段模型
Proceedings of the ACM Recommender Systems Challenge 2018 Pub Date : 2018-10-02 DOI: 10.1145/3267471.3267480
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":"https://doi.org/10.1145/3267471.3267480","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.0,"publicationDate":"2018-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129426910","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 35
Automatic Music Playlist Continuation via Neighbor-based Collaborative Filtering and Discriminative Reweighting/Reranking 基于邻域协同过滤和判别性重加权/重排序的音乐播放列表自动延续
Proceedings of the ACM Recommender Systems Challenge 2018 Pub Date : 2018-10-02 DOI: 10.1145/3267471.3267481
Lin Zhu, Bowen He, Mengxin Ji, Cheng Ju, Yihong Chen
{"title":"Automatic Music Playlist Continuation via Neighbor-based Collaborative Filtering and Discriminative Reweighting/Reranking","authors":"Lin Zhu, Bowen He, Mengxin Ji, Cheng Ju, Yihong Chen","doi":"10.1145/3267471.3267481","DOIUrl":"https://doi.org/10.1145/3267471.3267481","url":null,"abstract":"The focus of RecSys Challenge 2018 is automatic playlist continuation (APC), which refers to the task of adding one or more tracks to a playlist in a manner that does not alter the intended characteristics of the original playlist. This paper presents our approach to this challenge. We adopted neighbor-based collaborative filtering approaches since they are able to deal with large datasets in an efficient and effective way, and have previously been shown to perform well on recommendation problems with similar characteristics. We show that by choosing an appropriate similarity function that properly accounts for the list-song similarities, simple neighbor-based methods can still achieve highly competitive performance on the MPD data, meanwhile, by using a set of techniques that discriminantly finetune the recommendation lists produced by neighbor-based methods, the overall recommendation accuracy can be improved significantly. By using the proposed approach, our team HAIR was able to attain the 6th place in the competition. We have open-sourced our implementation on https://github.com/LauraBowenHe/Recsys-Spotify-2018-challenge.","PeriodicalId":430663,"journal":{"name":"Proceedings of the ACM Recommender Systems Challenge 2018","volume":"431 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116009113","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
A Line in the Sand: Recommendation or Ad-hoc Retrieval? Overview of RecSys Challenge 2018 Submission by Team BachPropagate 底线:推荐还是临时检索?BachPropagate团队提交的RecSys挑战赛2018概述
Proceedings of the ACM Recommender Systems Challenge 2018 Pub Date : 2018-07-21 DOI: 10.1145/3267471.3267478
S. Kallumadi, Bhaskar Mitra, Tereza Iofciu
{"title":"A Line in the Sand: Recommendation or Ad-hoc Retrieval? Overview of RecSys Challenge 2018 Submission by Team BachPropagate","authors":"S. Kallumadi, Bhaskar Mitra, Tereza Iofciu","doi":"10.1145/3267471.3267478","DOIUrl":"https://doi.org/10.1145/3267471.3267478","url":null,"abstract":"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.","PeriodicalId":430663,"journal":{"name":"Proceedings of the ACM Recommender Systems Challenge 2018","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129474785","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信