Kernel Methods for Pattern Analysis

Inbunden, Engelska, 2004

AvJohn Shawe-Taylor,Nello Cristianini,John (University of Southampton) Shawe-Taylor,Davis) Cristianini, Nello (University of California

1 489 kr

Beställningsvara. Skickas inom 7-10 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

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.

Produktinformation

Utgivningsdatum2004-06-28
Mått170 x 249 x 30 mm
Vikt1 000 g
FormatInbunden
SpråkEngelska
Antal sidor478
FörlagCambridge University Press
ISBN9780521813976

Tillhör följande kategorier

Matematik inom Naturvetenskap och teknik
Affärsapplikationer inom Data och IT
Systemvetenskap och AI inom Data och IT

Preface; Part I. Basic Concepts: 1. Pattern analysis; 2. Kernel methods: an overview; 3. Properties of kernels; 4. Detecting stable patterns; Part II. Pattern Analysis Algorithms: 5. Elementary algorithms in feature space; 6. Pattern analysis using eigen-decompositions; 7. Pattern analysis using convex optimisation; 8. Ranking, clustering and data visualisation; Part III. Constructing Kernels: 9. Basic kernels and kernel types; 10. Kernels for text; 11. Kernels for structured data: strings, trees, etc.; 12. Kernels from generative models; Appendix A: proofs omitted from the main text; Appendix B: notational conventions; Appendix C: list of pattern analysis methods; Appendix D: list of kernels; References; Index.