Ordinal regression

From Wikipedia, the free encyclopedia
Jump to: navigation, search

In statistics, ordinal regression (also called "ordinal classification") is a type of regression analysis used for predicting an ordinal variable, i.e. a variable whose value exists on an arbitrary scale where only the relative ordering between different values is significant. It can be considered an intermediate problem between regression and classification.[1] Examples of ordinal regression are ordered logit and ordered probit. Ordinal regression turns up often in the social sciences, for example in the modeling of human levels of preference (on a scale from, say, 1–5 for "very poor" through "excellent"), as well as in information retrieval. In machine learning, ordinal regression may also be called ranking learning.[2][a]

Linear models for ordinal regression[edit]

Ordinal regression can be performed using a generalized linear model (GLM) that fits both a coefficient vector and a set of thresholds to a dataset. Suppose one has a set of observations, represented by length-p vectors x1 through xn, with associated responses y1 through yn, where each yi is an ordinal variable on a scale 1, ..., K. To this data, one fits a length-p coefficient vector w and a set of thresholds θ1, ..., θK−1 with the property that θ1 < θ2 < ... < θK−1. This set of thresholds divides the real number line into K disjoint segments, corresponding to the K response levels.

The model can now be formulated as

or, the cumulative probability of the response y being at most i is given by a function σ (the inverse link function) applied to a linear function of x. Several choices exist for σ; the logistic function

gives the ordered logit model, while using the probit function gives the ordered probit model. A third option is to use an exponential function

which gives the proportional hazards model.[3]

Latent variable model[edit]

The probit version of the above model can be justified by assuming the existence of a real-valued latent variable (unobserved quantity) y*, determined by[4]

where ε is normally distributed with zero mean and unit variance, conditioned on x. The response variable y results from an "incomplete measurement" of y*, where one only determines the interval into which y* falls:

Defining θ0 = -∞ and θK = ∞, the above can be summarized as y = k if and only if θk−1 < y* ≤ θk.

From these assumptions, one can derive the conditional distribution of y as[4]

where Φ is the cumulative distribution function of the standard normal distribution, and takes on the role of the inverse link function σ. The log-likelihood of the model for a single training example xi, yi can now be stated as[4]

(using the Iverson bracket [yi = k].) The log-likelihood of the ordered logit model is analogous, using the logistic function instead of Φ.[5]

Alternative models[edit]

In machine learning, alternatives to the latent-variable models of ordinal regression have been proposed. An early result was PRank, a variant of the perceptron algorithm that found multiple parallel hyperplanes separating the various ranks; its output is a weight vector w and a sorted vector of K−1 thresholds θ, as in the ordered logit/probit models. The prediction rule for this model is to output the smallest rank k such that wx < θk.[6]

Other methods rely on the principle of large-margin learning that also underlies support vector machines.[7][8]

Another approach is given by Rennie and Srebro, who, realizing that "even just evaluating the likelihood of a predictor is not straight-forward" in the ordered logit and ordered probit models, propose fitting ordinal regression models by adapting common loss functions from classification (such as the hinge loss and log loss) to the ordinal case.[9]

Notes[edit]

  1. ^ Not to be confused with learning to rank.

References[edit]

  1. ^ Winship, Christopher; Mare, Robert D. (1984). "Regression Models with Ordinal Variables" (PDF). American Sociological Review. 49: 512–525. doi:10.2307/2095465. 
  2. ^ Shashua, Amnon; Levin, Anat (2002). Ranking with large margin principle: Two approaches. NIPS. 
  3. ^ McCullagh, Peter (1980). "Regression models for ordinal data". Journal of the Royal Statistical Society. Series B (Methodological). 42 (2): 109–142. 
  4. ^ a b c Wooldridge, Jeffrey M. (2010). Econometric Analysis of Cross Section and Panel Data. MIT Press. pp. 655–657. ISBN 9780262232586. 
  5. ^ Agresti, Alan (23 October 2010). "Modeling Ordinal Categorical Data" (PDF). Retrieved 23 July 2015. 
  6. ^ Crammer, Koby; Singer, Yoram (2001). Pranking with ranking. NIPS. 
  7. ^ Chu, Wei; Keerthi, S. Sathiya (2007). "Support vector ordinal regression". Neural Computation. 19: 792–815. CiteSeerX 10.1.1.297.3637Freely accessible. doi:10.1162/neco.2007.19.3.792. 
  8. ^ Herbrich, Ralf; Graepel, Thore; Obermayer, Klaus (2000). "Large Margin Rank Boundaries for Ordinal Regression". Advances in Large Margin Classifiers. MIT Press. pp. 115–132. 
  9. ^ Rennie, Jason D. M.; Srebro, Nathan (2005). Loss Functions for Preference Levels: Regression with Discrete Ordered Labels (PDF). Proc. IJCAI Multidisciplinary Workshop on Advances in Preference Handling. 

Further reading[edit]