{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:57:25Z","timestamp":1760597845426},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,10,29]],"date-time":"2018-10-29T00:00:00Z","timestamp":1540771200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100006115","name":"Institute for Research in Fundamental Sciences","doi-asserted-by":"publisher","award":["CS1397-4-55"],"award-info":[{"award-number":["CS1397-4-55"]}],"id":[{"id":"10.13039\/501100006115","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1007\/s10489-018-1330-z","type":"journal-article","created":{"date-parts":[[2018,10,29]],"date-time":"2018-10-29T05:31:55Z","timestamp":1540791115000},"page":"1185-1199","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["ERR.Rank: An algorithm based on learning to rank for direct optimization of Expected Reciprocal Rank"],"prefix":"10.1007","volume":"49","author":[{"given":"Elham","family":"Ghanbari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Azadeh","family":"Shakery","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,10,29]]},"reference":[{"key":"1330_CR1","doi-asserted-by":"crossref","unstructured":"Alencar ASC, Caldas WL, Gomes JPP, d. Souza AH, Aguilar PAC, Rodrigues C, Franco W (2015) MLM-rank: A ranking algorithm based on the minimal learning machine. In: Brazilian conference on intelligent systems (BRACIS), pp 305\u2013309","DOI":"10.1109\/BRACIS.2015.39"},{"key":"1330_CR2","unstructured":"Burges C, Ragno R (2006) Learning to rank with nonsmooth cost functions. In: Advances in neural information processing systems 18, pp 395\u2013402. The MIT Press"},{"key":"1330_CR3","doi-asserted-by":"crossref","unstructured":"Burges C, Shaked T, Renshaw E, Lazier A, Deeds M, Hamilton N, Hullender G (2005) Learning to rank using gradient descent. In: Proceedings of the 22nd international conference on machine learning, pp 89\u201396. ACM","DOI":"10.1145\/1102351.1102363"},{"issue":"C","key":"1330_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.neucom.2016.03.084","volume":"208","author":"RT Calumby","year":"2016","unstructured":"Calumby RT, Gon\u010balves MA, Torres RDS (2016) On interactive learning-to-rank for IR: Overview, recent advances, challenges, and directions. Neurocomput 208(C):3\u201324","journal-title":"Neurocomput"},{"key":"1330_CR5","doi-asserted-by":"crossref","unstructured":"Cao Z, Qin T, Liu TY, Tsai MF, Li H (2007) Learning to rank: From pairwise approach to listwise approach. In: Proceedings of the 24th international conference on machine learning, pp 129\u2013136. ACM","DOI":"10.1145\/1273496.1273513"},{"key":"1330_CR6","doi-asserted-by":"crossref","unstructured":"Chakrabarti S, Khanna R, Sawant U, Bhattacharyya C (2008) Structured learning for non-smooth ranking losses. In: Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 88\u201396. ACM","DOI":"10.1145\/1401890.1401906"},{"issue":"3","key":"1330_CR7","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s10791-009-9109-9","volume":"13","author":"O Chapelle","year":"2010","unstructured":"Chapelle O, Keerthi SS (2010) Efficient algorithms for ranking with SVMs. Inf Retr 13(3):201\u2013215","journal-title":"Inf Retr"},{"key":"1330_CR8","doi-asserted-by":"crossref","unstructured":"Chapelle O, Metlzer D (2009) Expected reciprocal rank for graded relevance. In: Proceedings of the 18th ACM conference on Information and knowledge management, pp 621\u2013630. ACM","DOI":"10.1145\/1645953.1646033"},{"issue":"3","key":"1330_CR9","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/s10791-009-9110-3","volume":"13","author":"O Chapelle","year":"2010","unstructured":"Chapelle O, Wu M (2010) Gradient descent optimization of smoothed information retrieval metrics. Inf Retr 13(3):216\u2013235","journal-title":"Inf Retr"},{"key":"1330_CR10","unstructured":"Clarke C, Craswell N, Soboroff I (2004) Overview of the trec 2004 terabyte track. In: Proceedings of the 13th text retrieval conference (TREC 2004), p 74"},{"key":"1330_CR11","doi-asserted-by":"crossref","unstructured":"Hersh W, Buckley C, Leone TJ, Hickam D (1994) OHSUMED: An interactive retrieval evaluation and new large test collection for research. In: Proceedings of the 17th international ACM SIGIR conference on research and development in information retrieval, pp 192\u2013201. ACM","DOI":"10.1007\/978-1-4471-2099-5_20"},{"key":"1330_CR12","unstructured":"Hiemstra D, Tax N, Bockting S (2017) Ranking learning-to-rank methods. In: Proceedings of the 1st International Workshop on LEARning Next gEneration Rankers, pp 3\u20133"},{"issue":"4","key":"1330_CR13","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/582415.582418","volume":"20","author":"K Jarvelin","year":"2002","unstructured":"Jarvelin K, Kekalainen J (2002) Cumulated gain-based evaluation of IR techniques. ACM Trans Inf Syst 20(4):422\u2013446","journal-title":"ACM Trans Inf Syst"},{"issue":"3","key":"1330_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2200\/S00607ED2V01Y201410HLT026","volume":"7","author":"H Li","year":"2014","unstructured":"Li H (2014) Learning to rank for information retrieval and natural language processing. Synthesis Lectures on Human Language Technologies 7(3):1\u2013121","journal-title":"Synthesis Lectures on Human Language Technologies"},{"issue":"7","key":"1330_CR15","first-page":"845","volume":"20","author":"P Li","year":"2008","unstructured":"Li P, Burges C, Wu Q (2008) McRank: learning to rank usingmultiple classification and gradient boosting. Adv Neural Inf Proces Syst 20(7):845\u2013852","journal-title":"Adv Neural Inf Proces Syst"},{"key":"1330_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14267-3","volume-title":"Learning to rank for information retrieval","author":"TY Liu","year":"2011","unstructured":"Liu TY (2011) Learning to rank for information retrieval. Springer, Berlin"},{"key":"1330_CR17","doi-asserted-by":"crossref","unstructured":"Ma Q, He B, Xu J (2016) Direct measurement of training query quality for learning to rank. In: Proceedings of the 31st annual ACM symposium on applied computing, SAC \u201916, pp 1035\u20131040. ACM","DOI":"10.1145\/2851613.2851693"},{"issue":"3","key":"1330_CR18","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s10791-006-9019-z","volume":"10","author":"D Metzler","year":"2007","unstructured":"Metzler D, Bruce Croft W (2007) Linear feature-based models for information retrieval. Inf Retr 10(3):257\u2013274","journal-title":"Inf Retr"},{"key":"1330_CR19","unstructured":"Ponte JM, Croft WB (1998) A language modeling approach to information retrieval. In: Proceedings of the 21st annual international ACM SIGIR conference on research and development in information retrieval, SIGIR \u201998. ACM, New York, pp 275\u2013281"},{"issue":"4","key":"1330_CR20","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s10791-009-9124-x","volume":"13","author":"T Qin","year":"2010","unstructured":"Qin T, Liu TY, Li H (2010) A general approximation framework for direct optimization of information retrieval measures. Inf Retr 13(4):375\u2013397","journal-title":"Inf Retr"},{"issue":"4","key":"1330_CR21","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/s10791-009-9123-y","volume":"13","author":"T Qin","year":"2010","unstructured":"Qin T, Liu TY, Xu J, Li H (2010) LETOR: A benchmark collection for research on learning to rank for information retrieval. Inf Retr 13(4):346\u2013374","journal-title":"Inf Retr"},{"issue":"2","key":"1330_CR22","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 XD, Tsai MF, Wang DS, Liu TY, Li H (2008) Query-level loss functions for information retrieval. Inf Process Manag 44(2):838\u2013855","journal-title":"Inf Process Manag"},{"key":"1330_CR23","unstructured":"Robertson S, Walker S, Jones S, Hancock-Beaulieu M, Gatford M (1994) Okapi at TREC-3. In: Proceedings of the 3rd text retrieval conference (TREC-3), pp 109\u2013126"},{"key":"1330_CR24","unstructured":"Shashua A, Levin A (2002) Ranking with large margin principle: Two approaches. In: Advances in neural information processing systems 15, pp 937\u2013944. The MIT Press"},{"key":"1330_CR25","doi-asserted-by":"crossref","unstructured":"Shi Y, Karatzoglou A, Baltrunas L, Larson M, Hanjalic A (2013) xCLiMF: Optimizing expected reciprocal rank for data with multiple levels of relevance. In: Proceedings of the 7th ACM conference on Recommender systems, pp 431\u2013434. ACM","DOI":"10.1145\/2507157.2507227"},{"key":"1330_CR26","doi-asserted-by":"crossref","unstructured":"Shi Y, Karatzoglou A, Baltrunas L, Larson M, Oliver N, Hanjalic A (2012) CLiMF: Learning to maximize reciprocal rank with collaborative less-is-more filtering. In: Proceedings of the 6th ACM conference on recommender systems, pp 139\u2013146. ACM","DOI":"10.1145\/2365952.2365981"},{"issue":"6","key":"1330_CR27","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1016\/j.ipm.2015.07.002","volume":"51","author":"N Tax","year":"2015","unstructured":"Tax N, Bockting S, Hiemstra D (2015) A cross-benchmark comparison of 87 learning to rank methods. Inf Process Manag 51(6):757\u2013772","journal-title":"Inf Process Manag"},{"key":"1330_CR28","doi-asserted-by":"crossref","unstructured":"Taylor M, Guiver J, Robertson S, Minka T (2008) SoftRank: optimizing non-smooth rank metrics. In: Proceedings of the 1st ACM international conference on web search and data mining, pp 77\u201386. ACM","DOI":"10.1145\/1341531.1341544"},{"key":"1330_CR29","unstructured":"Tewari A (2015) Generalization error bounds for learning to rank: Does the length of document lists matter?. In: Proceedings of the 32nd international conference on machine learning, pp 315\u2013323 JMLR"},{"key":"1330_CR30","unstructured":"Valizadegan H, Jin R, Zhang R, Mao J (2009) Learning to rank by optimizing ndcg measure. In: Advances in Neural Information Processing Systems 22, pp 1883\u20131891. The MIT Press"},{"key":"1330_CR31","doi-asserted-by":"crossref","unstructured":"Volkovs MN, Zemel RS (2009) BoltzRank: learning to maximize expected ranking gain. In: proceedings of the 26th International Conference on Machine Learning, pp 1089\u20131096. ACM","DOI":"10.1145\/1553374.1553513"},{"key":"1330_CR32","volume-title":"TREC: Experiment and Evaluation in Information Retrieval","author":"EM Voorhees","year":"2005","unstructured":"Voorhees EM, Harman DK (2005) TREC: Experiment and Evaluation in Information Retrieval. The MIT Press, Cambridge"},{"key":"1330_CR33","first-page":"42","volume":"14","author":"Y Wang","year":"2016","unstructured":"Wang Y, Choi IC, Liu H (2016) Generalized ensemble model for document ranking in information retrieval. Comput Sci Inf Syst 14:42","journal-title":"Comput Sci Inf Syst"},{"issue":"3","key":"1330_CR34","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/s10791-009-9112-1","volume":"13","author":"Q Wu","year":"2010","unstructured":"Wu Q, Burges C, Svore K, Gao J (2010) Adapting boosting for information retrieval measures. Inf Retr 13(3):254\u2013270","journal-title":"Inf Retr"},{"key":"1330_CR35","doi-asserted-by":"crossref","unstructured":"Xia F, Wang J (2008) Listwise approach to learning to rank-theory and algorithm. In: Proceedings of the 25th international conference on machine learning, pp 1192\u20131199. ACM","DOI":"10.1145\/1390156.1390306"},{"key":"1330_CR36","doi-asserted-by":"crossref","unstructured":"Xu J, Li H (2007) AdaRank: a boosting algorithm for information retrieval. In: Proceedings of the 30th International ACM SIGIR conference on research and development in information retrieval, 49, pp 391\u2013398. ACM","DOI":"10.1145\/1277741.1277809"},{"key":"1330_CR37","doi-asserted-by":"crossref","unstructured":"Xu J, Li H, yan Liu T, Peng Y, Lu M, Ying Ma W (2008) Direct optimization of evaluation measures in learning to rank. In: Proceedings of the 31st international ACM SIGIR conference on research and development in information retrieval, pp 107\u2013114. ACM","DOI":"10.1145\/1390334.1390355"},{"issue":"3","key":"1330_CR38","doi-asserted-by":"publisher","first-page":"1,26","DOI":"10.1145\/2983921","volume":"8","author":"J Xu","year":"2017","unstructured":"Xu J, Xia L, Lan Y, Guo J, Cheng X (2017) Directly optimize diversity evaluation measures: A new approach to search result diversification. ACM Trans Intell Syst Technol 8(3):1,26","journal-title":"ACM Trans Intell Syst Technol"},{"issue":"3","key":"1330_CR39","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s10791-009-9116-x","volume":"13","author":"E Yilmaz","year":"2010","unstructured":"Yilmaz E, Robertson S (2010) On the choice of effectiveness measures for learning to rank. Inf Retr 13(3):271\u2013290","journal-title":"Inf Retr"},{"key":"1330_CR40","doi-asserted-by":"crossref","unstructured":"Yue Y, Finley T, Radlinski F, Joachims T (2007) A support vector method for optimizing average precision. In: Proceedings of the 30th international ACM SIGIR conference on research and development in information retrieval, pp 271\u2013278. ACM","DOI":"10.1145\/1277741.1277790"},{"key":"1330_CR41","doi-asserted-by":"crossref","unstructured":"Zhang P, Lin H, Lin Y, Wu J (2011) Learning to rank by optimizing expected reciprocal rank. In: Proceedings of the 7th asia information retrieval societies conference, pp 93\u2013102. Springer","DOI":"10.1007\/978-3-642-25631-8_9"},{"issue":"2","key":"1330_CR42","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/s11704-015-4584-1","volume":"10","author":"R Zhang","year":"2016","unstructured":"Zhang R, Bao H, Sun H, Wang Y, Liu X (2016) Recommender systems based on ranking performance optimization. Front Comp Sci 10(2):270\u2013280","journal-title":"Front Comp Sci"},{"key":"1330_CR43","doi-asserted-by":"crossref","unstructured":"Zhao Y, Scholer F, Tsegay Y (2008) Effective pre-retrieval query performance prediction using similarity and variability evidence. In: Proceedings of the 30th european conference on ir research, pp 52\u201364. Springer","DOI":"10.1007\/978-3-540-78646-7_8"},{"issue":"6","key":"1330_CR44","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1016\/j.ipm.2015.07.002","volume":"15","author":"N Tax","year":"2015","unstructured":"Tax N, Bockting S, Hiemstra D (2015) A cross-benchmark comparison of 87 learning to rank methods. Inf Process Manag 15(6):757\u2013772","journal-title":"Inf Process Manag"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-018-1330-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-018-1330-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-018-1330-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,29]],"date-time":"2019-10-29T00:09:43Z","timestamp":1572307783000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-018-1330-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,29]]},"references-count":44,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,3]]}},"alternative-id":["1330"],"URL":"https:\/\/doi.org\/10.1007\/s10489-018-1330-z","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,10,29]]},"assertion":[{"value":"29 October 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}