A unified model for support vector machine and support vector data description

Support vector machine (SVM) and support vector data description (SVDD) are the well-known kernel-based methods for pattern classification. SVM constructs an optimal hyperplane whereas SVDD constructs an optimal hypersphere to separate data between two classes. SVM and SVDD have been compared in pattern classification experiments however there is no theoretical work on comparison between these methods. This paper presents a new theoretical model to unify SVM and SVDD. The proposed model constructs two optimal points to generate a general decision boundary which can be transformed to hyperplane for SVM or hypersphere for SVDD.