To minimize the primal support vector machine (SVM) problem, we propose to use iterative majorization. To allow for nonlinearity of the predictors, we use (non)monotone spline transformations. An advantage over the usual kernel approach in the dual problem is that the variables can be easily interpreted. We illustrate this with an example from the literature.
CITATION STYLE
Groenen, P. J. F., Nalbantov, G., & Bioch, J. C. (2007). Nonlinear support vector machines through iterative majorization and I-splines. In Studies in Classification, Data Analysis, and Knowledge Organization (pp. 149–161). Kluwer Academic Publishers. https://doi.org/10.1007/978-3-540-70981-7_18
Mendeley helps you to discover research relevant for your work.