Simple incremental one-class support vector classification

7Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We introduce the OneClassMaxMinOver (OMMO) algorithm for the problem of one-class support vector classification. The algorithm is extremely simple and therefore a convenient choice for practitioners. We prove that in the hard-margin case the algorithm converges with to the maximum margin solution of the support vector approach for one-class classification introduced by Schölkopf et al. Furthermore, we propose a 2-norm soft margin generalisation of the algorithm and apply the algorithm to artificial datasets and to the real world problem of face detection in images. We obtain the same performance as sophisticated SVM software such as libSVM. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Labusch, K., Timm, F., & Martinetz, T. (2008). Simple incremental one-class support vector classification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5096 LNCS, pp. 21–30). https://doi.org/10.1007/978-3-540-69321-5_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free