Robust multiclass kernel-based classifiers

Budi Santosa, Theodore B. Trafalis*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

Abstract

In this research, a robust optimization approach applied to multiclass support vector machines (SVMs) is investigated. Two new kernel based-methods are developed to address data with input uncertainty where each data point is inside a sphere of uncertainty. The models are called robust SVM and robust feasibility approach model (Robust-FA) respectively. The two models are compared in terms of robustness and generalization error. The models are compared to robust Minimax Probability Machine (MPM) in terms of generalization behavior for several data sets. It is shown that the Robust-SVM performs better than robust MPM.

Original languageEnglish
Pages (from-to)261-279
Number of pages19
JournalComputational Optimization and Applications
Volume38
Issue number2
DOIs
Publication statusPublished - Nov 2007

Keywords

  • Feasibility approach
  • Generalization error
  • Kernel
  • Minimax probability machine
  • Multiclass
  • Robust
  • Support vector machine
  • Uncertainty

Fingerprint

Dive into the research topics of 'Robust multiclass kernel-based classifiers'. Together they form a unique fingerprint.

Cite this