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

DOI10.1007/s10479-008-0326-1zbMath1192.60050WikidataQ60257793 ScholiaQ60257793MaRDI QIDQ2271869

Bernard De Baets, Stijn Lievens, K. Cao-Van

Publication date: 4 August 2009

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-008-0326-1

zbMATH Keywords

classification problem; monotone classification; supervised ranking

Mathematics Subject Classification ID

62H30: Classification and discrimination; cluster analysis (statistical aspects)

60E15: Inequalities; stochastic orderings

91B06: Decision theory

Related Items

Aggregation of monotone reciprocal relations with application to group decision making, Learning partial ordinal class memberships with kernel-based proportional odds models, Supervised ranking in the WEKA environment, Monotone Mamdani-Assilian models under mean of maxima defuzzification, On the random generation and counting of weak order extensions of a poset with given class cardinalities, On the random generation of monotone data sets, Kernel-based learning methods for preference aggregation, Linguistic-based voting through centered OWA operators, Optimal monotone relabelling of partially non-monotone ordinal data

Cites Work

• Sorting multi-attribute alternatives: the TOMASO method
• Interval graphs and interval orders
• Stochastic dominance and prospect dominance with subjective weighting functions
• Approximation quality for sorting rules.
• Rough approximation by dominance relations
• Dual Stochastic Dominance and Related Mean-Risk Models
• Transactions on Rough Sets II
• Theory and Applications of Relational Structures as Knowledge Instruments
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item