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

筛选
英文 中文
Towards Seed-Free Music Playlist Generation: Enhancing Collaborative Filtering with Playlist Title Information 迈向无种子音乐播放列表生成:增强与播放列表标题信息的协同过滤
Proceedings of the ACM Recommender Systems Challenge 2018 Pub Date : 2018-10-02 DOI: 10.1145/3267471.3267485
Jaehun Kim, Minz Won, Cynthia C. S. Liem, A. Hanjalic
{"title":"Towards Seed-Free Music Playlist Generation: Enhancing Collaborative Filtering with Playlist Title Information","authors":"Jaehun Kim, Minz Won, Cynthia C. S. Liem, A. Hanjalic","doi":"10.1145/3267471.3267485","DOIUrl":"https://doi.org/10.1145/3267471.3267485","url":null,"abstract":"In this paper, we propose a hybrid Neural Collaborative Filtering (NCF) model trained with a multi-objective function to achieve a music playlist generation system. The proposed approach focuses particularly on the cold-start problem (playlists with no seed tracks) and uses a text encoder employing a Recurrent Neural Network (RNN) to exploit textual information given by the playlist title. To accelerate the training, we first apply Weighted Regularized Matrix Factorization (WRMF) as the basic recommendation model to pre-learn latent factors of playlists and tracks. These factors then feed into the proposed multi-objective optimization that also involves embeddings of playlist titles. The experimental study indicates that the proposed approach can effectively suggest suitable music tracks for a given playlist title, compensating poor original recommendation results made on empty playlists by the WRMF model.","PeriodicalId":430663,"journal":{"name":"Proceedings of the ACM Recommender Systems Challenge 2018","volume":"47 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":"134618779","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}
引用次数: 9
Automatic playlist continuation using a hybrid recommender system combining features from text and audio 使用混合推荐系统,结合文本和音频的功能,自动播放列表延续
Proceedings of the ACM Recommender Systems Challenge 2018 Pub Date : 2018-10-02 DOI: 10.1145/3267471.3267473
Andrés Ferraro, D. Bogdanov, Jisang Yoon, Kwangseob Kim, Xavier Serra
{"title":"Automatic playlist continuation using a hybrid recommender system combining features from text and audio","authors":"Andrés Ferraro, D. Bogdanov, Jisang Yoon, Kwangseob Kim, Xavier Serra","doi":"10.1145/3267471.3267473","DOIUrl":"https://doi.org/10.1145/3267471.3267473","url":null,"abstract":"The ACM RecSys Challenge 2018 focuses on music recommendation in the context of automatic playlist continuation. In this paper, we describe our approach to the problem and the final hybrid system that was submitted to the challenge by our team Cocoplaya. This system consists in combining the recommendations produced by two different models using ranking fusion. The first model is based on Matrix Factorization and it incorporates information from tracks' audio and playlist titles. The second model generates recommendations based on typical track co-occurrences considering their proximity in the playlists. The proposed approach is efficient and achieves a good overall performance, with our model ranked 4th on the creative track of the challenge leaderboard.","PeriodicalId":430663,"journal":{"name":"Proceedings of the ACM Recommender Systems Challenge 2018","volume":"68 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":"126184815","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}
引用次数: 15
Efficient K-NN for Playlist Continuation 播放列表延续的高效K-NN算法
Proceedings of the ACM Recommender Systems Challenge 2018 Pub Date : 2018-10-02 DOI: 10.1145/3267471.3267477
Domokos M. Kelen, Dániel Berecz, Ferenc Béres, A. Benczúr
{"title":"Efficient K-NN for Playlist Continuation","authors":"Domokos M. Kelen, Dániel Berecz, Ferenc Béres, A. Benczúr","doi":"10.1145/3267471.3267477","DOIUrl":"https://doi.org/10.1145/3267471.3267477","url":null,"abstract":"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.","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":"129502816","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
MMCF: Multimodal Collaborative Filtering for Automatic Playlist Continuation 自动播放列表延续的多模态协同过滤
Proceedings of the ACM Recommender Systems Challenge 2018 Pub Date : 2018-10-02 DOI: 10.1145/3267471.3267482
Hojin Yang, Yoonki Jeong, Minjin Choi, Jongwuk Lee
{"title":"MMCF: Multimodal Collaborative Filtering for Automatic Playlist Continuation","authors":"Hojin Yang, Yoonki Jeong, Minjin Choi, Jongwuk Lee","doi":"10.1145/3267471.3267482","DOIUrl":"https://doi.org/10.1145/3267471.3267482","url":null,"abstract":"Automatic playlist continuation (APC) is a common task of music recommender systems, enabling the automatic discovery of tracks that fit into a given playlist. To recommend a coherent list of tracks to users, it is important to capture the underlying characteristics of a playlist. Unfortunately, existing recommender models suffer from several problems: (1) They tend to misinterpret tracks that appear rarely in a playlist (popularity bias) (2) they cannot extend user's playlist that consists of very few tracks (cold-start problem), and (3) they neglect the context of a playlist such as the sequence of tracks or playlist title (context-aware continuation). This year's ACM RecSys Challenge'18 aimed to find new solutions to tackle these problems. In this paper, we propose a multimodal collaborative filtering model to deal effectively with diverse data. This consists of two components: (1) an autoencoder using both the playlist and its categorical contents and (2) a character-level convolutional neural network using the playlist title only. By simultaneously analyzing the playlist and the categorical contents, our model successfully addresses the cold-start and popularity bias problems. In addition, we consider the context of a playlist by utilizing its title, thus enhancing the prediction of well-suited tracks. In the challenge, our team \"hello world!\" was ranked the 2nd place, scoring 0.224, 0.394, and 1.928 for the three evaluation metrics, respectively. Our implementation code is publicly available at https://github.com/hojinYang/spotify_recSys_challenge_2018.","PeriodicalId":430663,"journal":{"name":"Proceedings of the ACM Recommender Systems Challenge 2018","volume":"23 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":"134551676","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}
引用次数: 15
Effective Nearest-Neighbor Music Recommendations 有效的近邻音乐推荐
Proceedings of the ACM Recommender Systems Challenge 2018 Pub Date : 2018-10-02 DOI: 10.1145/3267471.3267474
Malte Ludewig, Iman Kamehkhosh, Nick Landia, D. Jannach
{"title":"Effective Nearest-Neighbor Music Recommendations","authors":"Malte Ludewig, Iman Kamehkhosh, Nick Landia, D. Jannach","doi":"10.1145/3267471.3267474","DOIUrl":"https://doi.org/10.1145/3267471.3267474","url":null,"abstract":"Automated recommendations for next tracks to listen to or to include in a playlist are a common feature on modern music platforms. Correspondingly, a variety of algorithmic approaches for determining tracks to recommend have been proposed in academic research. The most sophisticated among them are often based on conceptually complex learning techniques which can also require substantial computational resources or special-purpose hardware like GPUs. Recent research, however, showed that conceptually more simple techniques, e.g., based on nearest-neighbor schemes, can represent a viable alternative to such techniques in practice. In this paper, we describe a hybrid technique for next-track recommendation, which was evaluated in the context of the ACM RecSys 2018 Challenge. A combination of nearest-neighbor techniques, a standard matrix factorization algorithm, and a small set of heuristics led our team KAENEN to the 3rd place in the \"creative\" track and the 7th one in the \"main\" track, with accuracy results only a few percent below the winning teams. Given that offline prediction accuracy is only one of several possible quality factors in music recommendation, practitioners have to validate if slight accuracy improvements truly justify the use of highly complex algorithms in real-world applications.","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":"125858132","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}
引用次数: 22
Using Adversarial Autoencoders for Multi-Modal Automatic Playlist Continuation 使用对抗性自动编码器进行多模态自动播放列表延续
Proceedings of the ACM Recommender Systems Challenge 2018 Pub Date : 2018-10-02 DOI: 10.1145/3267471.3267476
Iacopo Vagliano, Lukas Galke, Florian Mai, A. Scherp
{"title":"Using Adversarial Autoencoders for Multi-Modal Automatic Playlist Continuation","authors":"Iacopo Vagliano, Lukas Galke, Florian Mai, A. Scherp","doi":"10.1145/3267471.3267476","DOIUrl":"https://doi.org/10.1145/3267471.3267476","url":null,"abstract":"The task of automatic playlist continuation is generating a list of recommended tracks that can be added to an existing playlist. By suggesting appropriate tracks, i. e., songs to add to a playlist, a recommender system can increase the user engagement by making playlist creation easier, as well as extending listening beyond the end of current playlist. The ACM Recommender Systems Challenge 2018 focuses on such task. Spotify released a dataset of playlists, which includes a large number of playlists and associated track listings. Given a set of playlists from which a number of tracks have been withheld, the goal is predicting the missing tracks in those playlists. We participated in the challenge as the team Unconscious Bias and, in this paper, we present our approach. We extend adversarial autoencoders to the problem of automatic playlist continuation. We show how multiple input modalities, such as the playlist titles as well as track titles, artists and albums, can be incorporated in the playlist continuation task.","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":"125903022","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}
引用次数: 6
Efficient Similarity Based Methods For The Playlist Continuation Task 基于相似性的播放列表延续任务的高效方法
Proceedings of the ACM Recommender Systems Challenge 2018 Pub Date : 2018-10-02 DOI: 10.1145/3267471.3267486
G. Faggioli, Mirko Polato, F. Aiolli
{"title":"Efficient Similarity Based Methods For The Playlist Continuation Task","authors":"G. Faggioli, Mirko Polato, F. Aiolli","doi":"10.1145/3267471.3267486","DOIUrl":"https://doi.org/10.1145/3267471.3267486","url":null,"abstract":"In this paper, the pipeline we used in the RecSys challenge 2018 is reported. We present content-based and collaborative filtering approaches for the definition of the similarity matrices for top-500 recommendation task. In particular, the task consisted in recommending songs to add to partial playlists. Different methods have been proposed depending on the number of available songs in a playlist. We show how an hybrid approach which exploits both content-based and collaborative filtering is effective in this task. Specifically, information derived by the playlist titles helped to tackle the cold-start issue.","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":"125248238","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
An Ensemble Approach of Recurrent Neural Networks using Pre-Trained Embeddings for Playlist Completion 使用预训练嵌入的循环神经网络集成方法用于播放列表补全
Proceedings of the ACM Recommender Systems Challenge 2018 Pub Date : 2018-10-02 DOI: 10.1145/3267471.3267484
Diego Monti, Enrico Palumbo, Giuseppe Rizzo, Pasquale Lisena, Raphael Troncy, Michael Fell, Elena Cabrio, M. Morisio
{"title":"An Ensemble Approach of Recurrent Neural Networks using Pre-Trained Embeddings for Playlist Completion","authors":"Diego Monti, Enrico Palumbo, Giuseppe Rizzo, Pasquale Lisena, Raphael Troncy, Michael Fell, Elena Cabrio, M. Morisio","doi":"10.1145/3267471.3267484","DOIUrl":"https://doi.org/10.1145/3267471.3267484","url":null,"abstract":"This paper describes the approach of the D2KLab team to the RecSys Challenge 2018 that focuses on the task of playlist completion. We propose an ensemble strategy of different recurrent neural networks leveraging pre-trained embeddings representing tracks, artists, albums, and titles as inputs. We also use lyrics from which we extract semantic and stylistic features that we fed into the network for the creative track. The RNN learns a probabilistic model from the sequences of items in the playlist, which is then used to predict the most likely tracks to be added to the playlist. Concerning the playlists without tracks, we implemented a fall-back strategy called Title2Rec that generates recommendations using only the playlist title. We optimized the RNN, Title2Rec, and the ensemble approach on a validation set, tuning hyper-parameters such as the optimizer algorithm, the learning rate, and the generation strategy. This approach is effective in predicting tracks for a playlist and flexible to include diverse types of inputs, but it is also computationally demanding in the training phase.","PeriodicalId":430663,"journal":{"name":"Proceedings of the ACM Recommender Systems Challenge 2018","volume":"56 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121004546","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}
引用次数: 9
A hybrid two-stage recommender system for automatic playlist continuation 自动播放列表延续的混合两阶段推荐系统
Proceedings of the ACM Recommender Systems Challenge 2018 Pub Date : 2018-10-02 DOI: 10.1145/3267471.3267488
V. Rubtsov, Mikhail Kamenshchikov, I. Valyaev, V. Leksin, D. Ignatov
{"title":"A hybrid two-stage recommender system for automatic playlist continuation","authors":"V. Rubtsov, Mikhail Kamenshchikov, I. Valyaev, V. Leksin, D. Ignatov","doi":"10.1145/3267471.3267488","DOIUrl":"https://doi.org/10.1145/3267471.3267488","url":null,"abstract":"In this paper, we provide the solution for RecSys Challenge 2018 by our Avito team, which obtained the 3rd place in main track. The goal of the competition was to recommend music tracks for automatic playlist continuation. As a part of this challenge, Spotify released a large public dataset, which allowed us to train a rather complex algorithm. Our approach consists of two stages: collaborative filtering for candidate selection and gradient boosting for final prediction. The combination of these two models performed well with the playlist and track metadata given.","PeriodicalId":430663,"journal":{"name":"Proceedings of the ACM Recommender Systems Challenge 2018","volume":"12 6 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":"129298979","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}
引用次数: 9
TrailMix: An Ensemble Recommender System for Playlist Curation and Continuation TrailMix:一个用于播放列表管理和延续的集成推荐系统
Proceedings of the ACM Recommender Systems Challenge 2018 Pub Date : 2018-10-02 DOI: 10.1145/3267471.3267479
Xing Zhao, Qingquan Song, James Caverlee, Xia Hu
{"title":"TrailMix: An Ensemble Recommender System for Playlist Curation and Continuation","authors":"Xing Zhao, Qingquan Song, James Caverlee, Xia Hu","doi":"10.1145/3267471.3267479","DOIUrl":"https://doi.org/10.1145/3267471.3267479","url":null,"abstract":"This paper describes TrailMix, an ensemble model designed to tackle the RecSys Challenge 2018 for automatic music playlist continuation. TrailMix combines three different models designed to exploit complementary aspects of playlist recommendation: (i) CC-Title, a cluster-based approach for playlist titles; (ii) DNCF, an extension of Neural Collaborative Filtering for taking advantage of the flat interaction among tracks; and (iii) C-Tree, a hierarchical approach akin to Phylogenetic trees for finding relationships between tracks.","PeriodicalId":430663,"journal":{"name":"Proceedings of the ACM Recommender Systems Challenge 2018","volume":"19 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120930819","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学术官方微信