论文部分内容阅读
We study the ranking problem in the context of the regularization theory that allows a simultaneous analysis of a wide class of algorithms.Our analysis gives a better convergence rate compared to the reported in the literature.