Abstract
Universum twin support vector machine (U -TSVM) is an efficient method for binary classification problems. In this paper, we improve the U -TSVM algorithm and propose an improved Universum twin bounded support vector machine (named as IUTBSVM).
Indeed, by introducing a different Lagrangian function for the primal problems, we obtain new dual formulations so that we do not need to compute inverse matrices. Also to reduce the computational time of the proposed method, we suggest smaller size of the rectangular kernel matrices than the other methods.
Numerical experiments on several UCI benchmark data sets indicate that the IUTBSVM is more efficient than the other three algorithms, namely U -SVM, TSVM, and U -TSVM in sense of the classification accuracy. (C) 2021, Springer Nature Switzerland AG.