Skip to contentScholarGate
LibraryBookshelfDeskReview StudioAssistant
Sign in
On this page
IntuitionHow it worksWhen to use itStrengths & limitationsCommon pitfallsApplicationsFrequently asked🔒 Read the full methodSourcesRelated methods
Cite this pageSpotted an issue on this page? Report or suggest a fix →
Home›Machine learning›Online One-Class SVM
Machine learningMachine learning

Online One-Class SVM

Online One-Class Support Vector Machine · Also known as: Online OC-SVM, Incremental One-Class SVM, Online SVDD, Sequential One-Class SVM

Online One-Class SVM is an incremental extension of the classical One-Class Support Vector Machine that updates its decision boundary as new data arrive one sample at a time, making it suitable for streaming environments and real-time anomaly or novelty detection without retraining from scratch.

ScholarGate
  1. Machine learning
  2. v1
  3. 2 Sources
  4. PUBLISHED
Cite this page →
Tools & resources
Download slides
Learn & explore

Read the full method

Members only

Sign in with a free account to read this section.

Sign in

Method map

The neighbourhood of related methods — select a node to explore.

Online One-class SVM
AutoencoderIsolation ForestLocal Outlier FactorOne-class SVM

When to use it

Use Online One-Class SVM when data arrive as a stream and the normal class is well-defined but anomalies are rare, unlabeled, or unpredictable — for example, intrusion detection, sensor fault detection, or credit-card fraud monitoring. It suits moderate-dimensional continuous feature spaces and situations where the distribution of normality can drift over time. Avoid it when the data are very high-dimensional (the kernel matrix grows large), when a full historical retraining is feasible, or when an explicit two-class boundary can be learnt; in those cases, full batch One-Class SVM, Isolation Forest, or a supervised classifier are better alternatives.

Strengths & limitations

Strengths
  • Processes data incrementally without full retraining, making it practical for real-time and streaming applications.
  • Inherits the strong theoretical foundations of One-Class SVM, including kernel-based nonlinear boundaries.
  • The nu hyperparameter gives intuitive control over the expected outlier fraction in training data.
  • Adaptable to concept drift: the boundary updates as the distribution of normality shifts over time.
  • No assumptions about the underlying data distribution (nonparametric in the kernel sense).
Limitations
  • Computational cost per update scales with the number of support vectors, which can grow unbounded without pruning strategies.
  • Sensitive to the choice of kernel and its hyperparameters (gamma for RBF), requiring careful tuning.
  • Performance degrades in very high-dimensional spaces due to the curse of dimensionality in the kernel feature space.
  • Requires a clean, anomaly-free (or nearly so) initial batch for proper initialization.

Frequently asked

How does Online One-Class SVM differ from the standard batch One-Class SVM?

The standard One-Class SVM trains once on a fixed dataset. The online variant incrementally adjusts its support vectors and decision boundary as each new sample arrives, making it suitable for streaming data without full retraining.

What does the nu parameter control?

Nu is an upper bound on the fraction of training points that can lie outside the boundary (potential outliers) and a lower bound on the fraction of points that are support vectors. A smaller nu creates a tighter boundary; a larger nu allows more training points to be treated as outliers.

How should I handle the growing support vector set?

Without budget management, the support vector set grows with the stream, increasing memory and computation. Practical implementations cap the budget by merging or removing the least influential support vectors — a step that must be configured explicitly in most libraries.

Is Online One-Class SVM suitable for high-dimensional data like raw text or images?

Generally not directly: kernel methods scale poorly with dimensionality. A common workaround is to first reduce dimensionality via PCA or an autoencoder and then apply Online OC-SVM on the compact representation.

What evaluation metric should I use?

Because anomalies are rare, accuracy is misleading. Use AUROC (area under the ROC curve) and the precision-recall curve, which give a honest picture of performance across different detection thresholds.

Sources

  1. Laskov, P., Gehl, C., Krueger, S., & Muller, K.-R. (2006). Incremental support vector learning: Analysis, implementation and applications. Journal of Machine Learning Research, 7, 1909–1936. link ↗
  2. Scholkopf, B., Williamson, R., Smola, A., Shawe-Taylor, J., & Platt, J. (1999). Support vector method for novelty detection. Advances in Neural Information Processing Systems (NIPS), 12, 582–588. link ↗

How to cite this page

ScholarGate. (2026, June 3). Online One-Class Support Vector Machine. ScholarGate. https://scholargate.app/en/machine-learning/online-one-class-svm

Related methods

AutoencoderIsolation ForestLocal Outlier FactorOne-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.

  • AutoencoderDeep learning↔ compare
  • Isolation ForestMachine learning↔ compare
  • Local Outlier FactorMachine learning↔ compare
  • One-class SVMMachine learning↔ compare
Compare side by side →

Similar methods

One-class SVMRobust One-class SVMActive learning One-class SVMBayesian one-class SVMExplainable One-Class SVMSemi-supervised One-class SVMEnsemble One-class SVMOnline Support Vector Machine

Related reference concepts

Support Vector ClassificationSupport Vector Machines and Kernel MethodsVC Dimension and CapacityQuadratic Discriminant AnalysisClassification and Discriminant AnalysisHyperparameter Optimization

Spotted an issue on this page? Report or suggest a fix →

ScholarGate — Online One-class SVM (Online One-Class Support Vector Machine). Retrieved 2026-07-21 from https://scholargate.app/en/machine-learning/online-one-class-svm · Dataset: https://doi.org/10.5281/zenodo.20539026
Quick facts
Originator
Laskov, P. et al. (incremental extension); Scholkopf, B. et al. (original OC-SVM)
Year
2006 (incremental/online variant); 1999 (base method)
Type
Online anomaly detection / novelty detection
DataType
Continuous, streaming or sequentially arriving feature vectors
Subfamily
Machine learning
Related methods
AutoencoderIsolation ForestLocal Outlier FactorOne-class SVM
ScholarGate

A content-first reference library for research methods — what each one is, how it works, and where it comes from.

Open data (CC-BY)

Explore

  • Library
  • Search the library…
  • Browse by field
  • Fields
  • Journey
  • Compare
  • Which method?

Reference

  • Subjects
  • Atlas
  • Glossary
  • Methodology
  • Philosophy

Your tools

  • Bookshelf
  • Desk
  • Chat

Company

  • About
  • Pricing
  • Contact
  • Suggest a method

Entries are compiled from published sources for reference. Verifying the accuracy and suitability of any information for your own use remains your responsibility.

© 2026 ScholarGate · A research-method reference library
  • Privacy
  • Cookies
  • Terms
  • Delete account