Generic subset ranking using binary classifiers

DOI10.1016/J.TCS.2012.05.026zbMATH Open1280.68202OpenAlexW2055903452MaRDI QIDQ714869FDOQ714869

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

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

zbMATH Keywords

position-sensitive measuresregret boundsubset ranking

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (6)

• Robust reductions from ranking to classification
• Robust Reductions from Ranking to Classification
• Subset Ranking Using Regression
• Statistical Analysis of Bayes Optimal Subset Ranking
• General framework for binary classification on top samples
• Reduction from cost-sensitive ordinal ranking to weighted binary classification

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)