The University of Southampton
University of Southampton Institutional Repository

Using String Kernels to Identify Famous Performers from their Playing Style

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.
1088-467x
Saunders, Craig
26634635-4d4d-4469-b9ec-1d68788aa47a
Hardoon, David
e9eb22b2-daf6-460c-94b1-8208c917f862
Shawe-Taylor, John
b1931d97-fdd0-4bc1-89bc-ec01648e928b
Widmer, Gerhard
051165fa-ee91-44ee-b89a-4c7f6c0e056d
Saunders, Craig
26634635-4d4d-4469-b9ec-1d68788aa47a
Hardoon, David
e9eb22b2-daf6-460c-94b1-8208c917f862
Shawe-Taylor, John
b1931d97-fdd0-4bc1-89bc-ec01648e928b
Widmer, Gerhard
051165fa-ee91-44ee-b89a-4c7f6c0e056d

Saunders, Craig, Hardoon, David, Shawe-Taylor, John and Widmer, Gerhard (2008) Using String Kernels to Identify Famous Performers from their Playing Style. Intelligent Data Analysis, 12 (4).

Record type: Article

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.

This record has no associated files available for download.

More information

Published date: 2008
Additional Information: To appear
Organisations: Electronics & Computer Science

Identifiers

Local EPrints ID: 265198
URI: http://eprints.soton.ac.uk/id/eprint/265198
ISSN: 1088-467x
PURE UUID: b05f7091-b7a9-4d7d-9358-0b1df402c23d

Catalogue record

Date deposited: 23 Feb 2008 16:00
Last modified: 08 Jan 2022 14:48

Export record

Contributors

Author: Craig Saunders
Author: David 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

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×