An Improved Training Algorithm for the Linear Ranking Support Vector Machine



: Airola A, Pahikkala T, Salakoski T

: 2011

: Lecture Notes in Computer Science

: ARTIFICIAL NEURAL NETWORKS AND MACHINE LEARNING - ICANN 2011, PT I

: LECT NOTES COMPUT SC

: 6791

: 134

: 141

: 8

: 978-3-642-21734-0

: 0302-9743


We introduce an O(ms + m log(m)) time complexity method for training the linear ranking support vector machine, where in is the number of training examples, and s the average number of non-zero features per example. The method generalizes the fastest previously known approach, which achieves the same efficiency only in restricted special cases. The excellent scalability of the proposed method is demonstrated experimentally.



Last updated on 2024-26-11 at 23:39