On the Definition and Representation of a Ranking

Authors:
Kim Cao-Van;Bernard De Baets
Affiliations:
-;-
Venue:
ReIMICS '01 Revised Papers from the 6th International Conference and 1st Workshop of COST Action 274 TARSKI on Relational Methods in Computer Science
Year:
2001

Citing 1
Cited 5

Decision trees for ordinal classification

Intelligent Data Analysis

From supervised ranking to evolving behaviours of a robotic team

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Comparison of classification accuracy using Cohen's Weighted Kappa

Expert Systems with Applications: An International Journal
On the random generation of monotone data sets

Information Processing Letters
Loss optimal monotone relabeling of noisy multi-criteria data sets

Information Sciences: an International Journal
Optimal restoration of stochastic monotonicity with respect to cumulative label frequency loss functions

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we discuss how a proper definition of a ranking can be introduced in the framework of supervised learning. We elaborate on its practical representation, and show how we can deal in a sound way with reversed preferences by transforming them into uncertainties within the representation.