期刊
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS
卷 95, 期 8, 页码 1527-1547出版社
TAYLOR & FRANCIS LTD
DOI: 10.1080/00207160.2017.1322688
关键词
Statistical learning theory; k-partite ranking; AUC criterion; shatter coefficient; margin
资金
- National Natural Science Foundation of China [11401519]
The k-partite ranking, as an extension of bipartite ranking, is widely used in information retrieval and other computer applications. Such implement aims to obtain an optimal ranking function which assigns a score to each instance. The AUC (Area Under the ROC Curve) measure is a criterion which can be used to judge the superiority of the given k-partite ranking function. In this paper, we study the k-partite ranking algorithm in AUC criterion from a theoretical perspective. The generalization bounds for the k-partite ranking algorithm are presented, and the deviation bounds for a ranking function chosen from a finite function class are also considered. The uniform convergence bound is expressed in terms of a new set of combinatorial parameters which we define specially for the k-partite ranking setting. Finally, the generally margin-based bound for k-partite ranking algorithm is derived.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据