Abstract
Support Vector Machines (SVMs) for classification – in short SVM – have been shown to be promising classification tools in many real-world problems. How to effectively extend binary SVC to multi-class classification is still an on-going research issue. In this article, instead of solving quadratic programming (QP) in Algorithm K-SVCR and Algorithm ν-K-SVCR, a linear programming (LP) problem is introduced in our algorithm. This leads to a new algorithm for multi-class problem, K-class Linear programming ν–Support Vector Classification-Regression(Algorithm ν-K-LSVCR). Numerical experiments on artificial data sets and benchmark data sets show that the proposed method is comparable to Algorithm K-SVCR and Algorithm ν-K-SVCR in errors, while considerably faster than them.
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 callDisclaimer: 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.
