A clustering algorithm for melodic analysis

Emilios Cambouropoulos, Alan Smaill, Gerhard Widmer

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper a formal model will be presented that attempts to organise melodic segments into‘significant’ musical categories (e.g. motives). Given a segmentation of a melodic surface, the proposed model constructs an appropriate representation for each segment in terms of a number of attributes (these reflect melodic and rhythmic aspects of the segment at the surface and at various abstract levels) and then a clustering algorithm (the Unscramble algorithm) is applied for the organisation of these segments into ‘meaningful’ categories. The proposed clustering algorithm automatically determines an appropriate number of clusters and also the characteristic (or defining) attributes of each category. As a test case this computational model has been used for obtaining a motivic analysis of three melodies from diverse musical styles.
Original languageEnglish
Title of host publicationProceedings of the Diderot'99 Forum on Mathematics and Music
Number of pages8
Volume99
Publication statusPublished - 1999

Fingerprint Dive into the research topics of 'A clustering algorithm for melodic analysis'. Together they form a unique fingerprint.

Cite this