Generalization Bounds for Some Ordinal Regression Algorithms

DOI10.1007/978-3-540-87987-9_6zbMATH Open1156.68514OpenAlexW1529734227MaRDI QIDQ3529907FDOQ3529907

Authors: 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

Recommendations

• Generalization bounds for ranking algorithms via algorithmic stability
• On ranking and generalization bounds
• Large-Margin Thresholded Ensembles for Ordinal Regression: Theory and Practice
• On the consistency of ordinal regression methods
• Support Vector Ordinal Regression

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Support Vector Ordinal Regression
• 10.1162/153244302760200704
• Statistical behavior and consistency of classification methods based on convex risk minimization.
• Convexity, Classification, and Risk Bounds
• Gaussian processes for ordinal regression
• 10.1162/153244302760200713
• Neural Network Learning
• Title not available (Why is that?)
• Title not available (Why is that?)
• Learning Theory
• Title not available (Why is that?)
• Online Ranking by Projecting

Cited In (7)

• Large-Margin Thresholded Ensembles for Ordinal Regression: Theory and Practice
• A survey on ROC-based ordinal regression
• V-shaped interval insensitive loss for ordinal classification
• The statistical learning element of support vector ordinal regression machines
• Ranking data with ordinal labels: optimality and pairwise aggregation
• Reduction from cost-sensitive ordinal ranking to weighted binary classification
• On the consistency of ordinal regression methods

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3529907)