Cost-Sensitive Multi-Class Classification from Probability Estimates

Abstract

For two-class classification, it is common to classify by setting a threshold on class probability estimates, where the threshold is determined by ROC curve analysis. An analog for multi-class classification is learning a new class partitioning of the multiclass probability simplex to minimize empirical misclassification costs. We analyze the interplay between systematic errors in the class probability estimates and cost matrices for multi-class classification. We explore the effect on the class partitioning of five different transformations of the cost matrix. Experiments on benchmark datasets with naive Bayes and quadratic discriminant analysis show the effectiveness of learning a new partition matrix compared to previously proposed methods.

Cite

Text

O'Brien et al. "Cost-Sensitive Multi-Class Classification from Probability Estimates." International Conference on Machine Learning, 2008. doi:10.1145/1390156.1390246

Markdown

[O'Brien et al. "Cost-Sensitive Multi-Class Classification from Probability Estimates." International Conference on Machine Learning, 2008.](https://mlanthology.org/icml/2008/oaposbrien2008icml-cost/) doi:10.1145/1390156.1390246

BibTeX

@inproceedings{oaposbrien2008icml-cost,
  title     = {{Cost-Sensitive Multi-Class Classification from Probability Estimates}},
  author    = {O'Brien, Deirdre B. and Gupta, Maya R. and Gray, Robert M.},
  booktitle = {International Conference on Machine Learning},
  year      = {2008},
  pages     = {712-719},
  doi       = {10.1145/1390156.1390246},
  url       = {https://mlanthology.org/icml/2008/oaposbrien2008icml-cost/}
}