USING POINT-SET COMPRESSION TO CLASSIFY FOLK SONGS

Thirteen different compression algorithms were used to calculate the normalized compression distances (NCDs) between pairs of tunes in the Annotated Corpus of 360 Dutch folk songs from the collection Onder de groene linde. These NCDs were then used in conjunction with the 1-nearest-neighbour algorithm and leave-one-out cross-validation to classify the 360 melodies into tune families. The classifications produced by the algorithms were compared with a ground-truth classification prepared by expert musicologists. Twelve of the thirteen compressors used in the ex-periment were based on the discovery of translational equivalence classes (TECs) of maximal translatable patterns (MTPs) in point-set representations of the melodies. The twelve algorithms con-sisted of four variants of each of three basic algorithms, COSI-ATEC, SIATECCOMPRESS and Forth’s algorithm. The main difference between these algorithms is that COSIATEC strictly partitions the input point set into TEC covered sets, whereas the TEC covered sets in the output of SIATECCOMPRESS and Forth’s algorithm may share points. The general-purpose compressor, bzip2, was used as a baseline against which the point-set com-pression algorithms were compared. The highest classification success rate of 77–84 % was achieved by COSIATEC, followed by 60–64 % for Forth’s algorithm and then 52–58 % for SIATE-CCOMPRESS. When the NCDs were calculated using bzip2, the success rate was only 12.5%. The results demonstrate that the effectiveness of NCD for measuring similarity between folk-songs for classification purposes is highly dependent upon the actual compressor chosen. Furthermore, it seems that compres-sors based on finding maximal repeated patterns in point-set rep-resentations of music show more promise for NCD-based mu-sic classification than general-purpose compressors designed for compressing text strings. 1