Fourteenth ACM Conference on Recommender Systems 2020
DOI: 10.1145/3383313.3412217
|View full text |Cite
|
Sign up to set email alerts
|

Carousel Personalization in Music Streaming Apps with Contextual Bandits

Abstract: Media services providers, such as music streaming platforms, frequently leverage swipeable carousels to recommend personalized content to their users. However, selecting the most relevant items (albums, artists, playlists...) to display in these carousels is a challenging task, as items are numerous and as users have different preferences. In this paper, we model carousel personalization as a contextual multi-armed bandit problem with multiple plays, cascade-based updates and delayed batch feedback. We empiric… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
31
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
3
1

Relationship

1
8

Authors

Journals

citations
Cited by 39 publications
(34 citation statements)
references
References 33 publications
0
31
0
Order By: Relevance
“…As a consequence, it may lead to the selection of algorithms that provide similar sets of recommendations. Since it is known that a set of diverse recommendations improves user satisfaction [3], and recommending the same item in multiple lists has little use, in some cases it will be beneficial to include algorithms with a lower individual recommendation quality if they generate recommendations with a different perspective. Most articles targeting recommendations in a carousel setting are evaluated online with users of a certain platform.…”
Section: Introductionmentioning
confidence: 99%
“…As a consequence, it may lead to the selection of algorithms that provide similar sets of recommendations. Since it is known that a set of diverse recommendations improves user satisfaction [3], and recommending the same item in multiple lists has little use, in some cases it will be beneficial to include algorithms with a lower individual recommendation quality if they generate recommendations with a different perspective. Most articles targeting recommendations in a carousel setting are evaluated online with users of a certain platform.…”
Section: Introductionmentioning
confidence: 99%
“…Various use cases of MRSs exist, centered around different tasks. Among these, the most important ones are front page recommendation (recommending content for thematic collections of music -also known as shelves or channelspresented to the user on the front page of the platform's user interface) [11], music exploration/discovery (e. g., based on item similarity in terms of melody, rhythm, or lyrics) [41,60], automatic playlist generation (commonly based on the user profile, but possibly only based on a seed description such as "music to relax"), and automatic playlist continuation (based on a sequence of seed tracks) [50,117].…”
Section: Common Music Recommendation Tasks and Methodsmentioning
confidence: 99%
“…Many providers of commercial music streaming services design their recommendation interface as swipeable carousels [11], namely sequences of sections that users can scroll. These carousels have titles that convey information to end-users such as: • Self-explanatory titles: e. g., "Top 10", "Popular in your area", "Trending content" or "Recommended for you" that merely indicate the content selection process (Figure 4 top).…”
Section: Explanations In Real Mrsmentioning
confidence: 99%
“…• 𝐴 becomes 𝐴 ′ , an (𝑛 + 𝑚) × (𝑛 + 𝑚) adjacency matrix 6 , with 𝑚 new rows and columns filled with zeros. 4 Learning m𝑖 , as defined in equation (1), is equivalent to learning 𝑚 𝑖 , but allows to get rid of the logarithm and of the constant 𝐺 in computations. 5 Formally, Ã = 𝐷 −1 out (𝐴 + 𝐼 𝑛 ) where 𝐼 𝑛 is the 𝑛 × 𝑛 identity matrix and 𝐷 out is the diagonal out-degree matrix [53] of 𝐴 + 𝐼 𝑛 .…”
Section: 𝜇 and 𝑊mentioning
confidence: 99%