Piecewise-smooth support vector machine for classification
Summary: 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.
- Spline function smooth support vector machine for classification
- Smooth diagonal weighted Newton support vector machine
- A polynomial smooth twin support vector machines based on Newton-Armijo optimization
- SSVM: A smooth support vector machine for classification
- Penalized spline support vector classifiers computational issues
This page was built for publication: Piecewise-smooth support vector machine for classification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q459526)
