Quadratic Kernel-Free Least Square Twin Support Vector Machine for Binary Classification Problems
- 1 Downloads
In this paper, a new quadratic kernel-free least square twin support vector machine (QLSTSVM) is proposed for binary classification problems. The advantage of QLSTSVM is that there is no need to select the kernel function and related parameters for nonlinear classification problems. After using consensus technique, we adopt alternating direction method of multipliers to solve the reformulated consensus QLSTSVM directly. To reduce CPU time, the Karush-Kuhn-Tucker (KKT) conditions is also used to solve the QLSTSVM. The performance of QLSTSVM is tested on two artificial datasets and several University of California Irvine (UCI) benchmark datasets. Numerical results indicate that the QLSTSVM may outperform several existing methods for solving twin support vector machine with Gaussian kernel in terms of the classification accuracy and operation time.
KeywordsTwin support vector machine Quadratic kernel-free Least square Binary classification
Mathematics Subject Classification68T99 90C20
We are very grateful to the editor and the anonymous reviewers for their helpful and valuable comments of this paper.
- 2.Deng, N., Tian, Y., Zhang, C.: Support Vector Machines: Optimization Based Theory, Algorithms, and Extensions, pp. 1–28. Chapman and Hall/CRC, London (2012)Google Scholar
- 6.Narayana, K.V., Manoj, V.V.R., Swathi, K.: Enhanced face recognition based on PCA and SVM. Int. J. Comput. Appl. 117(2), 40–42 (2015)Google Scholar
- 12.Jayadeva, Khemchandani, R., Chandra, S: Twin support vector machines for pattern classification. IEEE Trans. Pattern Anal. Mach. Intell. 29(5), 905–910 (2007)Google Scholar
- 19.Tian, Y., Qi, Z., Ju, X., Shi, Y., Liu, X.: Nonparallel support vector machines for pattern classification. IEEE Trans. Syst. Man. Cybern. 44(7), 1067–1079 (2014)Google Scholar