Large-scale linear rankSVM.
Linear rankSVM is one of the widely used methods for learning to rank. Although its performance may be inferior to nonlinear methods such as kernel rankSVM and gradient boosting decision trees, linear rankSVM is useful to quickly produce a baseline model. Furthermore, following its recent development for classification, linear rankSVM may give competitive performance for large and sparse data. A great deal of works have studied linear rankSVM. The focus is on the computational efficiency when the number of preference pairs is large. In this letter, we systematically study existing works, discuss their advantages and disadvantages, and propose an efficient algorithm. We discuss different implementation issues and extensions with detailed experiments. Finally, we develop a robust linear rankSVM tool for public use.
Department of Computer Science, National Taiwan University, Taipei 10617, Taiwan r00922098@csie.ntu.edu.tw.
Ching-Pei
CP
Lee
Chih-Jen
CJ
Lin
D000465:Algorithms; D001185:Artificial Intelligence; D003663:Decision Trees; D006801:Humans; D007858:Learning; D016014:Linear Models; D008962:Models, Theoretical