Support Vector Machines for optimal boundary separation.
For a small example, separate two tiny clusters with several possible lines. Identify support vectors, calculate which line has the widest margin, and see why distant points do not move it.
Thousands of word features represent short support tickets. Scale inputs where needed, tune C with nested validation, compare linear and kernel variants, and inspect margin errors.
Initializing Interactive Playground...
Predict how one control changes the SVM result.
The starter deliberately follows a tempting but flawed assumption: Using an RBF kernel without scaling
Check: Your saved hypothesis predicts a direction, the experiment tests it, and the result changes or supports your explanation.
Explanations after each answer · 80% to pass · SVM
Chapter 1 of 5 · Core
The Support Vector Machine (SVM) is a classification framework rooted in convex geometry and statistical learning theory (specifically Vapnik-Chervonenkis theory). Let us consider a binary classification task with training dataset , where represents the feature vector, and denotes the binary class label. We assume initially that the classes are linearly separable in the input space.
We seek a separating hyperplane parameterized by a weight vector and a bias scalar : The decision rule is given by the sign of the affine transformation: .
Geometric Margin Derivation: The algebraic distance of any point to the hyperplane is the orthogonal projection of the vector (where is any point on the hyperplane) onto the unit normal vector : Since , we can define the geometric margin of the observation as: The geometric margin of the entire dataset, , is the minimum distance from any training point to the separating hyperplane:
We want to find parameters that maximize this geometric margin . Since the geometric margin is invariant to the scaling of both and by any positive scalar factor, we can introduce a scale normalization constraint. Specifically, we set the functional margin of the closest point to unity: Under this normalization, the geometric margin is simply: Maximizing the geometric margin is mathematically identical to minimizing , which we write as the convex quadratic programming (QP) Primal Problem:
Key equations
Support Vector Machines Part 1
StatQuest
Understand margins and support vectors before moving to kernels and nonlinear boundaries.
Primary sources and free technical reading for SVM.
Free R and Python editions with worked labs for regression, classification, trees, support vectors, and clustering.
Official guidance on kernels, scaling, multiclass behavior, and computational tradeoffs.