Large margin rank boundaries for ordinal regression
Citations
4,453 citations
2,813 citations
Cites background or methods from "Large margin rank boundaries for or..."
...Our approach follows (Herbrich et al., 2000) in that we train on pairs of examples to learn a ranking function...
[...]
...Although the linear version is an online algorithm2, PRank has been compared to batch ranking algorithms, and a quadratic kernel version was found to outperform all such algorithms described in (Herbrich et al., 2000)....
[...]
...Although the linear version is an online algorithm(2), PRank has been compared to batch ranking algorithms, and a quadratic kernel version was found to outperform all such algorithms described in (Herbrich et al., 2000)....
[...]
...(Herbrich et al., 2000) cast the problem of learning to rank as ordinal regression, that is, learning the mapping of an input vector to a member of an ordered set of numerical ranks....
[...]
...However (Herbrich et al., 2000) cast the ranking problem as an ordinal regression problem; rank boundaries play a critical role during training, as they do for several other algorithms (Crammer & Singer, 2002; Harrington, 2003)....
[...]
2,544 citations
2,515 citations
2,292 citations