Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of the Operations Research Society of China
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
