BoltzRank: learning to maximize expected ranking gain
暂无分享,去创建一个
[1] Tie-Yan Liu,et al. Learning to rank: from pairwise approach to listwise approach , 2007, ICML '07.
[2] Tao Qin,et al. FRank: a ranking method with fidelity loss , 2007, SIGIR.
[3] Jaana Kekäläinen,et al. IR evaluation methods for retrieving highly relevant documents , 2000, SIGIR '00.
[4] Koby Crammer,et al. Pranking with Ranking , 2001, NIPS.
[5] Yoram Singer,et al. An Efficient Boosting Algorithm for Combining Preferences by , 2013 .
[6] Thomas Hofmann,et al. Learning to Rank with Nonsmooth Cost Functions , 2006, NIPS.
[7] Hang Li,et al. AdaRank: a boosting algorithm for information retrieval , 2007, SIGIR.
[8] Gregory N. Hullender,et al. Learning to rank using gradient descent , 2005, ICML.
[9] Christopher J. C. Burges,et al. Ranking as Function Approximation , 2007 .
[10] Tao Qin,et al. LETOR: Benchmark Dataset for Research on Learning to Rank for Information Retrieval , 2007 .
[11] Stephen E. Robertson,et al. SoftRank: optimizing non-smooth rank metrics , 2008, WSDM '08.
[12] Tao Qin,et al. Global Ranking Using Continuous Conditional Random Fields , 2008, NIPS.