Abstract

This article puts forward a novel smooth rotated hyperbola model for support vector machine (RHSSVM) for classification. As is well known, the Support vector machine (SVM) is based on Statistical Learning Theory and performs its high precision on data classification. However, the objective function is non-differentiable at the zero point. Therefore the fast algorithms cannot be used to train and test the SVM. To deal with it, the proposed method is based on the approximation property of the hyperbola to its asymptotic lines. Firstly, we describe the development of RHSSVM from the basic linear SVM optimization programming. Then we extend the linear model to non-linear model. We prove the solution of RHSSVM is convergent, unique, and global optimal. We show how RHSSVM can be practically implemented. At last, the theoretical analysis illustrates that compared with other three typical models, the rotated hyperbola model has the least error on approximating the plus function. Meanwhile, computer simulations show that the RHSSVM can reduce the consuming time at most 54.6% and can efficiently handle large scale and high dimensional programming.