Reduction from Cost-Sensitive Ordinal Ranking to Weighted Binary Classification

DOI10.1162/NECO_A_00265zbMath1247.68219WikidataQ50592011 ScholiaQ50592011MaRDI QIDQ2919409

Hsuan-Tien Lin, Ling Li

Publication date: 2 October 2012

Published in: Neural Computation (Search for Journal in Brave)

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Unnamed Item
• Support Vector Ordinal Regression
• Boosting the margin: a new explanation for the effectiveness of voting methods
• Multiple criteria decision analysis. State of the art surveys
• Large margin classification using the perceptron algorithm
• Improved boosting algorithms using confidence-rated predictions
• Very simple classification rules perform well on most commonly used datasets
• Large-Margin Thresholded Ensembles for Ordinal Regression: Theory and Practice
• Generalization Bounds for Some Ordinal Regression Algorithms
• Statistical Analysis of Bayes Optimal Subset Ranking
• A theory of the learnable
• Probability Inequalities for Sums of Bounded Random Variables
• Robust Reductions from Ranking to Classification
• Online Ranking by Projecting

Related Items (7)

Ordinal regression neural networks based on concentric hyperspheres ⋮ Incremental learning algorithm for large-scale semi-supervised ordinal regression ⋮ Exploitation of Pairwise Class Distances for Ordinal Classification ⋮ The Benefits of Modeling Slack Variables in SVMs ⋮ Ordinal regression based on learning vector quantization ⋮ Ordinal regression with explainable distance metric learning based on ordered sequences ⋮ Adaptive Metric Learning Vector Quantization for Ordinal Classification

This page was built for publication: Reduction from Cost-Sensitive Ordinal Ranking to Weighted Binary Classification