Advanced search
1 file | 611.74 KB

A probabilistic framework for the design of instance-based supervised ranking algorithms in an ordinal setting

(2008) Annals of Operations Research. 163(1). p.115-142
Author
Organization
Abstract
In this article, we present a probabilistic framework which serves as the base from which instance-based algorithms for solving the supervised ranking problem may be derived. This framework constitutes a simple and novel approach to the supervised ranking problem, and we give a number of typical examples of how this derivation can be achieved. In this general framework, we pursue a cumulative and stochastic approach, relying heavily upon the concept of stochastic dominance. We show how the median can be used to extract, in a consistent way, a single (classification) label from a returned cumulative probability distribution function. We emphasize that all operations used are mathematically sound, i.e. they only make use of ordinal properties. Mostly, when confronted with the problem of learning a ranking, the training data is not monotone in itself, and some cleansing operation is performed on it to remove these 'inconsistent' examples. Our framework, however, deals with these occurrences of 'reversed preference' in a non-invasive way. On the contrary, it even allows to incorporate information gained from the occurrence of these reversed preferences. This is exactly what happens in the second realization of the main theorem.
Keywords
supervised ranking, instance-based learning, monotone classification, stochastic dominance

Downloads

  • (...).pdf
    • full text
    • |
    • UGent only
    • |
    • PDF
    • |
    • 611.74 KB

Citation

Please use this url to cite or link to this publication:

Chicago
Lievens, Stijn, Bernard De Baets, and Kim Cao-Van. 2008. “A Probabilistic Framework for the Design of Instance-based Supervised Ranking Algorithms in an Ordinal Setting.” Annals of Operations Research 163 (1): 115–142.
APA
Lievens, S., De Baets, B., & Cao-Van, K. (2008). A probabilistic framework for the design of instance-based supervised ranking algorithms in an ordinal setting. Annals of Operations Research, 163(1), 115–142.
Vancouver
1.
Lievens S, De Baets B, Cao-Van K. A probabilistic framework for the design of instance-based supervised ranking algorithms in an ordinal setting. Annals of Operations Research. 2008;163(1):115–42.
MLA
Lievens, Stijn, Bernard De Baets, and Kim Cao-Van. “A Probabilistic Framework for the Design of Instance-based Supervised Ranking Algorithms in an Ordinal Setting.” Annals of Operations Research 163.1 (2008): 115–142. Print.
@article{692740,
  abstract     = {In this article, we present a probabilistic framework which serves as the base from which instance-based algorithms for solving the supervised ranking problem may be derived. This framework constitutes a simple and novel approach to the supervised ranking problem, and we give a number of typical examples of how this derivation can be achieved.
In this general framework, we pursue a cumulative and stochastic approach, relying heavily upon the concept of stochastic dominance. We show how the median can be used to extract, in a consistent way, a single (classification) label from a returned cumulative probability distribution function. We emphasize that all operations used are mathematically sound, i.e. they only make use of ordinal properties.

Mostly, when confronted with the problem of learning a ranking, the training data is not monotone in itself, and some cleansing operation is performed on it to remove these 'inconsistent' examples. Our framework, however, deals with these occurrences of 'reversed preference' in a non-invasive way. On the contrary, it even allows to incorporate information gained from the occurrence of these reversed preferences. This is exactly what happens in the second realization of the main theorem.},
  author       = {Lievens, Stijn and De Baets, Bernard and Cao-Van, Kim},
  issn         = {0254-5330},
  journal      = {Annals of Operations Research},
  language     = {eng},
  number       = {1},
  pages        = {115--142},
  title        = {A probabilistic framework for the design of instance-based supervised ranking algorithms in an ordinal setting},
  url          = {http://dx.doi.org/10.1007/s10479-008-0326-1},
  volume       = {163},
  year         = {2008},
}

Altmetric
View in Altmetric
Web of Science
Times cited: