Active Learning One-class SVM
Active Learning with One-Class Support Vector Machine · Also known as: AL-OCSVM, active one-class SVM, active novelty detection SVM, query-driven OCSVM
Active Learning One-class SVM combines the one-class support vector machine — a kernel-based novelty detector that learns the boundary of normal data — with an active learning loop that selects the most informative unlabeled instances for expert annotation. The result is a data-efficient anomaly detector that improves its decision boundary with minimal labeling effort.
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
Use when anomalies or novelties must be detected but labeled examples are expensive, rare, or initially unavailable — typical in fraud detection, equipment fault monitoring, cybersecurity intrusion detection, and medical rare-disease screening. The method is well-suited when a reasonable supply of unlabeled normal data exists alongside a small seed of confirmed normal instances, and when an oracle (human expert or automatic tester) can label queried points. Avoid when the anomaly rate is so low that even active queries rarely hit anomalies, when the feature space is extremely high-dimensional without a meaningful kernel mapping, or when a fully automated pipeline without human-in-the-loop is required.
Strengths & limitations
- Dramatically reduces the number of expert labels needed to build an effective anomaly detector.
- Handles high-dimensional data well through kernel mappings, particularly the RBF kernel.
- Does not require anomaly examples at initialization — it bootstraps from normal data only.
- The active query strategy focuses annotation effort on the most decision-relevant region of the space.
- The OCSVM boundary is robust to outliers in the training set via the nu hyperparameter.
- Performance is sensitive to kernel choice and hyperparameter nu; poor defaults can yield a boundary that is too tight or too loose.
- Scalability is limited: OCSVM training cost grows roughly quadratically with the number of support vectors, making it slow on large datasets.
- If the initial labeled seed is not representative of the true normal region, early queries may mislead the model.
- Active learning assumes oracle availability and reliability; noisy or inconsistent labeling degrades the boundary.
Frequently asked
What is the difference between this method and a standard One-class SVM?
A standard One-class SVM trains once on all available labeled data. The active learning variant iterates: it trains on a small seed, queries the most informative unlabeled points, collects labels, and retrains. This makes the boundary more accurate with far fewer labeled examples.
How many labeled examples do I need to start?
Even a handful of confirmed normal examples (as few as 10–50) can seed the first OCSVM. The active loop then grows the labeled set strategically. Starting with too few examples risks an unstable initial boundary that misdirects early queries.
What query strategy should I use?
Margin sampling — querying instances closest to the current OCSVM decision boundary — is the most common choice. Density-weighted variants that also prefer points in dense regions of the input space tend to outperform pure margin sampling when the data has cluster structure.
How do I evaluate performance when anomaly labels are scarce?
Use area under the ROC curve (AUC-ROC) or area under the precision-recall curve (AUC-PR) on a held-out validation set that includes confirmed anomalies. Accuracy is misleading when anomalies are rare. If no anomaly labels exist at all, use visual inspection of the boundary in a low-dimensional projection.
When should I switch to a different anomaly detector?
If the dataset has more than a few thousand instances, Isolation Forest or Autoencoder-based detectors scale better. If you have enough labeled anomalies for supervised training, a standard binary SVM or gradient boosted classifier will generally outperform OCSVM.
Sources
- Schölkopf, B., Platt, J. C., Shawe-Taylor, J., Smola, A. J., & Williamson, R. C. (1999). Estimating the Support of a High-Dimensional Distribution. Neural Computation, 13(7), 1443–1471. DOI: 10.1162/089976601750264965 ↗
- Settles, B. (2009). Active Learning Literature Survey. Computer Sciences Technical Report 1648, University of Wisconsin–Madison. link ↗
How to cite this page
ScholarGate. (2026, June 3). Active Learning with One-Class Support Vector Machine. ScholarGate. https://scholargate.app/en/machine-learning/active-learning-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.
- Active LearningMachine learning↔ compare
- Isolation ForestMachine learning↔ compare
- One-class SVMMachine learning↔ compare
- Semi-supervised LearningMachine learning↔ compare