Stability Analysis for k-partite Ranking Algorithms
Gao Yun · Journal of Yunnan Normal University · 2011
Study the stability of k-partite ranking algorithms focus on deleting an element from the sample set.If A uniform score stability ranking algorithm use lγ as a loss function,then it has uniform loss stability;also,if for any x,K(x,x) has a limited upper bound,then the ranking algorithm by minimizing the regularization empirical l-error has good uniform score stability.