.png){kind=icon}
Return
Robust one-class support vector machine
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neunet.2025.107416.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
One-Class Support Vector Machine (OCSVM) is an effective algorithm in one-class classification task. However, it exhibits sensitivity to noise and outliers. Current solutions often employ bounded loss functions that impose finite but relatively large penalties on noise or outliers, and these loss functions suffer from limitations of discontinuity and non-differentiability. To address these issues, this paper introduces a novel, continuous, smooth, and differentiable loss function, namely Quadratic Type Squared Error Loss Function (QTSELF), and proposes a more robust OCSVM (Q-OCSVM). Q-OCSVM not only differentiates samples based on their positions and applies distinct treatments accordingly but also enhances model robustness by imposing minimal penalties on noise and outliers. Moreover, the elegant mathematical properties of the loss function facilitate model optimization. Theoretical analysis utilizes Rademacher complexity theory to conduct the generalization error bound of the model. Momentum method is used to optimize Q-OCSVM. Extensive experiments convincingly demonstrate that Q-OCSVM outperforms the benchmark techniques.
Keywords:
One-class support vector machine
Loss function
Robustness
Momentum
Journal
IF:
6.3
Papers:
8.3K
Citations:
3.0W
Organization
No organization information available
Cited Papers
ShareSaveShareSaveMinimum variance-embedded deep kernel regularized least squares method for one-class classification and its applications to biomedical data.png)
NEURAL NETWORKS
OAAI
NEURAL NETWORKSIF6.3
OAAIShareSaveARAE: Adversarially robust training of autoencoders improves novelty detectionNEURAL NETWORKSOAAI
NEURAL NETWORKSIF6.3
OAAIShareSaveShareSaveShareSaveEfficient Anomaly Detection for High-Dimensional Sensing Data With One-Class Support Vector Machine
PREAI
ShareSave
View more