
A classifier that separates classes by the widest possible margin.A support vector machine (SVM) is a supervised learning model that finds the hyperplane that best separates data points of different classes. The 'best' hyperplane is the one with the largest margin—the maximum distance to the nearest points of any class, called support vectors. This margin maximization gives the model good generalization to unseen data. SVMs can handle both linear and non-linear separation by using kernel functions that implicitly map data into higher-dimensional spaces.
Developed in the 1990s by Vladimir Vapnik and colleagues at AT&T Bell Laboratories, building on earlier work in statistical learning theory.
Given labeled data, the SVM solves an optimization problem to find the hyperplane that maximizes the margin while minimizing classification errors (soft margin). The support vectors are the data points closest to the hyperplane; they define the margin and the decision boundary. For non-linear data, a kernel function (e.g., radial basis function) computes dot products in a high-dimensional feature space without explicitly transforming the data, allowing complex boundaries.
Widely used in image classification, text categorization (e.g., spam detection), and bioinformatics for protein classification.
SVMs perform well even with high-dimensional data, such as thousands of features, because the margin maximization acts as a form of regularization.












