Cold Start Similar Artists Ranking with Gravity-Inspired Graph Autoencoders
This addresses a practical problem for music streaming services in recommending similar artists when usage data is unavailable, though it is incremental as it builds on existing graph autoencoder methods.
The paper tackles the cold start similar artists ranking problem for new artists on music streaming services by modeling it as a link prediction task in a directed and attributed graph, and shows effectiveness in a real-world application with publicly released code and data.
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 as well as the industrial graph data from our experiments.