Risk minimization, probability elicitation, and cost-sensitive SVMs

A new procedure for learning cost-sensitive SVM classifiers is proposed. The SVM hinge loss is extended to the cost sensitive setting, and the cost-sensitive SVM is derived as the minimizer of the associated risk. The extension of the hinge loss draws on recent connections between risk minimization and probability elicitation. These connections are generalized to costsensitive classification, in a manner that guarantees consistency with the cost-sensitive Bayes risk, and associated Bayes decision rule. This ensures that optimal decision rules, under the new hinge loss, implement the Bayes-optimal costsensitive classification boundary. Minimization of the new hinge loss is shown to be a generalization of the classic SVM optimization problem, and can be solved by identical procedures. The resulting algorithm avoids the shortcomings of previous approaches to cost-sensitive SVM design, and has superior experimental performance.

• Type: Conference
• Year: 2010
• Where: ICML
• Authors: Hamed Masnadi-Shirazi, Nuno Vasconcelos
• Keywords: Cost-sensitive Svm, Cost-sensitive Svm Classifiers, Hinge Loss, ICML 2010, Machine Learning