Two Classes of New Push Ranking Algorithms
Liang Li · Computer Engineering and Science · 2011
The goal of a ranking learning algorithm is to obtain the best ranking function,which assigns each instance a score,and ranks instances according to their scores.The framework of a push ranking algorithm allows a certain range of ranking errors in the learning procedure.Let e be the range of the errors,by using the symmetric e-insensitive exponential loss function and the symmetric e-insensitive logistic loss function to substitute the original loss function,two new classes of push ranking learning algorithms can be obtained.The experimental results show that the proposed new algorithms are effective.