Binary classification based on SVDD projection and nearest neighbors
The SVDD (support vector data description) is one of the most well-known one-class support vector learning methods, in which one tries the strategy of utilizing balls defined on the feature space in order to distinguish a set of normal data from all other possible abnormal objects. The usual strategy of the SVDD depends on the process of finding the region for the normal-class training data with somewhat neglecting the distribution of the abnormal data, thus it may not work well if applied to the binary classification problems in which two classes have similar number of data. In this paper, we consider the problem of performing binary classification based on the SVDD techniques, and in order to overcome the possible drawback of the usual SVDD strategy focusing on the normal-class data only, we propose a new SVDD algorithm which is based on the use of two different SVDD balls for the positive and negative classes along with the SVDD projection and nearest neighbor rule. To investigate how the proposed method works, we compared the performance of the proposed method with SVC (support vector classifier) and conventional SVDD using several real datasets.