An Interpretable Music Similarity Measure Based on Path Interestingness

08/03/2021
by   Giovanni Gabbolini, et al.
0

We introduce a novel and interpretable path-based music similarity measure. Our similarity measure assumes that items, such as songs and artists, and information about those items are represented in a knowledge graph. We find paths in the graph between a seed and a target item; we score those paths based on their interestingness; and we aggregate those scores to determine the similarity between the seed and the target. A distinguishing feature of our similarity measure is its interpretability. In particular, we can translate the most interesting paths into natural language, so that the causes of the similarity judgements can be readily understood by humans. We compare the accuracy of our similarity measure with other competitive path-based similarity baselines in two experimental settings and with four datasets. The results highlight the validity of our approach to music similarity, and demonstrate that path interestingness scores can be the basis of an accurate and interpretable similarity measure.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/21/2023

Knowledge-based Multimodal Music Similarity

Music similarity is an essential aspect of music retrieval, recommendati...
research
02/18/2020

Multistage s-t Path: Confronting Similarity with Dissimilarity

Addressing a quest by Gupta et al. [ICALP'14], we provide a first, compr...
research
11/12/2018

Explainable Reasoning over Knowledge Graphs for Recommendation

Incorporating knowledge graph into recommender systems has attracted inc...
research
06/04/2022

Soft Retargeting Network for Click Through Rate Prediction

The study of user interest models has received a great deal of attention...
research
09/21/2021

Towards a computational definition of the tresillo rhythm and its tracing in popular music

This paper discusses the use and popularity of a rhythm, which hencefort...
research
08/09/2022

More Interpretable Graph Similarity Computation via Maximum Common Subgraph Inference

Graph similarity measurement, which computes the distance/similarity bet...
research
11/12/2020

A partition-based similarity for classification distributions

Herein we define a measure of similarity between classification distribu...

Please sign up or login with your details

Forgot password? Click here to reset