AdaCost: Misclassification Cost-Sensitive Boosting
Abstract
AdaCost, a variant of AdaBoost, is a misclassification cost-sensitive boosting method. It uses the cost of misclassifications to update the training distribution on successive boosting rounds. The purpose is to reduce the cumulative misclassification cost more than AdaBoost. We formally show that AdaCost reduces the upper bound of cumulative misclassification cost of the training set. Empirical evaluations have shown significant reduction in the cumulative misclassification cost over AdaBoost without consuming additional computing power. 1 Introduction Recently, there has been considerable interest in costsensitive learning [15, 8, 7, 17, 6, 2]. Turney [15, 16] discusses learning tasks sensitive to the costs of misclassification among others. We are interested in reducing misclassification cost. It can be either constant for each type of misclassification or conditional on a specific example under di#erent types of misclassification. In troubleshooting systems, for examp...
Cite
Text
Fan et al. "AdaCost: Misclassification Cost-Sensitive Boosting." International Conference on Machine Learning, 1999.Markdown
[Fan et al. "AdaCost: Misclassification Cost-Sensitive Boosting." International Conference on Machine Learning, 1999.](https://mlanthology.org/icml/1999/fan1999icml-adacost/)BibTeX
@inproceedings{fan1999icml-adacost,
title = {{AdaCost: Misclassification Cost-Sensitive Boosting}},
author = {Fan, Wei and Stolfo, Salvatore J. and Zhang, Junxin and Chan, Philip K.},
booktitle = {International Conference on Machine Learning},
year = {1999},
pages = {97-105},
url = {https://mlanthology.org/icml/1999/fan1999icml-adacost/}
}