Review of Domain-Based Novelty Detection Using One Class Support Vector Machine
Bibliographic record
Abstract
Novelty detection is a critical task in machine learning and data mining, aiming to identify previously unseen or abnormal patterns that are not represented during model training.Among the available novelty detection paradigms, domain-description approaches are particularly attractive because they learn an explicit boundary of normal data without strong distributional assumptions.This paper provides a focused review of domain-based novelty detection methods with emphasis on Support Vector Machine (SVM) formulations, particularly Support Vector Data Description (SVDD) and One-Class Support Vector Machines (OCSVM).We summarize the theoretical foundations of one-class classification and review recent research that enhances SVDD and OCSVM through robust boundary learning, improved feature representations, and computational efficiency.Based on the analyzed literature, the main technical directions for improving OCSVM and SVDD can be grouped into three trends: (i) robustification via modified loss functions and outlier-resistant formulations, (ii) integration with feature learning frameworks such as deep models and hybrid architectures, and (iii) acceleration strategies for large-scale and high-dimensional settings.Despite consistent performance improvements across applications, parameter sensitivity, optimization complexity, and limited adaptability under evolving data distributions remain persistent challenges.Finally, we outline concrete research opportunities toward scalable, adaptive, and self-tuning domain-description models for reliable deployment in real-world novelty detection scenarios.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.007 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.003 | 0.003 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.002 | 0.002 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".