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

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

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

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 problemmonotone classificationsupervised ranking

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Inequalities; stochastic orderings (60E15) Decision theory (91B06)

Related Items (16)

Optimal monotone relabelling of partially non-monotone ordinal data ⋮ Representations of votes facilitating monotonicity-based ranking rules: from votrix to votex ⋮ 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 ⋮ Monotonicity as a tool for differentiating between truth and optimality in the aggregation of rankings ⋮ An ordered feature recognition method based on ranking separability ⋮ Supervised ranking in the WEKA environment ⋮ On the median in imprecise ordinal problems ⋮ Aggregation of monotone reciprocal relations with application to group decision making ⋮ Learning partial ordinal class memberships with kernel-based proportional odds models ⋮ Computing Version Spaces in the Qualitative Approach to Multicriteria Decision Aid ⋮ On the random generation of monotone data sets ⋮ Linguistic-based voting through centered OWA operators ⋮ Learning rule sets and Sugeno integrals for monotonic classification problems ⋮ Kernel-based learning methods for preference aggregation ⋮ Partially monotonic decision trees

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

This page was built for publication: A probabilistic framework for the design of instance-based supervised ranking algorithms in an ordinal setting