.png){kind=icon}
返回
Ranking data with ordinal labels: optimality and pairwise aggregation
.png){kind=icon}
OA
AI
DOI：10.1007/s10994-012-5325-4.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The paper describes key insights in order to grasp the nature of K-partite ranking. From the theoretical side, the various characterizations of optimal elements are fully described, as well as the likelihood ratio monotonicity condition on the underlying distribution which guarantees that such elements do exist. Then, a pairwise aggregation procedure based on Kendall tau is introduced to relate learning rules dedicated to bipartite ranking and solutions of the K-partite ranking problem. Criteria reflecting ranking performance under these conditions such as the ROC surface and its natural summary, the volume under the ROC surface (VUS), are then considered as targets for empirical optimization. The consistency of pairwise aggregation strategies are studied under these criteria and shown to be efficient under reasonable assumptions. Eventually, numerical results illustrate the relevance of the methodology proposed.
Keyword:
K-partite ranking
Ordinal data
ROC surface
Volume under the ROC surface
Empirical risk minimization
Median ranking
期刊
IF:
2.9
论文数:
2.7K
被引数:
3.4W
机构
引用论文
A simple generalisation of the area under the ROC curve for multiple class classification problems多类分类问题的ROC曲线下面积的简单概括.png)
MACHINE LEARNING
OAAI
MACHINE LEARNINGIF2.9
OAAI分享收藏分享收藏
查看更多内容