Reduction from cost-sensitive ordinal ranking to weighted binary classification

DOI10.1162/NECO_A_00265zbMATH Open1247.68219WikidataQ50592011 ScholiaQ50592011MaRDI QIDQ2919409FDOQ2919409

Authors: Hsuan-Tien Lin, Ling Li 

Publication date: 2 October 2012

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

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

Mathematics Subject Classification ID

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

Cites Work

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

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
• Incremental learning algorithm for large-scale semi-supervised ordinal regression
• Ordinal regression with explainable distance metric learning based on ordered sequences
• Ordinal regression based on learning vector quantization
• 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)