Nonlinear support vector machines through iterative majorization and I-splines

Patrick J.F. Groenen, Georgi Nalbantov, J. Cor Bioch

Research output: Chapter/Conference proceedingConference proceedingAcademicpeer-review

1 Citation (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationAdvances in Data Analysis - Proceedings of the 30th Annual Conference of the Gesellschaft fur Klassifikation e.V., GfKl 2006
Pages149-161
Number of pages13
DOIs
Publication statusPublished - 2007
Event30th Annual Conference of the German Classification Society (Gesellschaft fur Klassifikation) on Advances in Data Analysis, GfKl 2006 - Berlin, Germany
Duration: 8 Mar 200610 Mar 2006

Publication series

SeriesStudies in Classification, Data Analysis, and Knowledge Organization
ISSN1431-8814

Conference

Conference30th Annual Conference of the German Classification Society (Gesellschaft fur Klassifikation) on Advances in Data Analysis, GfKl 2006
Country/TerritoryGermany
CityBerlin
Period8/03/0610/03/06

Fingerprint

Dive into the research topics of 'Nonlinear support vector machines through iterative majorization and I-splines'. Together they form a unique fingerprint.

Cite this