.png){kind=icon}
Return
lp-Norm Support Vector Data Description
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patcog.2022.108930.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The support vector data description (SVDD) approach serves as a de facto standard for one-class classification where the learning task entails inferring the smallest hyper-sphere to enclose target objects while linearly penalising the errors/slacks via an l 1-norm penalty term. In this study, we generalise this modelling formalism to a general p -norm (p = 1) penalty function on slacks. By virtue of an lp-norm function, in the primal space, the proposed approach enables formulating a non-linear cost for slacks. From a dual problem perspective, the proposed method introduces a dual norm into the objective function, thus, proving a controlling mechanism to tune into the intrinsic sparsity/uniformity of the problem for enhanced descriptive capability. A theoretical analysis based on Rademacher complexities characterises the generalisation performance of the proposed approach while the experimental results on several datasets confirm the merits of the proposed method compared to other alternatives. (c) 2022 Elsevier Ltd. All rights reserved.
Keywords:
One-class classification
Kernel methods
Support vector data description
l(p)-norm penalty
Journal
IF:
7.6
Papers:
1.3W
Citations:
4.5W
Organization
Cited Papers
ShareSaveShareSaveVideo anomaly detection and localization using motion-field shape description and homogeneity testing.png)
PATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
ShareSaveShareSaveClient-specific anomaly detection for face presentation attack detectionPATTERN RECOGNITION
OAAI
PATTERN RECOGNITIONIF7.6
OAAIShareSave
ShareSaveMatrix-Regularized One-Class Multiple Kernel Learning for Unseen Face Presentation Attack Detection
PREAI
ShareSaveShareSave
View more