Generalization Bounds for Some Ordinal Regression Algorithms
From MaRDI portal
Publication:3529907
Recommendations
Cites work
- scientific article; zbMATH DE number 5957468 (Why is no real title available?)
- scientific article; zbMATH DE number 47310 (Why is no real title available?)
- scientific article; zbMATH DE number 1304929 (Why is no real title available?)
- scientific article; zbMATH DE number 1881086 (Why is no real title available?)
- 10.1162/153244302760200704
- 10.1162/153244302760200713
- Convexity, Classification, and Risk Bounds
- Gaussian processes for ordinal regression
- Learning Theory
- Neural Network Learning
- Online Ranking by Projecting
- Statistical behavior and consistency of classification methods based on convex risk minimization.
- Support Vector Ordinal Regression
Cited in
(7)- Large-Margin Thresholded Ensembles for Ordinal Regression: Theory and Practice
- On the consistency of ordinal regression methods
- Reduction from cost-sensitive ordinal ranking to weighted binary classification
- Ranking data with ordinal labels: optimality and pairwise aggregation
- 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
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)