Kernel Methods for Pattern Analysis
Shawe-Taylor, J. and Cristianini, N. (2004) Kernel Methods for Pattern Analysis.
Download
Full text not available from this repository.
Description/Abstract
Kernel methods provide a powerful and unified framework for pattern discovery, motivating algorithms that can act on general types of data (e.g. strings, vectors or text) and look for general types of relations (e.g. rankings, classifications, regressions, clusters). The application areas range from neural networks and pattern recognition to machine learning and data mining. This book, developed from lectures and tutorials, fulfils two major roles: firstly it provides practitioners with a large toolkit of algorithms, kernels and solutions ready to use for standard pattern discovery problems in fields such as bioinformatics, text analysis, image analysis. Secondly it provides an easy introduction for students and researchers to the growing field of kernel-based pattern analysis, demonstrating with examples how to handcraft an algorithm or a kernel for a new specific application, and covering all the necessary conceptual and mathematical tools to do so.
| Item Type: | Article |
|---|---|
| Additional Information: | Address: Cambridge, UK |
| ISBNs: | 0521813972 |
| Related URLs: | |
| Divisions: | Faculty of Physical and Applied Science > Electronics and Computer Science |
| Item ID: | 259580 |
| Date Deposited: | 02 Mar 2005 |
| Last Modified: | 02 Mar 2012 12:39 |
| Contributors: | Shawe-Taylor, J. (Author) Cristianini, N. (Author) |
| Date: | July 2004 |
| Additional Information: | Address: Cambridge, UK |
| Status: | Published |
| Publisher: | Cambridge University Press |
| Further Information: | Google Scholar |
| URI: | http://eprints.soton.ac.uk/id/eprint/259580 |
Actions (login required)
 |
View Item |
