Data description is an important problem that has many applications. Despite the great success, the popular support vector data description (SVDD) has problem with generalization and scalability when training data contains a significant amount of outliers. We propose in this paper the so-called ramp loss SVDD then prove its scalability and robustness. For solving the proposed problem, we develop an efficient algorithm based on DC (Difference of Convex functions) programming and DCA (DC Algorithm). Preliminary experiments on both synthetic and real data show the efficiency of our approach.
CITATION STYLE
Xuanthanh, V., Bach, T., Le Thi, H., & Dinh, T. (2017). Ramp loss support vector data description. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10191 LNAI, pp. 421–431). Springer Verlag. https://doi.org/10.1007/978-3-319-54472-4_40
Mendeley helps you to discover research relevant for your work.