Statistical Analysis of Bayes Optimal Subset Ranking
From MaRDI portal
Publication:3604977
DOI10.1109/TIT.2008.929939zbMath1319.62042OpenAlexW2143166796MaRDI QIDQ3604977
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
Related Items (16)
Reduction from Cost-Sensitive Ordinal Ranking to Weighted Binary Classification ⋮ Active evaluation of ranking functions based on graded relevance ⋮ The asymptotics of ranking algorithms ⋮ Learning to rank on graphs ⋮ On the consistency of multi-label learning ⋮ U-Processes and Preference Learning ⋮ Generalization performance of bipartite ranking algorithms with convex losses ⋮ Calibration and regret bounds for order-preserving surrogate losses in learning to rank ⋮ Tune and mix: learning to rank using ensembles of calibrated multi-class classifiers ⋮ Sequential event prediction ⋮ The convergence rate of a regularized ranking algorithm ⋮ Approximation analysis of gradient descent algorithm for bipartite ranking ⋮ On empirical eigenfunction-based ranking with \(\ell^1\) norm regularization ⋮ Generic subset ranking using binary classifiers ⋮ Extreme learning machine for ranking: generalization analysis and applications ⋮ Unnamed Item
This page was built for publication: Statistical Analysis of Bayes Optimal Subset Ranking