Timezone: »

Boosting the Area under the ROC Curve
Phil Long · Rocco A Servedio

Mon Dec 03 08:10 PM -- 08:25 PM (PST) @
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 efficiently 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 independent misclassification noise, given access to a noise-tolerant weak ranker.

Author Information

Phil Long (NEC Labs)
Rocco A Servedio (Columbia University)

Related Events (a corresponding poster, oral, or spotlight)

More from the Same Authors