{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,21]],"date-time":"2026-10-21T16:27:24Z","timestamp":1792600044028,"version":"4.5.0"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2009,12,30]],"date-time":"2009-12-30T00:00:00Z","timestamp":1262131200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2009,12,30]],"date-time":"2009-12-30T00:00:00Z","timestamp":1262131200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Inf Retrieval"],"published-print":{"date-parts":[[2010,8]]},"DOI":"10.1007\/s10791-009-9124-x","type":"journal-article","created":{"date-parts":[[2009,12,29]],"date-time":"2009-12-29T00:52:01Z","timestamp":1262047921000},"page":"375-397","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":151,"title":["A general approximation framework for direct optimization of information retrieval measures"],"prefix":"10.1007","volume":"13","author":[{"given":"Tao","family":"Qin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tie-Yan","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hang","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2009,12,30]]},"reference":[{"key":"9124_CR1","doi-asserted-by":"crossref","unstructured":"Burges, C., Shaked, T., Renshaw, E., Lazier, A., Deeds, M., Hamilton, N., et\u00a0al. (2005). Learning to rank using gradient descent. In ICML \u201905: Proceedings of the 22nd international conference on Machine learning (pp. 89\u201396). New York, NY, USA: ACM Press.","DOI":"10.1145\/1102351.1102363"},{"key":"9124_CR2","doi-asserted-by":"crossref","unstructured":"Cao, Z., Qin, T., Liu, T.-Y., Tsai, M.-F., & Li, H. (2007). Learning to rank: From pairwise approach to listwise approach. In ICML \u201907: Proceedings of the 24th international conference on Machine learning (pp. 129\u2013136). New York, NY, USA: ACM Press.","DOI":"10.1145\/1273496.1273513"},{"key":"9124_CR3","doi-asserted-by":"crossref","unstructured":"Chakrabarti, S., Khanna, R., Sawant, U., & Bhattacharyya, C. (2008). Structured learning for non-smooth ranking losses. In KDD \u201908: Proceeding of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining (pp. 88\u201396). New York, NY, USA: ACM.","DOI":"10.1145\/1401890.1401906"},{"key":"9124_CR4","unstructured":"Chapelle, O., Le, Q., & Smola, A. (2007). Large margin optimization of ranking measures. In NIPS2007 workshop on machine learning for Web search."},{"key":"9124_CR5","doi-asserted-by":"crossref","unstructured":"Duh, K., & Kirchhoff, K. (2008). Learning to rank with partially-labeled data. In SIGIR \u201908: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (pp. 251\u2013258). New York, NY, USA: ACM.","DOI":"10.1145\/1390334.1390379"},{"key":"9124_CR6","first-page":"933","volume":"4","author":"Y. Freund","year":"2003","unstructured":"Freund, Y., Iyer, R., Schapire, R. E., & Singer, Y. (2003). An efficient boosting algorithm for combining preferences. Journal of Machine Learning Research, 4, 933\u2013969.","journal-title":"Journal of Machine Learning Research"},{"key":"9124_CR7","doi-asserted-by":"crossref","unstructured":"Guiver, J., & Snelson, E. (2008). Learning to rank with softrank and gaussian processes. In SIGIR \u201908: Proceedings of the 31st annual international ACM SIGIR conference on research and development in information retrieval (pp. 259\u2013266). New York, NY, USA: ACM.","DOI":"10.1145\/1390334.1390380"},{"key":"9124_CR8","unstructured":"He, Y., & Liu, T.-Y. (2008). Are algorithms directly optimizing ir measures really direct? Technical Report MSR-TR-2008-154, Microsoft Corporation."},{"key":"9124_CR9","doi-asserted-by":"crossref","unstructured":"Herbrich, R., Graepel, T., & Obermayer K. (1999). Support vector learning for ordinal regression. In ICANN1999 (pp. 97\u2013102).","DOI":"10.1049\/cp:19991091"},{"key":"9124_CR10","unstructured":"Hu,  X.,  Shonkwiller,  R.,  & Spruill,  M.  (1994). Random  restarts  in global optimization. Technical Report, School of Mathematics, Georgia Institute of Technology, Atlanta."},{"issue":"4","key":"9124_CR11","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/582415.582418","volume":"20","author":"K. J\u00e4rvelin","year":"2002","unstructured":"J\u00e4rvelin, K., & Kek\u00e4l\u00e4inen, J. (2002). Cumulated gain-based evaluation of ir techniques. ACM Transactions on Information Systems, 20(4), 422\u2013446.","journal-title":"ACM Transactions on Information Systems"},{"key":"9124_CR12","doi-asserted-by":"crossref","unstructured":"Joachims T. (2002). Optimizing search engines using clickthrough data. In KDD \u201902: Proceedings of the 8th ACM SIGKDD international conference on knowledge discovery and data mining (pp. 133\u2013142). New York, NY, USA: ACM Press.","DOI":"10.1145\/775047.775067"},{"issue":"4598","key":"9124_CR13","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C., & Vecchi, M. (1983). Optimization by simulated annealing. Science 220(4598), 671\u2013680.","journal-title":"Science"},{"key":"9124_CR14","unstructured":"Liu, T.-Y., Xu, J., Qin, T., Xiong, W.-Y., & Li, H. (2007). Letor: benchmark dataset for research on learning to rank for information retrieval. In Proceedings of SIGIR 2007 workshop on learning to rank for information retrieval."},{"issue":"1","key":"9124_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1416950.1416952","volume":"27","author":"A. Moffat","year":"2008","unstructured":"Moffat, A., & Zobel, J. (2008). Rank-biased precision for measurement of retrieval effectiveness. ACM Transactions on Information Systems, 27(1), 1\u201327.","journal-title":"ACM Transactions on Information Systems"},{"key":"9124_CR16","unstructured":"Qin, T., Liu, T.-Y., & Li, H. (2008a). A general approximation framework for direct optimization of information retrieval measures. Technical Report MSR-TR-2008-164, Microsoft Corporation."},{"key":"9124_CR17","doi-asserted-by":"crossref","unstructured":"Qin, T., Liu, T.-Y., Zhang, X.-D., Wang, D.-S., Xiong, W.-Y., & Li, H. (2008b). Learning to rank relational objects and its application to web search. In WWW \u201908: Proceeding of the 17th international conference on World Wide Web (pp. 407\u2013416). New York, NY, USA: ACM.","DOI":"10.1145\/1367497.1367553"},{"issue":"2","key":"9124_CR18","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1016\/j.ipm.2007.07.016","volume":"44","author":"T. Qin","year":"2008","unstructured":"Qin, T., Zhang, X.-D., Tsai, M.-F., Wang, D.-S., Liu, T.-Y., & Li, H. (2008c). Query-level loss functions for information retrieval. Information Processing & Management,\n                           44(2), 838\u2013855.","journal-title":"Information Processing & Management"},{"key":"9124_CR19","unstructured":"Robertson S. E., & Hull D. A. (2000). The TREC-9 filtering track final report. In TREC (pp. 25\u201340)."},{"key":"9124_CR20","doi-asserted-by":"crossref","unstructured":"Taylor, M., Guiver, J., Robertson, S., & Minka, T. (2008). Softrank: optimizing non-smooth rank metrics. In WSDM \u201908: Proceedings of the international conference on Web search and web data mining (pp. 77\u201386). New York, NY, USA: ACM.","DOI":"10.1145\/1341531.1341544"},{"key":"9124_CR21","doi-asserted-by":"crossref","unstructured":"Tsai, M.-F., Liu, T.-Y, Qin, T., Chen, H.-H., & Ma, W.-Y. (2007). Frank: a ranking method with fidelity loss. In SIGIR \u201907 (pp. 383\u2013390). New York, NY, USA: ACM Press.","DOI":"10.1145\/1277741.1277808"},{"key":"9124_CR22","unstructured":"Vapnik, V. (1998). Statistical learning theory. New York: Wiley."},{"key":"9124_CR23","doi-asserted-by":"crossref","unstructured":"Volkovs, M. N., & Zemel, R. S. (2009). Boltzrank: Learning to maximize expected ranking gain. In ICML \u201909: Proceedings of the 26th annual international conference on machine learning (pp. 1089\u20131096). New York, NY, USA: ACM.","DOI":"10.1145\/1553374.1553513"},{"key":"9124_CR24","unstructured":"Voorhees, E., & Harman, D. (2005). TREC: Experiment and evaluation in information retrieval. Cambridge: MIT Press."},{"key":"9124_CR25","doi-asserted-by":"crossref","unstructured":"Xia, F., Liu, T.-Y., Wang, J., Zhang, W., & Li, H. (2008). Listwise approach to learning to rank: Theory and algorithm. In ICML \u201908: Proceedings of the 25th international conference on machine learning (pp. 1192\u20131199). New York, NY, USA: ACM.","DOI":"10.1145\/1390156.1390306"},{"key":"9124_CR26","doi-asserted-by":"crossref","unstructured":"Xu, J., & Li, H. (2007). Adarank: A boosting algorithm for information retrieval. In SIGIR \u201907: Proceedings of the 30th annual international ACM SIGIR conference on research and development in information retrieval (pp. 391\u2013398). New York, NY, USA: ACM Press.","DOI":"10.1145\/1277741.1277809"},{"key":"9124_CR27","doi-asserted-by":"crossref","unstructured":"Xu, J., Liu, T.-Y., Lu, M., Li, H., & Ma, W.-Y. (2008). Directly optimizing evaluation measures in learning to rank. In SIGIR \u201908: Proceedings of the 31st annual international ACM SIGIR conference on research and development in information retrieval (pp. 107\u2013114). New York, NY, USA: ACM.","DOI":"10.1145\/1390334.1390355"},{"key":"9124_CR28","doi-asserted-by":"crossref","unstructured":"Yue, Y., Finley, T., Radlinski, F., & Joachims, T. (2007). A support vector method for optimizing average precision. In SIGIR \u201907: Proceedings of the 30th annual international ACM SIGIR conference on research and development in information retrieval (pp. 271\u2013278). New York, NY, USA: ACM Press.","DOI":"10.1145\/1277741.1277790"},{"key":"9124_CR29","doi-asserted-by":"crossref","unstructured":"Zhai, C., & Lafferty, J. (2001). A study of smoothing methods for language models applied to ad hoc information retrieval. In Proceedings of the 24th annual international ACM SIGIR conference on research and development in information retrieval (pp. 334\u2013342). New York, NY, USA: ACM Press.","DOI":"10.1145\/383952.384019"},{"key":"9124_CR30","doi-asserted-by":"crossref","unstructured":"Zheng, Z., Chen, K., Sun, G., & Zha, H. (2007). A regression framework for learning ranking functions using relative relevance judgments. In SIGIR \u201907: Proceedings of the 30th annual international ACM SIGIR conference on research and development in information retrieval (pp. 287\u2013294). New York, NY, USA: ACM.","DOI":"10.1145\/1277741.1277792"},{"key":"9124_CR31","doi-asserted-by":"crossref","unstructured":"Zhou, K., Xue, G.-R., Zha, H., & Yu, Y. (2008). Learning to rank with ties. In SIGIR \u201908: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (pp. 275\u2013282). New York, NY, USA: ACM.","DOI":"10.1145\/1390334.1390382"}],"container-title":["Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10791-009-9124-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10791-009-9124-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10791-009-9124-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10791-009-9124-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T09:51:47Z","timestamp":1704189107000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10791-009-9124-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,12,30]]},"references-count":31,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,8]]}},"alternative-id":["9124"],"URL":"https:\/\/doi.org\/10.1007\/s10791-009-9124-x","relation":{},"ISSN":["1386-4564","1573-7659"],"issn-type":[{"value":"1386-4564","type":"print"},{"value":"1573-7659","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,12,30]]},"assertion":[{"value":"29 April 2009","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 December 2009","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 December 2009","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}