Improving support vector domain description by maximizing the distance between negative examples and the minimal sphere center's

摘要

Support Vector Domain Description (SVDD) is an effective kernel-based method used for data description. It was motivated by the success of Support Vector Machine (SVM) and thus has inherited many of its attractive properties. It has been extensively used for novelty detection and has been applied successfully to a variety of classification problems. This classifier aims to find a sphere with minimal volume including the majority of examples that belong to the class of interest (positive) and excluding the most of examples that are either outliers or belong to other classes (negatives). In this paper we propose a new approach to improve the classification accuracy of SVDD. This objective will be achieved by exploiting the existence of negative examples in the training step, without increasing the computational time and memory resources required to solve the quadratic programming problem of that classifier. Simulation results on two challenging artificial problems, namely chessboard and two spirals, and four benchmark datasets have successfully validated the effectiveness of the proposed method.