Abstract
In this paper we show a novel application of string kernels: that is to the problem of recognising famous pianists
from their style of playing. The characteristics of performers playing the same piece are obtained from changes
in beat-level tempo and beat-level loudness, which over the time of the piece form a performance worm. From
such worms, general performance alphabets can be derived, and pianists performances can then be represented
as strings. We show that when using the string kernel on this data, both kernel partial least squares and Support
Vector Machines outperform the current best results. Furthermore we suggest a new method of obtaining feature
directions from the Kernel Partial Least Squares algorithm and show that this can deliver better performance than
methods previously used in the literature when used in conjunction with a Support Vector Machine.
Keywords: String kernel, Partial Least Squares, Support Vector Machine, Music.
| Original language | English |
|---|---|
| Pages (from-to) | 425-440 |
| Number of pages | 16 |
| Journal | Intelligent Data Analysis |
| Volume | 12 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - 2008 |
Fields of science
- 102 Computer Sciences
- 102001 Artificial intelligence
- 102003 Image processing
- 102015 Information systems
- 202002 Audiovisual media