liveBook · Manning

One-class svm

As explained in Timeless Algorithms, The Foundational Ideas

A one-class support vector machine estimates a region containing most training observations and identifies observations outside it as unusual.

When training data mostly describes normal cases, a one-class SVM estimates a region containing most observations. New observations outside that region may be flagged as anomalies or novel cases. section 8.8.1

Mathematically, it separates mapped training observations from the origin in feature space while allowing selected violations. This redirects support-vector ideas from separating two labeled classes toward detecting departures from an established pattern. section 8.8.1

One-class SVMs remain useful when normal observations are available but failures, defects, or intrusions are rare. Kernel methods can become computationally expensive as training data grows, and performance depends on choosing a suitable kernel and its parameters. section 8.8.2

How Timeless Algorithms, The Foundational Ideas covers it

How deep it goes
Describes feature-space separation and permitted violations, but does not develop the optimization or implementation procedure.
Examples
Situates one-class SVMs in detecting rare failures, defects, or intrusions when normal observations are available.
What you can do after
Apply it to flag observations outside a learned region when normal examples are available and failure examples are rare.
How it connects
Connects the method to support vector machines, kernels, margin-based optimization, and anomaly detection.

Also explained in

Compare how 2 books explain one-class svm →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Timeless Algorithms, The Foundational Ideas. The section links point to the parts of the book it draws on.