A Fast Algorithm for Learning a Ranking Function from Large-Scale Data Sets

We consider the problem of learning a ranking function that maximizes a generalization of the Wilcoxon-Mann-Whitney statistic on the training data. Relying on an -accurate approximation for the error function, we reduce the computational complexity of each iteration of a conjugate gradient algorithm for learning ranking functions from O

• Type: Journal
• Year: 2008
• Where: PAMI
• Authors: Vikas C. Raykar, Ramani Duraiswami, Balaji Krishnapuram
• Keywords: PAMI 2008, Ranking, Ranking Function, Training Data