{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:44:54Z","timestamp":1761597894073,"version":"3.37.3"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2018,1,3]],"date-time":"2018-01-03T00:00:00Z","timestamp":1514937600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2018,5]]},"DOI":"10.1007\/s00500-017-2988-6","type":"journal-article","created":{"date-parts":[[2018,1,3]],"date-time":"2018-01-03T11:12:03Z","timestamp":1514977923000},"page":"3171-3185","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["An evolutionary strategy with machine learning for learning to rank in information retrieval"],"prefix":"10.1007","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9254-3093","authenticated-orcid":false,"given":"Osman Ali Sadek","family":"Ibrahim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Landa-Silva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,1,3]]},"reference":[{"key":"2988_CR1","volume-title":"Modern information retrieval\u2013the concepts and technology behind search","author":"RA Baeza-Yates","year":"2011","unstructured":"Baeza-Yates RA, Ribeiro-Neto BA (2011) Modern information retrieval\u2013the concepts and technology behind search, 2nd edn. Pearson Education Ltd., Harlow","edition":"2"},{"key":"2988_CR2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1023\/A:1015059928466","volume":"1","author":"H-G Beyer","year":"2002","unstructured":"Beyer H-G, Schwefel H-P (2002) Evolution strategies\u2014a comprehensive introduction. Nat Compu 1:3\u201352","journal-title":"Nat Compu"},{"issue":"1","key":"2988_CR3","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman L (2001) Random forests. Mach Learn 45(1):5\u201332. https:\/\/doi.org\/10.1023\/A:1010933404324","journal-title":"Mach Learn"},{"unstructured":"Brownlee J (2017) Overfitting and underfitting with machine learning algorithms. https:\/\/machinelearningmastery.com\/overfitting-and-underfitting-with-machine-learning-algorithms\/","key":"2988_CR4"},{"unstructured":"Burges CJC (2010) From RankNet to LambdaRank to LambdaMART: an overview. Technical report, Microsoft Research. http:\/\/research.microsoft.com\/en-us\/um\/people\/cburges\/tech_reports\/MSR-TR-2010-82.pdf","key":"2988_CR5"},{"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, ICML \u201905, pp 89\u201396, New York, NY. ACM. ISBN:1-59593-180-5. https:\/\/doi.org\/10.1145\/1102351.1102363","key":"2988_CR6","DOI":"10.1145\/1102351.1102363"},{"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: Proceedings of the 24th international conference on machine learning, ICML \u201907, pp 129\u2013136, New York, NY. ACM. ISBN:978-1-59593-793-3. https:\/\/doi.org\/10.1145\/1273496.1273513","key":"2988_CR7","DOI":"10.1145\/1273496.1273513"},{"unstructured":"Chapelle O, Chang Y (2011) Yahoo! learning to rank challenge overview. In: Proceedings of the Yahoo! Learning to rank challenge, held at ICML 2010, Haifa, Israel, 25 June 2010, pp 1\u201324. http:\/\/www.jmlr.org\/proceedings\/papers\/v14\/chapelle11a.html","key":"2988_CR8"},{"unstructured":"Dang V (2016) RankLib. http:\/\/www.cs.umass.edu\/~vdang\/ranklib.html","key":"2988_CR9"},{"unstructured":"Diaz-Gomez PA, Hougen DF (2007) Initial population for genetic algorithms: a metric approach. In: Proceedings of the 2007 international conference on genetic and evolutionary methods GEM, pp 43\u201349","key":"2988_CR10"},{"unstructured":"Freund Y, Iyer R, Schapire RE, Singer Y (2003) An efficient boosting algorithm for combining preferences. J Mach Learn Res 4:933\u2013969. ISSN:1532-4435. http:\/\/dl.acm.org\/citation.cfm?id=945365.964285","key":"2988_CR11"},{"doi-asserted-by":"crossref","unstructured":"Friedman JH (2001) Greedy function approximation: a gradient boosting machine. Ann Stat 29(5):1189\u20131232. ISSN:00905364. http:\/\/www.jstor.org\/stable\/2699986","key":"2988_CR12","DOI":"10.1214\/aos\/1013203451"},{"issue":"8","key":"2988_CR13","doi-asserted-by":"publisher","first-page":"3045","DOI":"10.1007\/s00500-015-1935-7","volume":"20","author":"OAS Ibrahim","year":"2016","unstructured":"Ibrahim OAS, Landa-Silva D (2016) Term frequency with average term occurrences for textual information retrieval. Soft Comput 20(8):3045\u20133061. https:\/\/doi.org\/10.1007\/s00500-015-1935-7","journal-title":"Soft Comput"},{"doi-asserted-by":"crossref","unstructured":"Ibrahim OAS, Landa-Silva D (2017) Es-rank: evolution strategy learning to rank approach. In: Proceedings of the symposium on applied computing, SAC \u201917, pp 944\u2013950, New York, NY. ACM. ISBN:978-1-4503-4486-9. https:\/\/doi.org\/10.1145\/3019612.3019696","key":"2988_CR14","DOI":"10.1145\/3019612.3019696"},{"unstructured":"Islam MA (2013) Rankgpes: learning to rank for information retrieval using a hybrid genetic programming with evolutionary strategies. Master\u2019s thesis, Computer Science, University of Windsor, Toronto, Canada","key":"2988_CR15"},{"unstructured":"Joachims T (2016a) Support vector machine for ranking. https:\/\/www.cs.cornell.edu\/people\/tj\/svm_light\/svm_rank.html#References","key":"2988_CR16"},{"unstructured":"Joachims T (2016b) Svmlight: support vector machine for classification and ranking. http:\/\/svmlight.joachims.org\/","key":"2988_CR17"},{"key":"2988_CR18","volume-title":"Learning to rank for information retrieval and natural language processing","author":"H Li","year":"2014","unstructured":"Li H (2014) Learning to rank for information retrieval and natural language processing, 2nd edn. Morgan & Claypool Publishers, San Rafael ISBN:9781627055857","edition":"2"},{"issue":"8","key":"2988_CR19","doi-asserted-by":"crossref","first-page":"2211","DOI":"10.1016\/j.patcog.2007.01.003","volume":"40","author":"J-Y Lin","year":"2007","unstructured":"Lin J-Y, Ke H-R, Chien B-C, Yang W-P (2007) Designing a classifier by a layered multi-population genetic programming approach. Pattern Recognit 40(8):2211\u20132225","journal-title":"Pattern Recognit"},{"doi-asserted-by":"crossref","unstructured":"Lin JY, Yeh JY, Liu CC (2012) Learning to rank for information retrieval using layered multi-population genetic programming. In: IEEE international conference on computational intelligence and cybernetics (CyberneticsCom), pp 45\u201349, July 2012. https:\/\/doi.org\/10.1109\/CyberneticsCom.2012.6381614","key":"2988_CR20","DOI":"10.1109\/CyberneticsCom.2012.6381614"},{"issue":"3","key":"2988_CR21","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1561\/1500000016","volume":"3","author":"T-Y Liu","year":"2009","unstructured":"Liu T-Y (2009) Learning to rank for information retrieval. Found Trends Inf Retr 3(3):225\u2013331. https:\/\/doi.org\/10.1561\/1500000016","journal-title":"Found Trends Inf Retr"},{"doi-asserted-by":"crossref","unstructured":"Liu T-Y (2011) Learning to rank for information retrieval. In: The LETOR datasets. Springer, Berlin, pp 133\u2013143. ISBN:978-3-642-14267-3. https:\/\/doi.org\/10.1007\/978-3-642-14267-3_10","key":"2988_CR22","DOI":"10.1007\/978-3-642-14267-3_10"},{"key":"2988_CR23","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511809071","volume-title":"Introduction to information retrieval","author":"CD Manning","year":"2008","unstructured":"Manning CD, Raghavan P, Sch\u00fctze H (2008) Introduction to information retrieval. Cambridge University Press, New York ISBN 0521865719, 9780521865715"},{"issue":"3","key":"2988_CR24","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 CW (2007) Linear feature-based models for information retrieval. Inf Retr 10(3):257\u2013274. https:\/\/doi.org\/10.1007\/s10791-006-9019-z","journal-title":"Inf Retr"},{"unstructured":"Mick J-YL (2016). http:\/\/people.cs.nctu.edu.tw\/~jylin\/lagep\/lagep.html","key":"2988_CR25"},{"unstructured":"Miller SJ (2006) The method of least squares. http:\/\/citeseerx.ist.psu.edu\/viewdoc\/summary?doi=10.1.1.710.4069","key":"2988_CR26"},{"key":"2988_CR27","first-page":"77","volume":"14","author":"A Mohan","year":"2011","unstructured":"Mohan A, Chen Z, Weinberger KQ (2011) Web-search ranking with initialized gradient boosted regression trees. J Mach Learn Res Workshop Conf Proc 14:77\u201389","journal-title":"J Mach Learn Res Workshop Conf Proc"},{"unstructured":"Qin T, Liu T-Y (2013) Introducing LETOR 4.0 datasets. CoRR. arxiv:1306.2597","key":"2988_CR28"},{"issue":"4","key":"2988_CR29","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 T-Y, Xu J, Li H (2010) Letor: a benchmark collection for research on learning to rank for information retrieval. Inf Retr 13(4):346\u2013374. https:\/\/doi.org\/10.1007\/s10791-009-9123-y","journal-title":"Inf Retr"},{"doi-asserted-by":"crossref","unstructured":"Sculley D (2010) Combined regression and ranking. In: Proceedings of the 16th ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201910, pp 979\u2013988, New York, NY, 2010. ACM. ISBN:978-1-4503-0055-1. https:\/\/doi.org\/10.1145\/1835804.1835928","key":"2988_CR30","DOI":"10.1145\/1835804.1835928"},{"issue":"5","key":"2988_CR31","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/s10791-015-9266-y","volume":"18","author":"A Tonon","year":"2015","unstructured":"Tonon A, Demartini G, Cudr-Mauroux P (2015) Pooling-based continuous evaluation of information retrieval systems. Inf Retr J 18(5):445\u2013472. https:\/\/doi.org\/10.1007\/s10791-015-9266-y","journal-title":"Inf Retr J"},{"issue":"3","key":"2988_CR32","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s10791-015-9274-y","volume":"19","author":"J Urbano","year":"2016","unstructured":"Urbano J (2016) Test collection reliability: a study of bias and robustness to statistical assumptions via stochastic simulation. Inf Retr J 19(3):313\u2013350. https:\/\/doi.org\/10.1007\/s10791-015-9274-y","journal-title":"Inf Retr J"},{"doi-asserted-by":"crossref","unstructured":"Xu J, Li H (2007) Adarank: a boosting algorithm for information retrieval. In: Proceedings of the 30th annual international ACM SIGIR conference on research and development in information retrieval, SIGIR \u201907, pp 391\u2013398, New York, NY. ACM. ISBN:978-1-59593-597-7. https:\/\/doi.org\/10.1145\/1277741.1277809","key":"2988_CR33","DOI":"10.1145\/1277741.1277809"},{"key":"2988_CR34","doi-asserted-by":"crossref","DOI":"10.1142\/6986","volume-title":"Linear regression analysis: theory and computing","author":"X Yan","year":"2009","unstructured":"Yan X, Su XG (2009) Linear regression analysis: theory and computing. World Scientific Publishing Co Inc., River Edge (ISBN:9789812834102, 9812834109)"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-017-2988-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-017-2988-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-017-2988-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,11]],"date-time":"2022-08-11T19:02:08Z","timestamp":1660244528000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-017-2988-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,3]]},"references-count":34,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2018,5]]}},"alternative-id":["2988"],"URL":"https:\/\/doi.org\/10.1007\/s00500-017-2988-6","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2018,1,3]]}}}