Generalization Bounds for Some Ordinal Regression Algorithms

DOI10.1007/978-3-540-87987-9_6zbMath1156.68514OpenAlexW1529734227MaRDI QIDQ3529907

Shivani Agarwal

Publication date: 14 October 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87987-9_6

Mathematics Subject Classification ID

Linear inference, regression (62J99) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (2)

Reduction from Cost-Sensitive Ordinal Ranking to Weighted Binary Classification ⋮ Ranking data with ordinal labels: optimality and pairwise aggregation

Cites Work

• Support Vector Ordinal Regression
• Statistical behavior and consistency of classification methods based on convex risk minimization.
• 10.1162/153244302760200704
• 10.1162/153244302760200713
• Neural Network Learning
• Learning Theory
• Online Ranking by Projecting
• Convexity, Classification, and Risk Bounds
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Generalization Bounds for Some Ordinal Regression Algorithms