Scribd
Upload
2 views1 page

Support Vector Machines Overview

Support vector machines (SVMs) are supervised learning models used for classification and regression analysis, developed at AT&T Bell Laboratories. They utilize the kernel trick for non-linear classification by mapping data into high-dimensional feature spaces, making them robust to noisy data. SVMs are versatile and can also be applied to unsupervised learning tasks, but their predictive performance compared to other linear models remains uncertain.

Uploaded by

sam2k256
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
2 views1 page

Support Vector Machines Overview

Support vector machines (SVMs) are supervised learning models used for classification and regression analysis, developed at AT&T Bell Laboratories. They utilize the kernel trick for non-linear classification by mapping data into high-dimensional feature spaces, making them robust to noisy data. SVMs are versatile and can also be applied to unsupervised learning tasks, but their predictive performance compared to other linear models remains uncertain.

Uploaded by

sam2k256
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

Support vector machine

In machine learning, support vector machines (SVMs, also support vector


networks[1]) are supervised max-margin models with associated
learning algorithms that analyze data for classification and regression analysis.
Developed at AT&T Bell Laboratories,[1][2] SVMs are one of the most studied models,
being based on statistical learning frameworks of VC theory proposed
by Vapnik (1982, 1995) and Chervonenkis (1974).

In addition to performing linear classification, SVMs can efficiently perform non-linear


classification using the kernel trick, representing the data only through a set of
pairwise similarity comparisons between the original data points using a kernel
function, which transforms them into coordinates in a higher-dimensional feature
space. Thus, SVMs use the kernel trick to implicitly map their inputs into high-
dimensional feature spaces, where linear classification can be performed.[3] Being
max-margin models, SVMs are resilient to noisy data (e.g., misclassified examples).
SVMs can also be used for regression tasks, where the objective becomes -
sensitive.

The support vector clustering[4] algorithm, created by Hava Siegelmann and Vladimir
Vapnik, applies the statistics of support vectors, developed in the support vector
machines algorithm, to categorize unlabeled data.[citation needed] These data sets
require unsupervised learning approaches, which attempt to find natural clustering of
the data into groups, and then to map new data according to these clusters.

The popularity of SVMs is likely due to their amenability to theoretical analysis, and
their flexibility in being applied to a wide variety of tasks, including structured
prediction problems. It is not clear that SVMs have better predictive performance
than other linear models, such as logistic regression and linear regression.[5]

You might also like