An improved least squares Twin Support Vector Machine

Twin Support Vector Machine (TSVM), as an effective classification tool, tries to find two non-parallel planes that can be obtained by solving two Quadratic Programming Problems (QPPs). The QPPs lead to higher computational costs. The least squares twin SVM (LS-TSVM), as a variant of TSVM, attempts to avoid the above deficiency and obtains two non-parallel planes directly by solving two sets of linear equations. However, LS-TSVM implements the empirical risk minimization principle instead of the structural risk minimization principle, i.e., only training error of samples of two classes is considered in the objective function of LS-TSVM, and it easily leads to over-fitting problem. To overcome this drawback, an improved LS-TSVM is proposed in this paper, which enhances the classification accuracy of the classifier. Numerical experiments on seven benchmark datasets demonstrate the feasibility and validity of the proposed algorithm. Copyright © 2012 Binary Information Press.