Maximizing upgrading and downgrading margins for ordinal regression
The paper is a contribution to the theory of classifying a set of objects into a set of ranked classes. Classifying an object in a class with a higher rank than its actual rank is called upgrading error. Similarly classifying an object in a class of lower rank is called downgrading error. Upgrading and downgrading errors are considered as two different classifier quality criteria to be taken into account. A support vector machines approach to maximization of undergrading and downgrading margins as an effective method of minimizing classification errors is proposed. A biobjective optimization problem is used to maximize simultaneously the upgrading and downgrading margins. It is shown that the resulting set of Pareto-optimal solutions can be obtained by solving one quadratic optimization problem. Several illustrative examples in the concluding part of the paper help to understand the proposed approach and applicability of the results.
- A confidence voting process for ranking problems based on support vector machines
- A PAC-Bayesian margin bound for linear classifiers
- A review of ordinal regression models applied on health-related quality of life assessments
- A simple generalisation of the area under the ROC curve for multiple class classification problems
- An introduction to support vector machines and other kernel-based learning methods.
- Asymmetric distances, semidirected networks and majority in Fermat-Weber problems
- Classification by pairwise coupling
- Combining discriminant models with new multi-class SVMs
- Deriving weights in multiple-criteria decision making with support vector machines
- Evolutionary Multi-Criterion Optimization
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- scientific article; zbMATH DE number 823069 (Why is no real title available?)
- Large-Margin Thresholded Ensembles for Ordinal Regression: Theory and Practice
- Learning Rule Ensembles for Ordinal Classification with Monotonicity Constraints
- Linear and Nonlinear Separation of Patterns by Linear Programming
- MOP/GP models for machine learning
- Multi-group support vector machines with measurement costs: A biobjective approach
- Multicategory classification by support vector machines
- On the scalability of ordered multi-class ROC analysis
- Reducing multiclass to binary: A unifying approach for margin classifiers
- Stochastic dominance-based rough set model for ordinal classification
- Support vector machines with different norms: Motivation, formulations and results
- Support Vector Ordinal Regression
- Support-vector networks
- Two-group classification via a biobjective margin maximization model
This page was built for publication: Maximizing upgrading and downgrading margins for ordinal regression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1935916)
