Deng / Tian / Zhang | Support Vector Machines | E-Book | sack.de
E-Book

Deng / Tian / Zhang Support Vector Machines

Optimization Based Theory, Algorithms, and Extensions
Erscheinungsjahr 2013
ISBN: 978-1-4398-5793-9
Verlag: Taylor & Francis
Format: PDF
Kopierschutz: Adobe DRM (»Systemvoraussetzungen)

Optimization Based Theory, Algorithms, and Extensions

E-Book, Englisch, 363 Seiten

Reihe: Chapman & Hall/CRC Data Mining and Knowledge Discovery Series

ISBN: 978-1-4398-5793-9
Verlag: Taylor & Francis
Format: PDF
Kopierschutz: Adobe DRM (»Systemvoraussetzungen)



Support Vector Machines: Optimization Based Theory, Algorithms, and Extensions presents an accessible treatment of the two main components of support vector machines (SVMs)—classification problems and regression problems. The book emphasizes the close connection between optimization theory and SVMs since optimization is one of the pillars on which SVMs are built.

The authors share insight on many of their research achievements. They give a precise interpretation of statistical leaning theory for C-support vector classification. They also discuss regularized twin SVMs for binary classification problems, SVMs for solving multi-classification problems based on ordinal regression, SVMs for semi-supervised problems, and SVMs for problems with perturbations.

To improve readability, concepts, methods, and results are introduced graphically and with clear explanations. For important concepts and algorithms, such as the Crammer-Singer SVM for multi-class classification problems, the text provides geometric interpretations that are not depicted in current literature.

Enabling a sound understanding of SVMs, this book gives beginners as well as more experienced researchers and engineers the tools to solve real-world problems using SVMs.

Deng / Tian / Zhang Support Vector Machines jetzt bestellen!

Zielgruppe


Researchers in machine learning, data mining, and operations research.

Weitere Infos & Material


Optimization
Optimization Problems in Euclidian Space
Convex Programming in Euclidean Space
Convex Programming in Hilbert Space
Convex Programming with Generalized Inequality Constraints in Rn
Convex Programming with Generalized Inequality Constraints in Hilbert Space

Linear Classification Machines
Presentation of Classification Problems
Support Vector Classification (SVC) for Linearly Separable Problems
Linear Support Vector Classification

Linear Regression Machines
Regression Problems and Linear Regression Problems
Hard e-Band Hyperplane
Linear Hard e-Band Support Vector Regression
Linear e-Support Vector Regression

Kernels and Support Vector Machines
From Linear Classification to Nonlinear Classification
Kernels
Support Vector Machines and Their Properties
Meaning of Kernels

Basic Statistical Learning Theory of C-Support Vector Classification
Classification Problems on Statistical Learning Theory
Empirical Risk Minimization
Vapnik Chervonenkis (VC) Dimension
Structural Risk Minimization
An Implementation of Structural Risk Minimization
Theoretical Foundation of C-Support Vector Classification on Statistical Learning Theory

Model Construction
Data Generation
Data Preprocessing
Model Selection
Rule Extraction

Implementation
Stopping Criterion
Chunking
Decomposing
Sequential Minimal Optimization
Software

Variants and Extensions of Support Vector Machines
Variants of Binary Classification
Variants of Regression
Multi-Class Classification
Semi-Supervised Classification
Universum Classification
Privileged Classification
Knowledge-Based Classification
Robust Classification
Multi-Instance Classification
Multi-Label Classification
Bibliography
Index



Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.