Abstract
Support vector machine (SVM) has been applied very successfully in a variety of classification systems. We attempt to solve the primal programming problems of SVM by converting them into smooth unconstrained minimization problems. In this paper, a new twice continuously differentiable piecewise-smooth function is proposed to approximate the plus function, and it issues a piecewise-smooth support vector machine (PWSSVM). The novel method can efficiently handle large-scale and high dimensional problems. The theoretical analysis demonstrates its advantages in efficiency and precision over other smooth functions. PWSSVM is solved using the fast Newton-Armijo algorithm. Experimental results are given to show the training speed and classification performance of our approach. © 2013 Qing Wu and Wenqing Wang.
Cite
CITATION STYLE
Wu, Q., & Wang, W. (2013). Piecewise-smooth support vector machine for classification. Mathematical Problems in Engineering, 2013. https://doi.org/10.1155/2013/135149
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.