论文信息 - Efficient Coordinate Descent for Ranking with Domination Loss - 字舞流文

Efficient Coordinate Descent for Ranking with Domination Loss

Mark A. Stevens | Mark Stevens

[1] Yoram Singer,et al. Log-Linear Models for Label Ranking , 2003, NIPS.

[2] Koby Crammer,et al. A Family of Additive Online Algorithms for Category Ranking , 2003, J. Mach. Learn. Res..

[3] Samy Bengio,et al. A Discriminative Kernel-Based Approach to Rank Images from Text Queries , 2008, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4] Hang Li,et al. AdaRank: a boosting algorithm for information retrieval , 2007, SIGIR.

[5] Tie-Yan Liu,et al. Learning to rank: from pairwise approach to listwise approach , 2007, ICML '07.

[6] Yoram Singer,et al. Improved Boosting Algorithms Using Confidence-rated Predictions , 1998, COLT' 98.

[7] Jason Weston,et al. A kernel method for multi-labelled classification , 2001, NIPS.

[8] Michael Collins,et al. Discriminative Reranking for Natural Language Parsing , 2000, CL.

[9] John D. Lafferty,et al. Cranking: Combining Rankings Using Conditional Probability Models on Permutations , 2002, ICML.

[10] Tao Qin,et al. LETOR: Benchmark Dataset for Research on Learning to Rank for Information Retrieval , 2007 .

[11] Michael Collins,et al. Ranking Algorithms for Named Entity Extraction: Boosting and the VotedPerceptron , 2002, ACL.

[12] Stephen P. Boyd,et al. Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[13] Amit Singhal,et al. Pivoted document length normalization , 1996, SIGIR 1996.