A Graph Theoretic Approach to Melodic Similarity

  • Goffredo Haus
  • Alberto Pinto
Conference paper

DOI: 10.1007/978-3-540-31807-1_20

Volume 3310 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Haus G., Pinto A. (2005) A Graph Theoretic Approach to Melodic Similarity. In: Wiil U.K. (eds) Computer Music Modeling and Retrieval. CMMR 2004. Lecture Notes in Computer Science, vol 3310. Springer, Berlin, Heidelberg

Abstract

Common music information retrieval methods are based upon editing distances, reductionism or functional analysis tecniques. We adopt an approach which looks into a thematic fragment (TF) globally. This leads to associate a musical graph to each TF which preserves its more abstract content. Then, necessary conditions for graph inclusion are introduced and we give a similarity function between graphs which allows to assign different weights to the elements belonging to different graph powers. The advantage is that graphs catch more musical transformations than other methods, like permutations of subfragments.

Keywords

melodic similarity musical graph graph metric similarity function eulerianity hamiltonicity inclusion 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Goffredo Haus
    • 1
  • Alberto Pinto
    • 1
  1. 1.LIM – Laboratorio di Informatica Musicale, DICO – Dipartimento di Informatica e ComunicazioneUniversità degli Studi di Milano