Kernel Methods for Pattern Analysis
John S. Shawe-Taylor, Nello Cristianini · Cambridge University Press eBooks · 2004
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.
Cited by 6,587 works. doi:10.1017/cbo9780511809682
Authors
References
- Statistical Learning Theory
- A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Boosting the margin: a new explanation for the effectiveness of voting methods
- Probability Inequalities for sums of Bounded Random Variables
- An Introduction to Support Vector Machines
- An Introduction to Computational Learning Theory
- The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network
- On the method of bounded differences
- Structural risk minimization over data-dependent hierarchies