Generic subset ranking using binary classifiers

DOI10.1016/J.TCS.2012.05.026MaRDI QIDQ714869zbMATH OpenOpenAlexFDO

Authors Zhengya Sun, Wei Jin, Jue Wang

Publication date 11 October 2012

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2012.05.026

zbMATH Keywords

position-sensitive measuresregret boundsubset ranking

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computational learning theory (68Q32)

Recommendations

• Subset Ranking Using Regression
• Preference-based learning to rank
• Robust Reductions from Ranking to Classification
• Robust reductions from ranking to classification
• Reduction from cost-sensitive ordinal ranking to weighted binary classification

Cites work

• 10.1162/1532443041827916
• A NEW MEASURE OF RANK CORRELATION
• An efficient algorithm for learning to rank from preference graphs
• Error-correcting tournaments
• Inequalities: theory of majorization and its applications
• Learning Theory
• Robust Reductions from Ranking to Classification
• Statistical Analysis of Bayes Optimal Subset Ranking
• The \(p\)-norm push: a simple convex ranking algorithm that concentrates at the top of the list

Cited in

(7)

• Robust reductions from ranking to classification
• Robust Reductions from Ranking to Classification
• Subset Ranking Using Regression
• Reduction from cost-sensitive ordinal ranking to weighted binary classification
• General framework for binary classification on top samples
• Tune and mix: learning to rank using ensembles of calibrated multi-class classifiers
• Statistical Analysis of Bayes Optimal Subset Ranking

This page was built for publication: Generic subset ranking using binary classifiers

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