{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:36:50Z","timestamp":1761896210987,"version":"3.37.3"},"reference-count":74,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,1,20]],"date-time":"2016-01-20T00:00:00Z","timestamp":1453248000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004481","name":"University of Tehran (IR)","doi-asserted-by":"publisher","award":["8101004\/1\/02"],"award-info":[{"award-number":["8101004\/1\/02"]}],"id":[{"id":"10.13039\/501100004481","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Genet Program Evolvable Mach"],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1007\/s10710-016-9263-y","type":"journal-article","created":{"date-parts":[[2016,1,20]],"date-time":"2016-01-20T11:11:41Z","timestamp":1453288301000},"page":"203-230","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Learning to rank: new approach with the layered multi-population genetic programming on click-through features"],"prefix":"10.1007","volume":"17","author":[{"given":"Amir Hosein","family":"Keyhanipour","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Behzad","family":"Moshiri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Farhad","family":"Oroumchian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maseud","family":"Rahgozar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kambiz","family":"Badie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,1,20]]},"reference":[{"key":"9263_CR1","doi-asserted-by":"crossref","unstructured":"T. Joachims, Optimizing search engines using clickthrough data, in The 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2002)","DOI":"10.1145\/775066.775067"},{"key":"9263_CR2","doi-asserted-by":"crossref","unstructured":"Z. Dou, R. Song, X. Yuan, J.-R. Wen, Are click-through data adequate for learning web search rankings?, in The 17th ACM Conference on Information and Knowledge Management (2008)","DOI":"10.1145\/1458082.1458095"},{"issue":"4","key":"9263_CR3","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/j.knosys.2006.08.001","volume":"20","author":"AH Keyhanipour","year":"2007","unstructured":"A.H. Keyhanipour, B. Moshiri, M. Piroozmand, C. Lucas, Aggregation of multiple search engines based on users\u2019 preferences in webfusion. Knowl.-Based Syst. 20(4), 321\u2013328 (2007)","journal-title":"Knowl.-Based Syst."},{"key":"9263_CR4","doi-asserted-by":"crossref","unstructured":"C. Macdonald, I. Ounis, Usefulness of quality click-through data for training, in The 2009 Workshop on Web Search Click Data (2009)","DOI":"10.1145\/1507509.1507521"},{"issue":"5","key":"9263_CR5","doi-asserted-by":"crossref","first-page":"584","DOI":"10.1007\/s10791-012-9209-9","volume":"16","author":"C Macdonald","year":"2013","unstructured":"C. Macdonald, R.L. Santos, I. Ounis, The whens and hows of learning to rank for web search. Inf. Retr. 16(5), 584\u2013628 (2013)","journal-title":"Inf. Retr."},{"key":"9263_CR6","volume-title":"Genetic Programming: On the Programming of Computers by Means of Natural Selection","author":"JR Koza","year":"1992","unstructured":"J.R. Koza, Genetic Programming: On the Programming of Computers by Means of Natural Selection (MIT Press, Cambridge, 1992)"},{"key":"9263_CR7","doi-asserted-by":"crossref","first-page":"2211","DOI":"10.1016\/j.patcog.2007.01.003","volume":"40","author":"J-Y Lin","year":"2007","unstructured":"J.-Y. Lin, H.-R. Ke, B.-C. Chien, W.-P. Yang, Designing a classifier by a layered multi-population genetic programming approach. Pattern Recogn. 40, 2211\u20132225 (2007)","journal-title":"Pattern Recogn."},{"key":"9263_CR8","unstructured":"T. Qin, T.-Y. Liu, J. Xu, H. Li, LETOR: Benchmark dataset for research on learning to rank for information retrieval (Amsterdam, Netherlands, 2007)"},{"key":"9263_CR9","first-page":"1","volume":"14","author":"O Chapelle","year":"2011","unstructured":"O. Chapelle, Y. Chang, Yahoo! learning to rank challenge overview. J. Mach. Learn. Res. 14, 1\u201324 (2011)","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"9263_CR10","first-page":"551","volume":"1","author":"OD Alcantara","year":"2010","unstructured":"O.D. Alcantara, A.R. Pereira Jr, H.M. de Almeida, M.A. Goncalves, C. Middleton, R. Baeza-Yates, WCL2R: a benchmark collection for learning to rank research with clickthrough data. J. Inf. Data Manag. 1(3), 551\u2013566 (2010)","journal-title":"J. Inf. Data Manag."},{"key":"9263_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-14267-3","volume-title":"Learning to Rank for Information Retrieval","author":"T-Y Liu","year":"2011","unstructured":"T.-Y. Liu, Learning to Rank for Information Retrieval (Springer, Berlin, 2011)"},{"key":"9263_CR12","doi-asserted-by":"crossref","unstructured":"D. Cossock, T. Zhang, Subset ranking using regression, in The 19th Annual Conference on Learning Theory (2006)","DOI":"10.1007\/11776420_44"},{"key":"9263_CR13","doi-asserted-by":"crossref","unstructured":"N. Fuhr, Optimum polynomial retrieval functions based on the probability ranking principle. ACM Trans. Inf. Syst. 7(3), 183\u2013204 (1989)","DOI":"10.1145\/65943.65944"},{"key":"9263_CR14","doi-asserted-by":"crossref","unstructured":"W. S. Cooper, F. C. Gey, D. P. Dabney, Probabilistic retrieval based on staged logistic regression, in The 15th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (1992)","DOI":"10.1145\/133160.133199"},{"key":"9263_CR15","doi-asserted-by":"crossref","unstructured":"F. C. Gey, Inferring probability of relevance using the method of logistic regression, in The 17th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (1994)","DOI":"10.1007\/978-1-4471-2099-5_23"},{"key":"9263_CR16","doi-asserted-by":"crossref","unstructured":"R. Nallapati, Discriminative models for information retrieval, in The 27th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (2004)","DOI":"10.1145\/1008992.1009006"},{"key":"9263_CR17","first-page":"1019","volume":"6","author":"W Chu","year":"2005","unstructured":"W. Chu, Z. Ghahramani, Gaussian processes for ordinal regression. J. Mach. Learn. Res. 6, 1019\u20131041 (2005)","journal-title":"J. Mach. Learn. Res."},{"key":"9263_CR18","first-page":"641","volume":"14","author":"K Crammer","year":"2002","unstructured":"K. Crammer, Y. Singer, Pranking with ranking. Adv. Neural Inf. Process. Syst. 14, 641\u2013647 (2002)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"9263_CR19","unstructured":"A. Shashua, A. Levin, Ranking with large margin principles: two approaches. Adv. Neural Inf. Process. Syst. 15, 937\u2013944 (2003)"},{"key":"9263_CR20","first-page":"933","volume":"4","author":"Y Freund","year":"2003","unstructured":"Y. Freund, R. Iyer, R.E. Schapire, Y. Singer, An efficient boosting algorithm for combining preferences. J. Mach. Learn. Res. 4, 933\u2013969 (2003)","journal-title":"J. Mach. Learn. Res."},{"key":"9263_CR21","doi-asserted-by":"crossref","unstructured":"M. F. Tsai, T.-Y. Liu, T. Qin, H.-H. Chen, W.-Y. Ma, Frank: a ranking method with fidelity loss, in The 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (2007)","DOI":"10.1145\/1277741.1277808"},{"key":"9263_CR22","doi-asserted-by":"crossref","unstructured":"Y. Cao, J. Xu, T.-Y. Liu, H. Li, Y. Huang, H.-W. Hon, Adapting ranking SVM to document retrieval, in The 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (2006)","DOI":"10.1145\/1148170.1148205"},{"key":"9263_CR23","unstructured":"L. Rigutini, T. Papini, M. Maggini, F. Scarselli, SortNet: Learning to rank by a neural-based sorting algorithm, in SIGIR 2008 Workshop on Learning to Rank for Information Retrieval (2008)"},{"key":"9263_CR24","unstructured":"E. Renshaw, A. Lazier, C. Burges, T. Shaked, M. Deeds, N. Hamilton, G. Hullender, Learning to rank using gradient descent, in The 22nd International Conference on Machine Learning (2005)"},{"key":"9263_CR25","unstructured":"C. J. Burges, R. Ragno, Q. V. Le, Learning to rank with nonsmooth cost functions. Adv. Neural Inf. Process. Syst. 19, 193\u2013200 (2007)"},{"key":"9263_CR26","doi-asserted-by":"crossref","unstructured":"Y. Ganjisaffar, R. Caruana, C. V. Lopes, Bagging gradient-boosted trees for high precision, low variance ranking models, in The 34th International ACM SIGIR Conference on Research and Development in Information Retrieval (2011)","DOI":"10.1145\/2009916.2009932"},{"key":"9263_CR27","doi-asserted-by":"crossref","unstructured":"M. Taylor, J. Guiver, S. Robertson, T. Minka, Softrank: optimising non-smooth rank metrics, in The 1st International Conference on Web Search and Web Data Mining (2008)","DOI":"10.1145\/1341531.1341544"},{"issue":"3","key":"9263_CR28","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/s10791-009-9110-3","volume":"13","author":"O Chapelle","year":"2010","unstructured":"O. Chapelle, M. Wu, Gradient descent optimization of smoothed information retrieval metrics. Inf. Retr. 13(3), 216\u2013235 (2010)","journal-title":"Inf. Retr."},{"key":"9263_CR29","doi-asserted-by":"crossref","unstructured":"Y. Yue, T. Finley, F. Radlinski, T. Joachims, A support vector method for optimizing average precision, in The 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (2007)","DOI":"10.1145\/1277741.1277790"},{"key":"9263_CR30","doi-asserted-by":"crossref","unstructured":"S. Chakrabarti, R. Khanna, U. Sawant, C. Bhattacharyya, Structured learning for nonsmooth ranking losses, in The 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2008)","DOI":"10.1145\/1401890.1401906"},{"key":"9263_CR31","doi-asserted-by":"crossref","unstructured":"J. Xu, T.-Y. Liu, M. Lu, H. Li, W.-Y. Ma, Directly optimizing IR evaluation measures in learning to rank, in The 31st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (2008)","DOI":"10.1145\/1390334.1390355"},{"key":"9263_CR32","doi-asserted-by":"crossref","unstructured":"J. Xu, H. Li, Adarank: a boosting algorithm for information retrieval, in The 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (2007)","DOI":"10.1145\/1277741.1277809"},{"key":"9263_CR33","unstructured":"J.-Y. Yeh, J.-Y. Lin, H.-R. Ke, W.-P. Yang, Learning to rank for information retrieval using genetic programming, in 2012 IEEE International Conference on Computational Intelligence and Cybernetics (2007)"},{"key":"9263_CR34","doi-asserted-by":"crossref","unstructured":"Z. Cao, T. Qin, T.-Y. Liu, M.-F. Tsai, H. Li, Learning to rank: from pairwise approach to listwise approach, in The 24th International Conference on Machine Learning (2007)","DOI":"10.1145\/1273496.1273513"},{"key":"9263_CR35","unstructured":"J. C. Huang, B. J. Frey, Structured ranking learning using cumulative distribution networks. Adv. Neural Inf. Process. Syst. 21, 697\u2013704 (2009)"},{"key":"9263_CR36","doi-asserted-by":"crossref","unstructured":"M. N. Volkovs, R. S. Zemel, Boltzrank: learning to maximize expected ranking gain, in The 26th International Conference on Machine Learning (2009)","DOI":"10.1145\/1553374.1553513"},{"issue":"2\u20133","key":"9263_CR37","first-page":"309","volume":"7","author":"O Cord\u00f3n","year":"2000","unstructured":"O. Cord\u00f3n, F.D. Moya, C. Zarco, A GA-P algorithm to automatically formulate extended Boolean queries for a fuzzy information retrieval system. Mathw. Soft Comput. 7(2\u20133), 309\u2013322 (2000)","journal-title":"Mathw. Soft Comput."},{"issue":"6","key":"9263_CR38","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1016\/S0306-4573(01)00061-9","volume":"38","author":"C L\u00f3pez-Pujalte","year":"2002","unstructured":"C. L\u00f3pez-Pujalte, V.P. Guerrero Bote, F.D. Moya, A test of genetic algorithms in relevance feedback. Inf. Process. Manag. 38(6), 793\u2013805 (2002)","journal-title":"Inf. Process. Manag."},{"issue":"6","key":"9263_CR39","doi-asserted-by":"crossref","first-page":"1192","DOI":"10.1002\/asi.21060","volume":"60","author":"AG L\u00f3pez-Herrera","year":"2009","unstructured":"A.G. L\u00f3pez-Herrera, E. Herrera-Viedma, F. Herrera, A study of the use of multi-objective evolutionary algorithms to learn Boolean queries: a comparative study. J. Assoc. Inf. Sci. Technol. 60(6), 1192\u20131207 (2009)","journal-title":"J. Assoc. Inf. Sci. Technol."},{"issue":"2","key":"9263_CR40","doi-asserted-by":"crossref","first-page":"919","DOI":"10.1016\/j.amc.2006.07.044","volume":"185","author":"Z Zhu","year":"2007","unstructured":"Z. Zhu, X. Chen, Q. Zhu, Q. Xie, A GA-based query optimization method for web information retrieval. Appl. Math. Comput. 185(2), 919\u2013930 (2007)","journal-title":"Appl. Math. Comput."},{"issue":"6","key":"9263_CR41","doi-asserted-by":"crossref","first-page":"1863","DOI":"10.1016\/j.ipm.2007.12.012","volume":"44","author":"RL Cecchini","year":"2008","unstructured":"R.L. Cecchini, C.M. Lorenzetti, A.G. Maguitman, N.B. Brignole, Using genetic algorithms to evolve a population of topical queries. Inf. Process. Manag. 44(6), 1863\u20131878 (2008)","journal-title":"Inf. Process. Manag."},{"issue":"6","key":"9263_CR42","doi-asserted-by":"crossref","first-page":"1258","DOI":"10.1002\/asi.21320","volume":"61","author":"RL Cecchini","year":"2010","unstructured":"R.L. Cecchini, C.M. Lorenzetti, A.G. Maguitman, N.B. Brignole, Multiobjective evolutionary algorithms for context-based search. J. Am. Soc. Inf. Sci. Technol. 61(6), 1258\u20131274 (2010)","journal-title":"J. Am. Soc. Inf. Sci. Technol."},{"key":"9263_CR43","doi-asserted-by":"crossref","unstructured":"A. H. Keyhanipour, B. Moshiri, Designing a web spam classifier based on feature fusion in the layered multi-population genetic programming framework, in The 16th International Conference on Information Fusion (2013)","DOI":"10.14201\/ADCAIJ2014261527"},{"issue":"4","key":"9263_CR44","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1109\/TKDE.2004.1269663","volume":"16","author":"W Fan","year":"2004","unstructured":"W. Fan, M.D. Gordon, P. Pathak, Discovery of context-specific ranking functions for effective information retrieval using genetic programming. IEEE Trans. Knowl. Data Eng. 16(4), 523\u2013527 (2004)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"4","key":"9263_CR45","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1080\/07421222.2005.11045828","volume":"21","author":"W Fan","year":"2005","unstructured":"W. Fan, M.D. Gordon, P. Pathak, Genetic programming-based discovery of ranking functions for effective web search. J. Manag. Inf. Syst. 21(4), 37\u201356 (2005)","journal-title":"J. Manag. Inf. Syst."},{"issue":"3","key":"9263_CR46","doi-asserted-by":"crossref","first-page":"1338","DOI":"10.1016\/j.dss.2005.11.002","volume":"42","author":"W Fan","year":"2006","unstructured":"W. Fan, P. Pathak, L. Wallace, Nonlinear ranking function representations in genetic programming-based ranking discovery for personalized search. Decis. Support Syst. 42(3), 1338\u20131349 (2006)","journal-title":"Decis. Support Syst."},{"key":"9263_CR47","doi-asserted-by":"crossref","unstructured":"H. M. de Almeida, M. A. Gon\u00e7alves, M. Cristo, P. Calado, A combined component approach for finding collectionadapted ranking functions based on genetic programming, in The 30th annual international ACM SIGIR conference on Research and development in information retrieval (2007)","DOI":"10.1145\/1277741.1277810"},{"key":"9263_CR48","doi-asserted-by":"crossref","unstructured":"F. Wang, X. Xu, AdaGP-Rank: applying boosting technique to genetic programming for learning to rank, in IEEE Youth Conference on Information Computing and Telecommunications (2010)","DOI":"10.1109\/YCICT.2010.5713094"},{"issue":"1","key":"9263_CR49","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1023\/A:1021873026259","volume":"4","author":"F Fern\u00e1ndez","year":"2003","unstructured":"F. Fern\u00e1ndez, M. Tomassini, L. Vanneschi, An empirical study of multipopulation genetic programming. Genet. Program Evolvable Mach. 4(1), 21\u201351 (2003)","journal-title":"Genet. Program Evolvable Mach."},{"key":"9263_CR50","doi-asserted-by":"crossref","first-page":"1384","DOI":"10.1016\/j.eswa.2007.01.006","volume":"34","author":"J-Y Lin","year":"2008","unstructured":"J.-Y. Lin, H.-R. Ke, B.-C. Chien, W.-P. Yang, Classifier design with feature selection and feature extraction using layered genetic programming. Expert Syst. Appl. 34, 1384\u20131393 (2008)","journal-title":"Expert Syst. Appl."},{"key":"9263_CR51","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1016\/j.joi.2008.11.006","volume":"3","author":"AH Keyhanipour","year":"2009","unstructured":"A.H. Keyhanipour, M. Piroozmand, K. Badie, A GP-adaptive web ranking discovery framework based on combinative content and context features. J. Informetr. 3, 78\u201389 (2009)","journal-title":"J. Informetr."},{"key":"9263_CR52","doi-asserted-by":"crossref","unstructured":"S. Wang, J. Ma, J. Liu, Learning to rank using evolutionary computation: immune programming or genetic programming?, in The 18th ACM conference on In-70 formation and knowledge management (2009)","DOI":"10.1145\/1645953.1646254"},{"key":"9263_CR53","doi-asserted-by":"crossref","unstructured":"D. Bollegala, N. Noman, H. Iba, RankDE: learning a ranking function for information retrieval using differential evolution, in The 13th Annual Conference on Genetic and Evolutionary Computation (2011)","DOI":"10.1145\/2001576.2001814"},{"key":"9263_CR54","doi-asserted-by":"crossref","unstructured":"R. Storn, On the usage of differential evolution for function optimization, in 1996 Biennial Conference of the North American Fuzzy Information Processing Society (1996)","DOI":"10.1109\/NAFIPS.1996.534789"},{"issue":"4","key":"9263_CR55","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"R. Storn, K. Price, Differential evolution\u2014a simple and efficient heuristic for global optimization over continuous spaces. J. Glob. Optim. 11(4), 341\u2013359 (1997)","journal-title":"J. Glob. Optim."},{"key":"9263_CR56","doi-asserted-by":"crossref","unstructured":"S. Wang, B. Gao, K. Wang, H. Lauw, CCrank: parallel learning to rank with cooperative coevolution, in The Twenty-Fifth AAAI Conference on Artificial Intelligence (2011)","DOI":"10.1145\/2009916.2010060"},{"key":"9263_CR57","volume-title":"RankGPES: Learning to Rank for Information Retrieval using a Hybrid Genetic Programming with Evolutionary Strategies","author":"MA Islam","year":"2013","unstructured":"M.A. Islam, RankGPES: Learning to Rank for Information Retrieval using a Hybrid Genetic Programming with Evolutionary Strategies (Ryerson University, Toronto, 2013)"},{"key":"9263_CR58","doi-asserted-by":"crossref","unstructured":"E. Agichtein, E. Brill, S. Dumais, Improving web search ranking by incorporating user behavior information, in The International ACM SIGIR Conference on Research & Development of Information Retrieval (2006)","DOI":"10.1145\/1148170.1148177"},{"key":"9263_CR59","doi-asserted-by":"crossref","unstructured":"F. Radlinski, T. Joachims, Query chains: learning to rank from implicit feedback, in The ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2005)","DOI":"10.1145\/1081870.1081899"},{"issue":"8","key":"9263_CR60","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1109\/MC.2007.289","volume":"40","author":"T Joachims","year":"2007","unstructured":"T. Joachims, F. Radlinski, Search engines that learn from implicit feedback. Computer 40(8), 34\u201340 (2007)","journal-title":"Computer"},{"key":"9263_CR61","doi-asserted-by":"crossref","unstructured":"T. Moon, S. Ji, C. Liao, Z. Zheng, User behavior driven ranking without editorial judgments, in The 19th ACM International Conference on Information and Knowledge Management (2010)","DOI":"10.1145\/1871437.1871650"},{"key":"9263_CR62","doi-asserted-by":"crossref","unstructured":"K. Hofmann, S. Whiteson, M. de Rijke, Balancing exploration and exploitation in learning to rank online, in The 33rd European conference on Advances in information retrieval (2011)","DOI":"10.1007\/978-3-642-20161-5_25"},{"key":"9263_CR63","doi-asserted-by":"crossref","unstructured":"N. Liu, J. Yan, D. Shen, D. Chen, Z. Chen, Y. Li, Learning to rank audience for behavioral targeting, in The 33rd International ACM SIGIR Conference on Research and Development in Information Retrieval (2010)","DOI":"10.1145\/1835449.1835582"},{"key":"9263_CR64","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511809071","volume-title":"Introduction to Information Retrieval","author":"CD Manning","year":"2008","unstructured":"C.D. Manning, P. Raghavan, H. Sch\u00fctze, Introduction to Information Retrieval (Cambridge University Press, Cambridge, 2008)"},{"key":"9263_CR65","unstructured":"LETOR4.0 Datasets (2009) [Online]. Available: http:\/\/research.microsoft.com\/en-us\/um\/beijing\/projects\/letor\/letor4dataset.aspx . Accessed 1 March 2015"},{"key":"9263_CR66","unstructured":"TodoCL, TodoCL search engine Website (2004) [Online]. Available: http:\/\/www.todocl.cl . Accessed 1 March 2015"},{"key":"9263_CR67","unstructured":"WCL2R (2010) [Online]. Available: http:\/\/www.latin.dcc.ufmg.br\/collections\/wcl2r . Accessed 1 March 2015"},{"key":"9263_CR68","unstructured":"LETOR4.0\u2019s Features List (2009) [Online]. Available: http:\/\/research.microsoft.com\/en-us\/um\/beijing\/projects\/letor\/LETOR4.0\/Data\/Features_in_LETOR4.pdf . Accessed 1 March 2015"},{"key":"9263_CR69","doi-asserted-by":"crossref","unstructured":"C. Zhai, J. Lafferty, A study of smoothing methods for language models applied to Ad Hoc information retrieval, in The 24th Annual international ACM SIGIR Conference on Research and Development in Information Retrieval (2001)","DOI":"10.1145\/383952.384019"},{"key":"9263_CR70","volume-title":"Rank Correlation Methods","author":"MG Kendall","year":"1948","unstructured":"M.G. Kendall, Rank Correlation Methods (Oxford University Press, London, 1948)"},{"key":"9263_CR71","doi-asserted-by":"crossref","unstructured":"T. Joachims, Training linear SVMs in linear time, in The 12th International Conference on Knowledge Discovery and Data Mining (2006)","DOI":"10.1145\/1150402.1150429"},{"key":"9263_CR72","doi-asserted-by":"crossref","unstructured":"A. A. Veloso, H. M. Almeida, M. A. Gon\u00e7alves, W. J. Meira, Learning to rank at query-time using association rules, in The 31st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (2008)","DOI":"10.1145\/1390334.1390381"},{"key":"9263_CR73","doi-asserted-by":"crossref","unstructured":"L. A. Granka, T. Joachims, G. Gay, Eye-tracking analysis of user behavior in WWW search, in The 27th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (2004)","DOI":"10.1145\/1008992.1009079"},{"key":"9263_CR74","unstructured":"M. Miller, 53% of organic search clicks go to first link, 10 October 2012. [Online]. Available: http:\/\/searchenginewatch.com\/article\/2215868\/53-of-Organic-Search-Clicks-Go-to-First-Link-Study . Accessed 1 March 2015"}],"container-title":["Genetic Programming and Evolvable Machines"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10710-016-9263-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10710-016-9263-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10710-016-9263-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,13]],"date-time":"2024-06-13T21:58:47Z","timestamp":1718315927000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10710-016-9263-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,20]]},"references-count":74,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["9263"],"URL":"https:\/\/doi.org\/10.1007\/s10710-016-9263-y","relation":{},"ISSN":["1389-2576","1573-7632"],"issn-type":[{"type":"print","value":"1389-2576"},{"type":"electronic","value":"1573-7632"}],"subject":[],"published":{"date-parts":[[2016,1,20]]}}}