Optimizing the Classification Cost using SVMs with a Double Hinge Loss

Abstract

The objective of this study is to minimize the classification cost using Support Vector Machines (SVMs) Classifier with a double hinge loss. Such binary classifiers have the option to reject observations when the cost of rejection is lower than that of misclassification. To train this classifier, the standard SVM optimization problem was modified by minimizing a double hinge loss function considered as a surrogate convex loss function. The impact of such classifier is illustrated on several discussed results obtained with artificial data and medical data.

Authors

  • Amirou Ahmed
  • Ould-Abdeslam Djaffar
  • Zidelmal Zahia
  • Aidene Mohamed
  • Merckle Jean

Downloads

How to Cite

Ahmed, A., Djaffar, O.-A., Zahia, Z., Mohamed, A., & Jean, M. (2014). Optimizing the Classification Cost using SVMs with a Double Hinge Loss. Informatica, 38(3). Retrieved from https://www.informatica.si/index.php/informatica/article/view/692

Issue

Vol. 38 No. 3 (2014)

Section

Regular papers

License

Authors retain copyright in their work. By submitting to and publishing with Informatica, authors grant the publisher (Slovene Society Informatika) the non-exclusive right to publish, reproduce, and distribute the article and to identify itself as the original publisher.

All articles are published under the Creative Commons Attribution license CC BY 3.0. Under this license, others may share and adapt the work for any purpose, provided appropriate credit is given and changes (if any) are indicated.

Authors may deposit and share the submitted version, accepted manuscript, and published version, provided the original publication in Informatica is properly cited.