Support Vector Machine
Version 1.0.0 · Updated 2026-07-30
CORE DEFINITION
In high-dimensional space, find the optimal hyperplane that maximizes the classification margin.
SCAFFOLDING EFFECT
Reduce cognitive load
Finding the optimal boundary. It's not just about distinguishing, but finding the most robust way to distinguish—this thinking can be transferred to other classification problems.
Anchor fast decisions
The core of support vector machines is to find a hyperplane in the feature space that maximizes the 'margin' between two classes of samples. The sample points closest to the hyperplane that determine the margin boundary are called 'support vectors'. The model is determined solely by these key points and is independent of samples far from the boundary. Through the kernel function, low-dimensional linearly inseparable data can be mapped to a high-dimensional space, thereby finding a linearly separable hyperplane in high dimensions. The regularization parameter trades off between margin maximization and classification errors to prevent overfitting.
MINIMUM ACTION
In progress 0/1Practice this model in one real situation:
account_treeGenealogyexpand_more
menu_bookReferencesexpand_more
Source support: Explicit
- en.wikipedia.orghttps://en.wikipedia.org/wiki/Support_vector_machineverified
PRIVATE NOTES · Only visible to you
SAVED Q&A
ENTRY Q&A · Private saving available
Ask with a clear boundary
thinkingmodels answers from published entry context only.
Your question is sent to thinkingmodels. The answer uses public entry context only.
RELATED MODELS