Cold start similar artists ranking with gravity-inspired graph autoencoders

21Citations
Citations of this article
24Readers
Mendeley users who have this article in their library.
Get full text

Abstract

On an artist's profile page, music streaming services frequently recommend a ranked list of "similar artists"that fans also liked. However, implementing such a feature is challenging for new artists, for which usage data on the service (e.g. streams or likes) is not yet available. In this paper, we model this cold start similar artists ranking problem as a link prediction task in a directed and attributed graph, connecting artists to their top-k most similar neighbors and incorporating side musical information. Then, we leverage a graph autoencoder architecture to learn node embedding representations from this graph, and to automatically rank the top-k most similar neighbors of new artists using a gravity-inspired mechanism. We empirically show the flexibility and the effectiveness of our framework, by addressing a real-world cold start similar artists ranking problem on a global music streaming service. Along with this paper, we also publicly release our source code and the industrial data from our experiments.

Cite

CITATION STYLE

APA

Salha-Galvan, G., Hennequin, R., Chapus, B., Tran, V. A., & Vazirgiannis, M. (2021). Cold start similar artists ranking with gravity-inspired graph autoencoders. In RecSys 2021 - 15th ACM Conference on Recommender Systems (pp. 443–452). Association for Computing Machinery, Inc. https://doi.org/10.1145/3460231.3474252

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free