Robust nonparallel support vector machines via second-order cone programming.

Julio López, Sebastián Maldonado*, Miguel Carrasco

*Autor correspondiente de este trabajo

Resultado de la investigación: Contribución a una revistaArtículorevisión exhaustiva

9 Citas (Scopus)

Resumen

A novel binary classification approach is proposed in this paper, extending the ideas behind nonparallel support vector machine (NPSVM) to robust machine learning. NPSVM constructs two twin hyperplanes by solving two independent quadratic programming problems and generalizes the well-known twin support vector machine (TWSVM) method. Robustness is conferred on the NPSVM approach by using a probabilistic framework for maximizing model fit, which is cast into two second-order cone programming (SOCP) problems by assuming a worst-case setting for the data distribution of the training patterns. Experiments on benchmark datasets confirmed the theoretical virtues of our approach, showing superior average performance compared with various SVM formulations.
Idioma originalInglés
Páginas (desde-hasta)227-238
Número de páginas12
PublicaciónNeurocomputing
Volumen364
DOI
EstadoPublicada - 28 oct 2019

Nota bibliográfica

Publisher Copyright:
© 2019 Elsevier B.V.

Huella

Profundice en los temas de investigación de 'Robust nonparallel support vector machines via second-order cone programming.'. En conjunto forman una huella única.

Citar esto