[1]CHU W, KEERTHI S S. New approaches to support vector ordinal regression[C]// Proceedings of the International Conference on Machine Learning. New York: ACM, 2005:145-152.[2]SHASHUA A, LEVIN A. Ranking with large margin principle: Two approaches[C]//Advances in Neural Information Processing Systems. New York: ACM, 2003: 937-944.[3]BURGES C, SHAKED T, RENSHAW E. Learning to rank using gradient descent[C]// Proceedings of the International Conference on Machine Learning. New York: ACM, 2005:89-96.[4]FREUND Y, IYER R, SCHAPIRE R E. An efficient boosting algorithm for combining preferences[J]. Journal of Machine Learning Research, 2003,4(12):933-969.[5]HERBRICH R, GRAPEL T, OBERMAYER K. Large margin rank boundaries for ordinal regression[M]. Cambridge: MIT Press, 2000.[6]JOACHIMS T. Optimizing search engines using clickthrough data[C]// Proceedings of the ACM Conference on Knowledge Discovery and Data Mining. New York: ACM,2002:134-142.[7]ZHENG ZHAOHUI, ZHA HONGYUAN, ZHANG TONG,et al. A general boosting method and its application to learning ranking functions for Web search[C]// Advances in Neural Information Processing Systems. New York: ACM, 2008: 1697-1704.[8]USUNIER N, BUFFONI D, GALLINARI P. Ranking with ordered weighted pairwise classification[C]// Proceedings of the 26th International Conference on Machine Learning. New York: ACM, 2009:188-196.[9]CAO ZHE, QIN TAO, LIU TIE-YAN, et al. Learning to rank: From pairwise approach to listwise approach[C]// Proceedings of the International Conference on Machine Learning’07. New York: ACM, 2007: 129-136.[10]ARAMPATZIS A, KAMPS J. Where to stop reading a ranked list[C]// Proceedings of the 32th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. New York: ACM, 2009: 524-531.[11]McFEE B, LANCKRIET G. Metric learning to rank[C]// Proceedings of the 27th International Conference on Machine Learning. New York: ACM, 2010:235-243. [12]JARVELIN K, KEKALAINEN J. Evaluation methods for retrieving highly relevantdocuments[C]// Proceedings of the 23th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. New York: ACM,2000: 41-48.[13]HIRIART-URRUTY J B, LEMAR′ECHAL C. Convex analysis and minimization algorithms I and II[M]. Berlin:Springer-Verlag, 1993.[14]TEO C H, LE Q, SMOLA A, et al. A scalable modular convex solver for regularized risk minimization[C]// Proceedings of International Conference on Knowledge Discovery and Data Mining (KDD). New York: ACM, 2007: 48-57.[15]LIU TIE-YAN, QIN TAO, XU JUN, et al. Letor: Benchmark dataset for research on learning to rank for information retrieval[C]// Learning to Rank for Information Retrieval. New York: ACM, 2007:137-145.[16]XU JUN, LI HANG. Adarank: A boosting algorithm for information retrieval[C]// Learning to Rank for Information Retrieval. New York: ACM, 2007: 391-398. |