.png){kind=icon}
.png){kind=icon}
Return
Solving one-class problem with outlier examples by SVM
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2014.03.072.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Support Vector Data Description (SVDD) is an important algorithm for data description problem. SVDD uses only positive examples to learn a predictor whether an example is positive or negative. When a fraction of negative examples are available, the performance of SVDD is expected to be improved. SVDD-neg, as an extension of SVDD, learns a predictor with positive examples and a fraction negative ones. However, the performance of SVDD-neg becomes worse than SVDD in some cases when some negative examples are available. In this paper, a new algorithm SVM-SVDD is proposed, in which both Support Vector Machine (SVM) and SVDD are used to solve data description problem with negative examples. The experimental results illustrate that SVM-SVDD outperforms SVDD-neg on both training time and accuracy. (C) 2014 Elsevier B.V. All rights reserved.
Keywords:
SVM
SVDD
Data description
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
2.5W
Citations:
6.5W
Organization
View more organizations