Vitanyi and his co-workers  have reported some success using a universal similarity metric based on Kolmogorov complexity for a variety of classification tasks, including music genre recognition. This paper describes new experiments in this direction, and compares the results with some alternative approaches. Somewhat to our surprise given its non-specific universal nature, the Kolmogorov complexity similarity based technique outperformed the others. The task used for our experiments involved classification of MIDI files into one of 4 groups. Two of the categories were western classical music composed by Beethoven (302 files) and Haydn (261 files). The remaining categories were Chinese music (80 files) and Jazz (128 files). Melody contours (i.e. pitch sequences without timing details) were extracted from the MIDI file tracks. Both relative and absolute and pitch contours were used. The best performance of 92.35% was achieved by a 1-nearest neighbour classifier with normalized information distance based on Kolmogorov complexity estimates over pitch interval contours. A notable feature of our work is the use of the number of blocks in a pure Lempel-Zip parse of a string to estimate its Kolmogorov complexity.
|Number of pages||4|
|Publication status||Published - Oct 2004|
|Event||Proceedings of the Sound and Music Computing Conference (SMC'04) - Paris, France|
Duration: 20 Oct 2004 → 22 Oct 2004
|Conference||Proceedings of the Sound and Music Computing Conference (SMC'04)|
|Period||20/10/04 → 22/10/04|