Support vector machine
A support vector machine is a supervised-learning model that uses support vectors to determine a maximum-margin decision boundary or regression function, optionally using kernels to model nonlinear relationships.
Grokking Machine Learning
A model that separates classes or fits targets using an optimized margin and support vectors.
- How it is used
- Uses margin-based classification to choose robust linear boundaries and extend classification to nonlinear datasets through kernels.
- How deep it goes
- Explains geometry, error terms, C, Scikit-Learn coding, and kernels, while stopping short of a full optimization derivation.
- Examples
- Uses competing separating lines, parallel margin diagrams, linear.csv, C comparisons, and the XOR dataset.
- What you can do after
- Apply SVMs via Scikit-Learn, tune C, compare margins, and select kernels for nonlinear classification.
Read how Grokking Machine Learning explains support vector machine →
Sutskever's List
A support vector machine is a supervised learning model that determines decision boundaries using maximum-margin principles.
- How it is used
- Classifies engineered visual features as a shallow alternative to systems that learn hierarchical representations.
- How deep it goes
- Defines sharp boundaries and maximum margins, and notes convex optimization, but does not derive the optimization procedure.
- Examples
- Uses SVMs as classifiers for engineered image features, including pipelines built from SIFT descriptors.
- What you can do after
- Evaluate SVMs as fixed-feature classifiers and contrast their scaling limits with deep learning.
Machine Learning Algorithms in Depth
A supervised learning model that separates classes by selecting a decision boundary with a large margin, optionally using a kernel for nonlinear separation.
- How it is used
- Uses maximum-margin optimization to classify discrete outputs in supervised learning.
- How deep it goes
- Derives primal and dual optimization, kernels, geometry, and implementation details, but does not document a complete application workflow.
- Examples
- Uses margin-boundary geometry, an RBF kernel implementation, pseudo-code, and an Iris classification listing.
- What you can do after
- Builds an SVM from scratch with configurable kernels and trains it through the described optimization.
Read how Machine Learning Algorithms in Depth explains support vector machine →
Data-Driven Cybersecurity
A support vector machine is a supervised-learning model that separates classes or predicts values by constructing a boundary based on support vectors.
- How it is used
- Deploys supervised classification to separate benign activity from phishing, malware, or suspicious network behavior.
- How deep it goes
- Explains boundary-based classification and demonstrates training and evaluation, but does not detail optimization or support-vector internals.
- Examples
- Uses scam emails, malicious network traffic, login activity, and a Python classification report as teaching examples.
- What you can do after
- Apply SVM through Python to classify labeled network or login activity and compare its reported performance with another model.
Read how Data-Driven Cybersecurity explains support vector machine →
Ensemble Methods for Machine Learning
A support vector machine is a supervised learning model that finds a maximum-margin separating function, optionally using kernels to represent nonlinear decision boundaries.
- How it is used
- Provides an off-the-shelf baseline for supervised classification and regression while exposing a fit-versus-complexity tradeoff.
- How deep it goes
- Explains kernels, support vectors, C, validation, and overfitting, but stops short of optimization internals.
- Examples
- Uses synthetic supervised regression, Friedman-1 data, RBF-kernel SVR code, validation curves, and complexity figures.
- What you can do after
- Apply it via scikit-learn, choose kernels, tune C, and diagnose overfitting through training and test scores.
Read how Ensemble Methods for Machine Learning explains support vector machine →
Related concepts
- kernel functionuses · A kernel function is a mathematical function that measures similarity between pairs of inputs, often representing an inner product in an implicit feature space.
- convex optimizationuses · Convex optimization is the minimization or maximization of a convex or concave objective over a convex feasible set, a structure that permits global optimality guarantees.
- anomaly detectionuses · Anomaly detection is the identification of observations, events, or behaviors that substantially deviate from expected patterns or a normal baseline.
- classifierkind of · A classifier is a predictive computational model that assigns inputs to one or more discrete classes or categories.
These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.