• Computer Science
  • Published 2004

Comparison of Ranking Procedures in Pairwise Preference Learning

@inproceedings{Hllermeier2004ComparisonOR,
  title={Comparison of Ranking Procedures in Pairwise Preference Learning},
  author={Eyke H{\"u}llermeier and Johannes F{\"u}rnkranz},
  year={2004}
}
Computational methods for discovering the preferences of individuals are useful in many applications. In this paper, we propose a method for learning valued preference structures, using a natural extension of so-called pairwise classification. A valued preference structure can then be used in order to induce a ranking, that is a linear ordering of a given set of alternatives. This step is realized by means of a so-called ranking procedure. In the second part of the paper, we compare the… CONTINUE READING

Figures, Tables, and Topics from this paper.

Explore Further: Topics Discussed in This Paper

Citations

Publications citing this paper.
SHOWING 1-10 OF 22 CITATIONS

Ranking procedures by pairwise comparison using random sets and the imprecise Dirichlet model

  • Applied Mathematics and Computation
  • 2006
VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

The fairness of ranking procedure in pair-wise preference learning

  • 2005 International Conference on Natural Language Processing and Knowledge Engineering
  • 2005
VIEW 8 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Instance ranking using partially ordered sets of expert estimations

M. MedvednikovaM., V. StrijovV.
  • 2013
VIEW 1 EXCERPT
CITES BACKGROUND

References

Publications referenced by this paper.