We propose in this work a nested version of the well–known Sequential Minimal Optimization (SMO) algorithm, able to contemplate working sets of larger cardinality for solving Support Vector Machine (SVM) learning problems. Contrary to several other proposals in liter- ature, neither new procedures nor numerical QP optimizations must be implemented, since our proposal exploits the conventional SMO method in its core. Preliminary tests on benchmarking datasets allow to demon- strate the effectiveness of the presented method.

Nested Sequential Minimal Optimization for Support Vector Machine

L. Oneto;
2012

Abstract

We propose in this work a nested version of the well–known Sequential Minimal Optimization (SMO) algorithm, able to contemplate working sets of larger cardinality for solving Support Vector Machine (SVM) learning problems. Contrary to several other proposals in liter- ature, neither new procedures nor numerical QP optimizations must be implemented, since our proposal exploits the conventional SMO method in its core. Preliminary tests on benchmarking datasets allow to demon- strate the effectiveness of the presented method.
9783642332654
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11568/962583
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 3
  • ???jsp.display-item.citation.isi??? ND
social impact