Skip to content
Journal article

Support Vector Learning for Ordinal Regression

Herbrich R, Graepel T, Obermayer K ...see all

Science, vol. 1 (1999) pp. 97-102

  • 105


    Mendeley users who have this article in their library.
  • 176


    Citations of this article.
  • N/A


    ScienceDirect users who have downloaded this article.
Sign in to save reference


We investigate the problem of predicting variables of ordinal scale. This task is referred to as ordinal regression and is complementary to the standard machine learning tasks of classification and metric regression. In contrast to statistical models we present a distribution independent formulation of the problem together with uniform bounds of the risk functional. The approach presented is based on a mapping from objects to scalar utility values. Similar to Support Vector methods we derive a new learning algorithm for the task of ordinal regression based on large margin rank boundaries. We give experimental results for an information retrieval task: learning the order of documents w.r.t. an initial query. Experimental results indicate that the presented algorithm outperforms more naive approaches to ordinal regression such as Support Vector classification and Support Vector regression in the case of more than two ranks.

Find this document

Get full text


  • Ralf Herbrich

  • Thore Graepel

  • Klaus Obermayer

Cite this document

Choose a citation style from the tabs below