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

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

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

19 Scopus citations


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.

Original languageEnglish
Pages (from-to)227-238
Number of pages12
StatePublished - 28 Oct 2019

Bibliographical note

Funding Information:
This work was supported by FONDECYT project 1160894 and 1160738 . This research was partially funded bythe Complex Engineering Systems Institute, ISCI (ICM-FIC: P05-004-F, CONICYT : FB0816 ).

Publisher Copyright:
© 2019 Elsevier B.V.


  • Nonparallel support vector machines
  • Robustness
  • Second-order cone programming
  • Support vector machines
  • Twin support vector machines


Dive into the research topics of 'Robust nonparallel support vector machines via second-order cone programming.'. Together they form a unique fingerprint.

Cite this