Approximation quality for sorting rules.

DOI10.1016/S0167-9473(02)00065-8zbMath1180.62005MaRDI QIDQ1614836

Günther Gediga, Ivo Duentsch

Publication date: 9 September 2002

Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)

zbMATH Keywords

Decision support systemsApproximation qualityOrdinal predictionSorting rules

Mathematics Subject Classification ID

Related Items

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

Cites Work

• Rough approximation quality revisited
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item