A Simple-cycles weighted kernel based on harmony structure for similarity retrieval
(2011) Proceedings of the 12th International Society for Music Information Retrieval Conference (ISMIR 2011) — Location: Miami, Florida, USA (24.October.2011)
Files
2011_SimpleCyclesWeightedKernel.pdf
Restricted Access - Adobe PDF
- 266.32 KB
ASIMPLE-CYCLESWEIGHTEDKERNELBASEDONHARMONY.pdf
Restricted Access - Adobe PDF
- 258.54 KB
Details
- Authors
- Abstract
- This paper introduces a novel methodology for music similarity retrieval based on chord progressions. From each chord progression, a directed labeled graph containing the interval transitions is extracted. This graph will be used as input for a graph comparison method based on simple cycles – cycles where the only repeated nodes are the first and the last one. In music, simple cycles represent the repetitive sub-structures of, e.g., modern pop/rock music. By means of a kernel function [10] whose feature space is spanned by these simple cycles, we obtain a kernel matrix (similarity matrix) which can then be used in music similarity retrieval tasks. The resulting algorithm has a time complexity of O(n + m(c + 1)), where n is the number of vertices, m is the number of edges, and c is the number of simple cycles. The performance of our method is tested on both an idiom retrieval task, and a cover song retrieval task. Empirical re- sults show the improved accuracy of our method in comparison with other string-matching, and graph-comparison methods used as baseline.
- Affiliations
Citations
Garcia Diez, S., Saerens, M., Senelle, M., & Fouss, F. (2011). A Simple-cycles weighted kernel based on harmony structure for similarity retrieval. Proceedings of the 12th International Society for Music Information Retrieval Conference (ISMIR 2011), Miami, Florida, USA. https://hdl.handle.net/2078.5/225267