Boosting the Area Under the ROC Curve
Abstract
We show that any weak ranker that can achieve an area under the ROC curve slightly better than 1/2 (which can be achieved by random guessing) can be effi- ciently boosted to achieve an area under the ROC curve arbitrarily close to 1. We further show that this boosting can be performed even in the presence of indepen- dent misclassification noise, given access to a noise-tolerant weak ranker.
Cite
Text
Long and Servedio. "Boosting the Area Under the ROC Curve." Neural Information Processing Systems, 2007.Markdown
[Long and Servedio. "Boosting the Area Under the ROC Curve." Neural Information Processing Systems, 2007.](https://mlanthology.org/neurips/2007/long2007neurips-boosting/)BibTeX
@inproceedings{long2007neurips-boosting,
title = {{Boosting the Area Under the ROC Curve}},
author = {Long, Phil and Servedio, Rocco},
booktitle = {Neural Information Processing Systems},
year = {2007},
pages = {945-952},
url = {https://mlanthology.org/neurips/2007/long2007neurips-boosting/}
}