Statistical Analysis of Bayes Optimal Subset Ranking
From MaRDI portal
Publication:3604977
DOI10.1109/TIT.2008.929939zbMATH Open1319.62042OpenAlexW2143166796MaRDI QIDQ3604977FDOQ3604977
Authors: David Cossock, Tong Zhang 
Publication date: 24 February 2009
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2008.929939
Recommendations
Cited In (18)
- Extreme learning machine for ranking: generalization analysis and applications
- Calibration and regret bounds for order-preserving surrogate losses in learning to rank
- Generic subset ranking using binary classifiers
- Subset Ranking Using Regression
- On empirical eigenfunction-based ranking with \(\ell^1\) norm regularization
- Approximation analysis of gradient descent algorithm for bipartite ranking
- U-Processes and Preference Learning
- The convergence rate of a regularized ranking algorithm
- Generalization performance of bipartite ranking algorithms with convex losses
- Moment-Matching-Based Conjugacy Approximation for Bayesian Ranking and Selection
- Online learning to rank with top-k feedback
- Sequential event prediction
- Tune and mix: learning to rank using ensembles of calibrated multi-class classifiers
- On the consistency of multi-label learning
- Active evaluation of ranking functions based on graded relevance
- The asymptotics of ranking algorithms
- Reduction from cost-sensitive ordinal ranking to weighted binary classification
- Learning to rank on graphs
This page was built for publication: Statistical Analysis of Bayes Optimal Subset Ranking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604977)
