On the Consistency of Ranking Algorithms
暂无分享,去创建一个
[1] Richard M. Karp,et al. Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.
[2] 丸山 徹. Convex Analysisの二,三の進展について , 1977 .
[3] Aharon Ben-Tal,et al. Lectures on modern convex optimization , 1987 .
[4] Yoram Singer,et al. An Efficient Boosting Algorithm for Combining Preferences by , 2013 .
[5] Ralf Herbrich,et al. Large margin rank boundaries for ordinal regression , 2000 .
[6] Thore Graepel,et al. Large Margin Rank Boundaries for Ordinal Regression , 2000 .
[7] Arkadi Nemirovski,et al. Lectures on modern convex optimization - analysis, algorithms, and engineering applications , 2001, MPS-SIAM series on optimization.
[8] Amnon Shashua,et al. Ranking with Large Margin Principle: Two Approaches , 2002, NIPS.
[9] Jaana Kekäläinen,et al. Cumulated gain-based evaluation of IR techniques , 2002, TOIS.
[10] Yoram Singer,et al. Log-Linear Models for Label Ranking , 2003, NIPS.
[11] Tong Zhang,et al. Statistical Analysis of Some Multi-Category Large Margin Classification Methods , 2004, J. Mach. Learn. Res..
[12] Ambuj Tewari,et al. On the Consistency of Multiclass Classification Methods , 2007, J. Mach. Learn. Res..
[13] Michael I. Jordan,et al. Convexity, Classification, and Risk Bounds , 2006 .
[14] Tie-Yan Liu,et al. Listwise approach to learning to rank: theory and algorithm , 2008, ICML '08.
[15] Tong Zhang,et al. Statistical Analysis of Bayes Optimal Subset Ranking , 2008, IEEE Transactions on Information Theory.
[16] Cynthia Rudin,et al. The P-Norm Push: A Simple Convex Ranking Algorithm that Concentrates at the Top of the List , 2009, J. Mach. Learn. Res..