Ordinal regression with explainable distance metric learning based on ordered sequences
From MaRDI portal
Publication:2071504
DOI10.1007/s10994-021-06010-wOpenAlexW3178526909MaRDI QIDQ2071504
Juan Luis Suárez, Salvador Garcia, Francisco Herrera
Publication date: 28 January 2022
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10994-021-06010-w
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Support Vector Ordinal Regression
- rNPBST
- V-shaped interval insensitive loss for ordinal classification
- Joint maximization of accuracy and information for learning the structure of a Bayesian network classifier
- Aggregation functions based on penalties
- Optimal Latin-hypercube designs for computer experiments
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- Principal component analysis.
- Supervised distance metric learning through maximization of the Jeffrey divergence
- Reduction from Cost-Sensitive Ordinal Ranking to Weighted Binary Classification
- Concordance probability and discriminatory power in proportional hazards regression
- Nearest neighbor pattern classification
This page was built for publication: Ordinal regression with explainable distance metric learning based on ordered sequences