.png){kind=icon}
返回
Robust reductions from ranking to classification
.png){kind=icon}
OA
AI
DOI：10.1007/s10994-008-5058-6.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We reduce ranking, as measured by the Area Under the Receiver Operating Characteristic Curve (AUC), to binary classification. The core theorem shows that a binary classification regret of r on the induced binary problem implies an AUC regret of at most 2r. This is a large improvement over approaches such as ordering according to regressed scores, which have a regret transform of r bar right arrow nr where n is the number of elements.
Keyword:
Ranking
Classification
Reductions
期刊
IF:
2.9
论文数:
2.7K
被引数:
3.4W
查看更多机构
.png){kind=icon}
