Skip to content

Support Vector Learning for Ordinal Regression

by Ralf Herbrich, Thore Graepel, Klaus Obermayer
Science ()
Get full text at journal

Abstract

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.

Cite this document (BETA)

Authors on Mendeley

Readership Statistics

96 Readers on Mendeley
by Discipline
 
73% Computer Science
 
18% Engineering
 
4% Agricultural and Biological Sciences
by Academic Status
 
47% Student > Ph. D. Student
 
18% Student > Master
 
10% Researcher
by Country
 
6% Germany
 
5% United States
 
2% China

Sign up today - FREE

Mendeley saves you time finding and organizing research. Learn more

  • All your research in one place
  • Add and import papers easily
  • Access it anywhere, anytime

Start using Mendeley in seconds!

Sign up & Download

Already have an account? Sign in