{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,9]],"date-time":"2025-12-09T08:27:17Z","timestamp":1765268837355,"version":"build-2065373602"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2022,8,8]],"date-time":"2022-08-08T00:00:00Z","timestamp":1659916800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,8,8]],"date-time":"2022-08-08T00:00:00Z","timestamp":1659916800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s10115-022-01726-0","type":"journal-article","created":{"date-parts":[[2022,8,8]],"date-time":"2022-08-08T20:02:30Z","timestamp":1659988950000},"page":"2833-2847","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Hybrid online\u2013offline learning to rank using simulated annealing strategy based on dependent click model"],"prefix":"10.1007","volume":"64","author":[{"given":"Osman Ali Sadek","family":"Ibrahim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eman M. G.","family":"Younis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,8]]},"reference":[{"key":"1726_CR1","doi-asserted-by":"publisher","unstructured":"Joachims T (2002) Optimizing search engines using clickthrough data. In: Proceedings of the eighth ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201902, pp 133\u2013142, New York, NY, USA, 2002. ACM. ISBN 1-58113-567-X. https:\/\/doi.org\/10.1145\/775047.775067","DOI":"10.1145\/775047.775067"},{"issue":"3","key":"1726_CR2","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","journal-title":"Found Trends Inf Retr"},{"key":"1726_CR3","doi-asserted-by":"publisher","unstructured":"Schuth A, Hofmann K, Whiteson S, de Rijke M (2013) LEROT: an online learning to rank framework. In: Proceedings of the 2013 workshop on Living labs for information retrieval evaluation CIKM 2013, San Francisco, California, USA, November 1, 2013, pp 23\u201326. https:\/\/doi.org\/10.1145\/2513150.2513162","DOI":"10.1145\/2513150.2513162"},{"issue":"5","key":"1726_CR4","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1016\/j.ipm.2011.03.002","volume":"47","author":"A Al-Maskari","year":"2011","unstructured":"Al-Maskari A, Sanderson M (2011) The effect of user characteristics on search effectiveness in information retrieval. Inf Process Manag 47(5):719\u2013729. https:\/\/doi.org\/10.1016\/j.ipm.2011.03.002","journal-title":"Inf Process Manag"},{"key":"1726_CR5","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 and Claypool Publishers, Williston","edition":"2"},{"key":"1726_CR6","unstructured":"Kharitonov E (2016) Using interaction data for improving the offline and online evaluation of search engines. PhD thesis, University of Glasgow"},{"issue":"2","key":"1726_CR7","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1145\/2568388.2568413","volume":"47","author":"K Hofmann","year":"2013","unstructured":"Hofmann K (2013) Fast and reliable online learning to rank for information retrieval. SIGIR Forum 47(2):140. https:\/\/doi.org\/10.1145\/2568388.2568413","journal-title":"SIGIR Forum"},{"key":"1726_CR8","doi-asserted-by":"crossref","unstructured":"Schuth A (2016) Search engines that learn from their users. PhD thesis, Informatics Institute, University of Amsterdam, http:\/\/www.anneschuth.nl\/thesis","DOI":"10.1145\/2964797.2964817"},{"key":"1726_CR9","doi-asserted-by":"publisher","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"},{"issue":"8","key":"1726_CR10","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"},{"issue":"5","key":"1726_CR11","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\u00e9-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":"1726_CR12","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"},{"issue":"4","key":"1726_CR13","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. https:\/\/doi.org\/10.1007\/s10791-009-9123-y","journal-title":"Inf Retr"},{"key":"1726_CR14","doi-asserted-by":"publisher","DOI":"10.1142\/6986","volume-title":"Linear regression analysis: theory and computing","author":"X Yan","year":"2009","unstructured":"Yan X, Su X (2009) Linear regression analysis: theory and computing. World Scientific Publishing Co., Inc, River Edge"},{"key":"1726_CR15","first-page":"933","volume":"4","author":"Y Freund","year":"2003","unstructured":"Freund Y, Iyer R, Schapire RE, Singer Y (2003) An efficient boosting algorithm for combining preferences. J Mach Learn Res 4:933\u2013969","journal-title":"J Mach Learn Res"},{"issue":"5","key":"1726_CR16","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1214\/aos\/1013203451","volume":"29","author":"JH Friedman","year":"2001","unstructured":"Friedman JH (2001) Greedy function approximation: a gradient boosting machine. Ann Stat 29(5):1189\u20131232","journal-title":"Ann Stat"},{"key":"1726_CR17","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"},{"issue":"1","key":"1726_CR18","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"},{"key":"1726_CR19","doi-asserted-by":"publisher","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, USA, ACM. https:\/\/doi.org\/10.1145\/1102351.1102363","DOI":"10.1145\/1102351.1102363"},{"key":"1726_CR20","doi-asserted-by":"publisher","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, USA, ACM. https:\/\/doi.org\/10.1145\/1273496.1273513","DOI":"10.1145\/1273496.1273513"},{"key":"1726_CR21","doi-asserted-by":"publisher","unstructured":"Lin, JY, Yeh, JY, Liu CC (2012) Learning to rank for information retrieval using layered multi-population genetic programming. In: Computational intelligence and cybernetics (CyberneticsCom), 2012 IEEE international conference on, pp 45\u201349, July https:\/\/doi.org\/10.1109\/CyberneticsCom.2012.6381614","DOI":"10.1109\/CyberneticsCom.2012.6381614"},{"key":"1726_CR22","unstructured":"Mick JYL (2016) Accessed http:\/\/people.cs.nctu.edu.tw\/jylin\/lagep\/lagep.html"},{"issue":"3","key":"1726_CR23","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. https:\/\/doi.org\/10.1007\/s10791-006-9019-z","journal-title":"Inf Retr"},{"key":"1726_CR24","doi-asserted-by":"publisher","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, USA, ACM. https:\/\/doi.org\/10.1145\/1277741.1277809","DOI":"10.1145\/1277741.1277809"},{"key":"1726_CR25","unstructured":"Islam MA (2013) RankGPES: learning to rank for information retrieval using a hybrid genetic programming with evolutionary strategies"},{"key":"1726_CR26","doi-asserted-by":"publisher","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, USA, 2010. ACM. ISBN 978-1-4503-0055-1. https:\/\/doi.org\/10.1145\/1835804.1835928","DOI":"10.1145\/1835804.1835928"},{"key":"1726_CR27","unstructured":"Dang V (2016) RankLib. http:\/\/www.cs.umass.edu\/~vdang\/ranklib.html"},{"key":"1726_CR28","unstructured":"Christopher JC (2010) Burges 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":"1726_CR29","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, June 25, 2010, pp 1\u201324. http:\/\/www.jmlr.org\/proceedings\/papers\/v14\/chapelle11a.html"},{"key":"1726_CR30","doi-asserted-by":"publisher","first-page":"3171","DOI":"10.1007\/s00500-017-2988-6","volume":"22","author":"OAS Ibrahim","year":"2018","unstructured":"Ibrahim OAS, Landa-Silva D (2018) An evolutionary strategy with machine learning for learning to rank in information retrieval. Soft Comput 22:3171\u20133185. https:\/\/doi.org\/10.1007\/s00500-017-2988-6","journal-title":"Soft Comput"},{"issue":"2","key":"1726_CR31","doi-asserted-by":"publisher","first-page":"1046","DOI":"10.1145\/3439861","volume":"39","author":"Q Ai","year":"2021","unstructured":"Ai Q, Yang T, Wang H, Mao J (2021) Unbiased learning to rank: online or offline? ACM Trans Inf Syst 39(2):1046\u20138188. https:\/\/doi.org\/10.1145\/3439861","journal-title":"ACM Trans Inf Syst"},{"key":"1726_CR32","doi-asserted-by":"publisher","unstructured":"Lian J, Zhou X, Zhang F, Chen Z, Xie X, Sun G (2018) Xdeepfm: combining explicit and implicit feature interactions for recommender systems. In: Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data mining, KDD \u201918, pp 1754\u20131763, New York, NY, USA, Association for Computing Machinery. ISBN 9781450355520. https:\/\/doi.org\/10.1145\/3219819.3220023","DOI":"10.1145\/3219819.3220023"},{"key":"1726_CR33","doi-asserted-by":"publisher","unstructured":"Cakir F, He K, Xia X, Kulis B, Sclaroff S (2019) Deep metric learning to rank. In: 2019 IEEE\/CVF conference on computer vision and pattern recognition (CVPR), pp 1861\u20131870, https:\/\/doi.org\/10.1109\/CVPR.2019.00196","DOI":"10.1109\/CVPR.2019.00196"},{"key":"1726_CR34","doi-asserted-by":"publisher","unstructured":"Craswell N, Zoeter O, Taylor M, Ramsey B (2008) An experimental comparison of click position-bias models. In: Proceedings of the 2008 international conference on web search and data mining, WSDM \u201908, pp 87\u201394, New York, NY, USA, ACM. https:\/\/doi.org\/10.1145\/1341531.1341545","DOI":"10.1145\/1341531.1341545"},{"key":"1726_CR35","doi-asserted-by":"publisher","unstructured":"Guo F, Liu C, Wang YM (2009) Efficient multiple-click models in web search. In: Proceedings of the second ACM international conference on web search and data mining, WSDM \u201909, pp 124\u2013131, New York, NY, USA, ACM. https:\/\/doi.org\/10.1145\/1498759.1498818","DOI":"10.1145\/1498759.1498818"},{"issue":"2","key":"1726_CR36","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/0047-259X(90)90084-U","volume":"32","author":"JL Teugels","year":"1990","unstructured":"Teugels JL (1990) Some representations of the multivariate Bernoulli and binomial distributions. J Multivar Anal 32(2):256\u2013268. https:\/\/doi.org\/10.1016\/0047-259X(90)90084-U","journal-title":"J Multivar Anal"},{"issue":"3","key":"1726_CR37","first-page":"1","volume":"7","author":"A Chuklin","year":"2015","unstructured":"Chuklin A, Markov I, de Rijke M (2015) Click models for web search. Synth Lect Inf Concepts Retr Serv 7(3):1\u2013115","journal-title":"Synth Lect Inf Concepts Retr Serv"},{"issue":"5","key":"1726_CR38","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/s00500-002-0184-8","volume":"6","author":"O Cord\u00f3n","year":"2002","unstructured":"Cord\u00f3n O, de Moya Aneg\u00f3n F, Zarco C (2002) A new evolutionary algorithm combining simulated annealing and genetic programming for relevance feedback in fuzzy information retrieval systems. Soft Comput 6(5):308\u2013319. https:\/\/doi.org\/10.1007\/s00500-002-0184-8","journal-title":"Soft Comput"},{"key":"1726_CR39","doi-asserted-by":"publisher","unstructured":"Chirila C-B, \u015eora I (2019) The optimization of a page rank based key classes classifier using simulated annealing with ROC-AUC and recall metrics. In: 2019 IEEE 13th international symposium on applied computational intelligence and informatics (SACI), pp 000021\u2013000026, https:\/\/doi.org\/10.1109\/SACI46893.2019.9111601","DOI":"10.1109\/SACI46893.2019.9111601"},{"key":"1726_CR40","unstructured":"Landa Silva JD (2003) Metaheuristic and multiobjective approaches for space allocation. PhD thesis, University of Nottingham"},{"key":"1726_CR41","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":"1726_CR42","doi-asserted-by":"publisher","unstructured":"Loshchilov I (2014) A computationally efficient limited memory CMA-ES for large scale optimization. In: Proceedings of the 2014 annual conference on genetic and evolutionary computation, GECCO \u201914, pp 397\u2013404, New York, NY, USA, 2014. ACM. https:\/\/doi.org\/10.1145\/2576768.2598294","DOI":"10.1145\/2576768.2598294"},{"key":"1726_CR43","unstructured":"Qin T, Liu T-Y (2013) Introducing LETOR 4.0 datasets. CoRR, arXiv:1306.2597"},{"key":"1726_CR44","doi-asserted-by":"publisher","unstructured":"Liu T-Y (2011) The LETOR datasets. In: Learning to rank for information retrieval. Springer Berlin Heidelberg, Berlin, Heidelberg, pp 133\u2013143, https:\/\/doi.org\/10.1007\/978-3-642-14267-3_10","DOI":"10.1007\/978-3-642-14267-3_10"},{"key":"1726_CR45","unstructured":"Baeza-Yates R, Ribeiro-Neto B (2011) Modern information retrieval: the concepts and technology behind search, 2nd edn. Pearson Education Ltd., Harlow http:\/\/www.mir2ed.org\/"},{"key":"1726_CR46","doi-asserted-by":"publisher","unstructured":"Chapelle O, Metlzer D, Zhang Y, Grinspan P (2009) Expected reciprocal rank for graded relevance. In: Proceedings of the 18th ACM conference on information and knowledge management, CIKM \u201909, pp 621\u2013630, New York, NY, USA, Association for Computing Machinery. https:\/\/doi.org\/10.1145\/1645953.1646033","DOI":"10.1145\/1645953.1646033"},{"key":"1726_CR47","unstructured":"Whiteson S, de Rijke M, Schuth A, Hofmann K (2013) Lerot: an online learning to rank framework. In: Living labs for information retrieval evaluation workshop at CIKM-13, http:\/\/www.anneschuth.nl\/wp-content\/uploads\/2013\/09\/cikm-livinglab-2013-lerot.pdf"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-022-01726-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10115-022-01726-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-022-01726-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,12]],"date-time":"2022-09-12T03:15:51Z","timestamp":1662952551000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10115-022-01726-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,8]]},"references-count":47,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["1726"],"URL":"https:\/\/doi.org\/10.1007\/s10115-022-01726-0","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"type":"print","value":"0219-1377"},{"type":"electronic","value":"0219-3116"}],"subject":[],"published":{"date-parts":[[2022,8,8]]},"assertion":[{"value":"11 April 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 May 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 July 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 August 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}