Learning ordinal data
From MaRDI portal
Publication:6604471
DOI10.1002/WICS.1357zbMATH Open1545.6212MaRDI QIDQ6604471FDOQ6604471
Publication date: 12 September 2024
Published in: Wiley Interdisciplinary Reviews. WIREs Computational Statistics (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Support-vector networks
- Nearest neighbor pattern classification
- A note on margin-based loss functions in classification
- Statistical behavior and consistency of classification methods based on convex risk minimization.
- Weighted Distance Weighted Discrimination and Its Asymptotic Properties
- Geometric Representation of High Dimension, Low Sample Size Data
- Convexity, Classification, and Risk Bounds
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Probability estimation for large-margin classifiers
- Robust Model-Free Multiclass Probability Estimation
- On the learnability and design of output codes for multiclass problems
- Is an ordinal class structure useful in classifier learning?
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Elements of Statistical Learning
- On surrogate loss functions and \(f\)-divergences
- Title not available (Why is that?)
- Classification methods with reject option based on convex risk minimization
- Adaptive Weighted Learning for Unbalanced Multicategory Classification
- On the Effect and Remedies of Shrinkage on Classification Probability Estimation
This page was built for publication: Learning ordinal data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6604471)
