Reduction from cost-sensitive ordinal ranking to weighted binary classification

DOI10.1162/NECO_A_00265MaRDI QIDQ2919409zbMATH OpenWikidataFDO

Authors 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)

Recommendations

• Robust reductions from ranking to classification
• Robust Reductions from Ranking to Classification
• Generic subset ranking using binary classifiers
• Preference-based learning to rank
• A probabilistic framework for the design of instance-based supervised ranking algorithms in an ordinal setting

Cites work

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

Cited in

(13)

• Robust reductions from ranking to classification
• Perceptron ranking using interval labels with ramp loss for online ordinal regression
• Robust Reductions from Ranking to Classification
• Generic subset ranking using binary classifiers
• The benefits of modeling slack variables in SVMs
• Ordinal regression neural networks based on concentric hyperspheres
• A probabilistic framework for the design of instance-based supervised ranking algorithms in an ordinal setting
• Exploitation of pairwise class distances for ordinal classification
• Dimension reduction for object ranking
• Ordinal regression with explainable distance metric learning based on ordered sequences
• Ordinal regression based on learning vector quantization
• Incremental learning algorithm for large-scale semi-supervised ordinal regression
• Adaptive metric learning vector quantization for ordinal classification

This page was built for publication: Reduction from cost-sensitive ordinal ranking to weighted binary classification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2919409)