Regularized minimax probability machine

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

Research output: Contribution to journalArticlepeer-review

3 Scopus citations


. In this paper, we propose novel second-order cone programming formulations for binary classification, by extending the Minimax Probability Machine (MPM) approach. Inspired by Support Vector Machines, a regularization term is included in the MPM and Minimum Error Minimax Probability Machine (MEMPM) methods. This inclusion reduces the risk of obtaining ill-posed estimators, stabilizing the problem, and, therefore, improving the generalization performance. Our approaches are first derived as linear methods, and subsequently extended as kernel-based strategies for nonlinear classification. Experiments on well-known binary classification datasets demonstrate the virtues of the regularized formulations in terms of predictive performance.
Original languageAmerican English
Pages (from-to)127-135
Number of pages9
JournalKnowledge-Based Systems
StatePublished - 1 Aug 2019


  • Minimax probability machine
  • Regularization
  • Second-order cone programming
  • Support vector machines

Fingerprint Dive into the research topics of 'Regularized minimax probability machine'. Together they form a unique fingerprint.

Cite this