Using String Kernels to Identify Famous Performers from their Playing Style
Using String Kernels to Identify Famous Performers from their Playing Style
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.
ML, PLS, String Kernels
Saunders, Craig
26634635-4d4d-4469-b9ec-1d68788aa47a
Hardoon, David R.
05549e24-da95-4690-a3e2-3c672d2342b8
Shawe-Taylor, John
b1931d97-fdd0-4bc1-89bc-ec01648e928b
Widmer, Gerhard
051165fa-ee91-44ee-b89a-4c7f6c0e056d
2004
Saunders, Craig
26634635-4d4d-4469-b9ec-1d68788aa47a
Hardoon, David R.
05549e24-da95-4690-a3e2-3c672d2342b8
Shawe-Taylor, John
b1931d97-fdd0-4bc1-89bc-ec01648e928b
Widmer, Gerhard
051165fa-ee91-44ee-b89a-4c7f6c0e056d
Saunders, Craig, Hardoon, David R., Shawe-Taylor, John and Widmer, Gerhard
(2004)
Using String Kernels to Identify Famous Performers from their Playing Style.
The 15th European Conference on Machine Learning (ECML) and the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD), Pisa, Italy.
20 - 24 Sep 2004.
Record type:
Conference or Workshop Item
(Other)
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.
Text
FINAL_Published_ecml.pdf
- Other
More information
Published date: 2004
Additional Information:
Event Dates: 20-24 September
Venue - Dates:
The 15th European Conference on Machine Learning (ECML) and the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD), Pisa, Italy, 2004-09-20 - 2004-09-24
Keywords:
ML, PLS, String Kernels
Organisations:
Electronics & Computer Science
Identifiers
Local EPrints ID: 259522
URI: http://eprints.soton.ac.uk/id/eprint/259522
PURE UUID: 5ae6550d-eb01-4e8c-9d2a-989ed19fc18f
Catalogue record
Date deposited: 02 Mar 2005
Last modified: 14 Mar 2024 06:26
Export record
Contributors
Author:
Craig Saunders
Author:
David R. Hardoon
Author:
John Shawe-Taylor
Author:
Gerhard Widmer
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics