bipartite ranking
Recently Published Documents


TOTAL DOCUMENTS

22
(FIVE YEARS 2)

H-INDEX

6
(FIVE YEARS 0)

2022 ◽  
Author(s):  
Yingxiang Mo ◽  
Hong Chen ◽  
Yuxiang Han ◽  
Hao Deng

2018 ◽  
Author(s):  
Dawei Chen ◽  
Cheng Soon Ong ◽  
Aditya Krishna Menon

Playlist recommendation involves producing a set of songs that a user might enjoy. We investigate this problem in three cold-start scenarios: (i) cold playlists, where we recommend songs to form new personalised playlists for an existing user; (ii) cold users, where we recommend songs to form new playlists for a new user; and (iii) cold songs, where we recommend newly released songs to extend users’ existing playlists. We propose a flexible multitask learning method to deal with all three settings. The method learns from user-curated playlists, and encourages songs in a playlist to be ranked higher than those that are not by minimising a bipartite ranking loss. Inspired by an equivalence between bipartite ranking and binary classification, we show how one can efficiently approximate an optimal solution of the multitask learning objective by minimising a classification loss. Empirical results on two real playlist datasets show the proposed approach has good performance for cold-start playlist recommendation.


2018 ◽  
Author(s):  
Dawei Chen ◽  
Cheng Soon Ong ◽  
Aditya Krishna Menon

Playlist recommendation involves producing a set of songs that a user might enjoy. We investigate this problem in three cold-start scenarios: (i) cold playlists, where we recommend songs to form new personalised playlists for an existing user; (ii) cold users, where we recommend songs to form new playlists for a new user; and (iii) cold songs, where we recommend newly released songs to extend users’ existing playlists. We propose a flexible multitask learning method to deal with all three settings. The method learns from user-curated playlists, and encourages songs in a playlist to be ranked higher than those that are not by minimising a bipartite ranking loss. Inspired by an equivalence between bipartite ranking and binary classification, we show how one can efficiently approximate an optimal solution of the multitask learning objective by minimising a classification loss. Empirical results on two real playlist datasets show the proposed approach has good performance for cold-start playlist recommendation.


2018 ◽  
Author(s):  
Dawei Chen ◽  
Cheng Soon Ong ◽  
Aditya Krishna Menon

Playlist recommendation involves producing a set of songs that a user might enjoy. We investigate this problem in three cold-start scenarios: (i) cold playlists, where we recommend songs to form new personalised playlists for an existing user; (ii) cold users, where we recommend songs to form new playlists for a new user; and (iii) cold songs, where we recommend newly released songs to extend users’ existing playlists. We propose a flexible multitask learning method to deal with all three settings. The method learns from user-curated playlists, and encourages songs in a playlist to be ranked higher than those that are not by minimising a bipartite ranking loss. Inspired by an equivalence between bipartite ranking and binary classification, we show how one can efficiently approximate an optimal solution of the multitask learning objective by minimising a classification loss. Empirical results on two real playlist datasets show the proposed approach has good performance for cold-start playlist recommendation.


2018 ◽  
Vol 196 ◽  
pp. 70-86
Author(s):  
Benjamin Guedj ◽  
Sylvain Robbiano

Author(s):  
Majdi Khalid ◽  
Indrakshi Ray ◽  
Hamidreza Chitsaz
Keyword(s):  

2015 ◽  
Vol 149 ◽  
pp. 1305-1314 ◽  
Author(s):  
Xiao-Bo Jin ◽  
Guang-Gang Geng ◽  
Minghe Sun ◽  
Dexian Zhang

Sign in / Sign up

Export Citation Format

Share Document