Semi-supervised One-class SVM
Semi-supervised One-Class Support Vector Machine · Also known as: SS-OCSVM, semi-supervised OC-SVM, semi-supervised novelty detection SVM, transductive one-class SVM
Semi-supervised One-class SVM extends the classic One-class SVM anomaly detector by incorporating unlabeled observations alongside a small set of known normal examples. The unlabeled data helps the model learn a tighter, more informative decision boundary in feature space, reducing false positives and improving anomaly recall compared to the purely unsupervised baseline.
Read the full method
Sign in with a free account to read this section.
Method map
The neighbourhood of related methods — select a node to explore.
When to use it
Choose Semi-supervised One-class SVM when anomalies are rare, labeling all data is too costly, but a small confirmed-normal seed is available — for example network intrusion detection, medical imaging quality control, or manufacturing defect screening. It outperforms unsupervised OC-SVM when the labeled seed is clean and the unlabeled pool is large and representative of normal behavior. Do not use it when the labeled seed is noisy or biased, when the anomaly rate in the unlabeled pool is high (over roughly 10–20%), when you have many confirmed anomaly examples (supervised SVM or ensemble methods are better), or when interpretability and explicit coefficients are required by reviewers.
Strengths & limitations
- Leverages abundant unlabeled data to improve boundary quality without expensive full annotation.
- Inherits the kernel flexibility of standard One-class SVM, capturing nonlinear normal-data manifolds.
- Better calibrated anomaly scores than purely unsupervised OC-SVM when a clean labeled seed exists.
- Works well in high-dimensional feature spaces where normal data forms compact clusters.
- Anomaly score magnitude provides a natural confidence ranking for triage and prioritization.
- Performance degrades sharply if the labeled seed is small, noisy, or unrepresentative of true normal behavior.
- High contamination rates in the unlabeled pool cause pseudo-label drift and boundary corruption.
- Quadratic programming scales poorly: standard SVM solvers struggle above tens of thousands of observations.
- Requires careful kernel and nu hyperparameter tuning; defaults rarely yield optimal boundaries.
- Iterative pseudo-labeling adds implementation complexity and requires principled stopping criteria.
Frequently asked
How large does the labeled seed need to be?
In practice, even a few dozen confirmed-normal examples can initialize a useful boundary, but the labeled set should cover the main modes of normal behavior. If the seed is smaller than about 20–30 observations, the initial boundary will be unreliable and pseudo-label errors will compound.
What if the unlabeled pool is heavily contaminated with anomalies?
High contamination (above roughly 10–20% anomalies) causes the iterative refinement to gradually absorb anomalies into the normal class, corrupting the boundary. In such cases, use a lower pseudo-label acceptance threshold, apply ensemble voting across multiple runs, or fall back to the purely supervised One-class SVM on the labeled seed only.
How do I choose the kernel and nu parameter?
The RBF kernel is the standard default; tune its bandwidth (gamma) alongside nu using cross-validation on the labeled set. Nu controls the upper bound on the fraction of training errors and the fraction of support vectors — set it to roughly the expected anomaly rate if known.
Is this different from a transductive SVM (S3VM)?
Yes. Transductive SVM (S3VM) performs semi-supervised binary classification where both classes are partially labeled. Semi-supervised One-class SVM addresses anomaly detection: it uses only normal-class labels and treats unlabeled observations as potential normals, not as a second class to be classified.
Can I use this method at scale?
Standard SVM solvers have O(n^2) to O(n^3) complexity. For datasets above roughly 50,000 observations, use approximate solvers (e.g., SGD-based online updates, kernel approximations via Nystrom or random Fourier features) or switch to scalable alternatives such as Isolation Forest or deep autoencoder-based anomaly detectors.
Sources
- Munoz, A. & Muruzabal, J. (2004). Self-Organising Maps for Outlier Detection. Neurocomputing, 58–60, 953–956. link ↗
- Scholkopf, B., Platt, J. C., Shawe-Taylor, J., Smola, A. J., & Williamson, R. C. (2001). Estimating the support of a high-dimensional distribution. Neural Computation, 13(7), 1443–1471. DOI: 10.1162/089976601750264965 ↗
How to cite this page
ScholarGate. (2026, June 3). Semi-supervised One-Class Support Vector Machine. ScholarGate. https://scholargate.app/en/machine-learning/semi-supervised-one-class-svm
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- Autoencoder Anomaly DetectionMachine learning↔ compare
- Gaussian ProcessMachine learning↔ compare
- Isolation ForestMachine learning↔ compare
- One-class SVMMachine learning↔ compare
- Semi-supervised LearningMachine learning↔ compare