扩展AUC模型下排序函数迭代计算的几个注记

Some notes on ranking function ierative calculation under the framework of extended AUC

通过分段常数k-部排序函数得到最优k-部排序函数是一种计算扩展AUC框架下排序函数的新迭代算法。笔者从理论的角度对该算法进行分析,得到算法的若干统计特征。

In this paper, we have discussed a new iterative algorithm to calculate ranking functions under the framework of extended AUC, i.e. obtaining the optimal k-partite ranking function in terms of piecewise constant k-partite ranking function. We have deduced several statistical characteristics.