Abstract
In this paper we show that several Support Vector methods, including one-class SVM and a number of non-standard SVM classification techniques, can be viewed as special implementations of a general regularization network. Formally, the connection is obtained by choosing the appropriate loss function and parametrized by the exponent of the offset in the penalty term. The mathematical properties of the underlying algorithms can then be more conveniently studied within the theoretical framework of regularization networks.
| Original language | English |
|---|---|
| Title of host publication | ESANN 2005 Proceedings - 13th European Symposium on Artificial Neural Networks |
| Pages | 595-600 |
| Publication status | Published - 2007 |
| Externally published | Yes |
| Event | 13th European Symposium on Artificial Neural Networks, ESANN 2005 - Bruges, Belgium Duration: 27 Apr 2005 → 29 Apr 2005 |
Conference
| Conference | 13th European Symposium on Artificial Neural Networks, ESANN 2005 |
|---|---|
| Place | Belgium |
| City | Bruges |
| Period | 27/04/05 → 29/04/05 |
Fingerprint
Dive into the research topics of 'Support vectors algorithms as regularization networks'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver