Non-smoothness in classification problems

  • Authors:
  • A. Astorino;A. Fuduli;E. Gorgone

  • Affiliations:
  • Istituto di Calcolo e Reti ad Alte Prestazioni C.N.R., c/o Dipartimento di Elettronica Informatica e Sistemistica, Universita della Calabria, Rende (CS), Italy;Dipartimento di Matematica, Universita della Calabria, Rende (CS), Italy;Dipartimento di Elettronica Informatica e Sistemistica, Universita della Calabria, Rende (CS), Italy

  • Venue:
  • Optimization Methods & Software - THE JOINT EUROPT-OMS CONFERENCE ON OPTIMIZATION, 4-7 JULY, 2007, PRAGUE, CZECH REPUBLIC, PART I
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

We review the role played by non-smooth optimization techniques in many recent applications in classification area. Starting from the classical concept of linear separability in binary classification, we recall the more general concepts of polyhedral, ellipsoidal and max-min separability. Finally we focus our attention on the support vector machine (SVM) approach and on the more recent transductive SVM technique.