{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T15:06:01Z","timestamp":1775228761411,"version":"3.50.1"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030602895","type":"print"},{"value":"9783030602901","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-60290-1_4","type":"book-chapter","created":{"date-parts":[[2020,10,13]],"date-time":"2020-10-13T21:02:30Z","timestamp":1602622950000},"page":"45-60","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Debiasing Learning to Rank Models with Generative Adversarial Networks"],"prefix":"10.1007","author":[{"given":"Hui","family":"Cai","sequence":"first","affiliation":[]},{"given":"Chengyu","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Xiaofeng","family":"He","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,10,14]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Ai, Q., Bi, K., Luo, C., Guo, J., Croft, W.B.: Unbiased learning to rank with unbiased propensity estimation. In: SIGIR, pp. 385\u2013394 (2018)","DOI":"10.1145\/3209978.3209986"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Ai, Q., Mao, J., Liu, Y., Croft, W.B.: Unbiased learning to rank: theory and practice. In: CIKM, pp. 2305\u20132306 (2018)","DOI":"10.1145\/3234944.3234980"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1007\/s10994-020-05877-5","volume":"109","author":"J Bekker","year":"2020","unstructured":"Bekker, J., Davis, J.: Learning from positive and unlabeled data: a survey. Mach. Learn. 109, 719\u2013760 (2020)","journal-title":"Mach. Learn."},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Borisov, A., Markov, I., De Rijke, M., Serdyukov, P.: A neural click model for web search. In: WWW, pp. 531\u2013541 (2016)","DOI":"10.1145\/2872427.2883033"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Burges, C., et al.: Learning to rank using gradient descent. In: ICML, pp. 89\u201396 (2005)","DOI":"10.1145\/1102351.1102363"},{"issue":"23\u2013581","key":"4_CR6","first-page":"81","volume":"11","author":"CJ Burges","year":"2010","unstructured":"Burges, C.J.: From ranknet to lambdarank to lambdamart: an overview. Learning 11(23\u2013581), 81 (2010)","journal-title":"Learning"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Cao, Z., Qin, T., Liu, T.Y., Tsai, M.F., Li, H.: Learning to rank: from pairwise approach to listwise approach. In: ICML, pp. 129\u2013136 (2007)","DOI":"10.1145\/1273496.1273513"},{"key":"4_CR8","unstructured":"Chapelle, O., Chang, Y.: Yahoo! learning to rank challenge overview. In: Proceedings of the Learning to Rank Challenge, pp. 1\u201324 (2011)"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Chen, J., Mao, J., Liu, Y., Zhang, M., Ma, S.: TianGong-ST: a new dataset with large-scale refined real-world web search sessions. In: CIKM, pp. 2485\u20132488 (2019)","DOI":"10.1145\/3357384.3358158"},{"issue":"3","key":"4_CR10","first-page":"1","volume":"7","author":"A Chuklin","year":"2015","unstructured":"Chuklin, A., Markov, I., de Rijke, M.: Click models for web search. Synth. Lect. Inf. Concepts Retr. Serv. 7(3), 1\u2013115 (2015)","journal-title":"Synth. Lect. Inf. Concepts Retr. Serv."},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1007\/11776420_44","volume-title":"Learning Theory","author":"D Cossock","year":"2006","unstructured":"Cossock, D., Zhang, T.: Subset ranking using regression. In: Lugosi, G., Simon, H.U. (eds.) COLT 2006. LNCS (LNAI), vol. 4005, pp. 605\u2013619. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11776420_44"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Craswell, N., Zoeter, O., Taylor, M., Ramsey, B.: An experimental comparison of click position-bias models. In: WSDM, pp. 87\u201394 (2008)","DOI":"10.1145\/1341531.1341545"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Dupret, G.E., Piwowarski, B.: A user browsing model to predict search engine click data from past observations. In: SIGIR, pp. 331\u2013338 (2008)","DOI":"10.1145\/1390334.1390392"},{"key":"4_CR14","unstructured":"Goodfellow, I., et al.: Generative adversarial nets. In: NIPS, pp. 2672\u20132680 (2014)"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Hu, Z., Wang, Y., Peng, Q., Li, H.: Unbiased lambdamart: an unbiased pairwise learning-to-rank algorithm. In: WWW, pp. 2830\u20132836 (2019)","DOI":"10.1145\/3308558.3313447"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Joachims, T.: Optimizing search engines using clickthrough data. In: KDD, pp. 133\u2013142 (2002)","DOI":"10.1145\/775047.775067"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Joachims, T., Granka, L., Pan, B., Hembrooke, H., Gay, G.: Accurately interpreting clickthrough data as implicit feedback. In: SIGIR, vol. 51, pp. 4\u201311 (2017)","DOI":"10.1145\/3130332.3130334"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Joachims, T., Swaminathan, A., Schnabel, T.: Unbiased learning-to-rank with biased feedback. In: WSDM, pp. 781\u2013789 (2017)","DOI":"10.1145\/3018661.3018699"},{"issue":"3","key":"4_CR19","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1561\/1500000016","volume":"3","author":"TY Liu","year":"2009","unstructured":"Liu, T.Y.: Learning to rank for information retrieval. Found. Trends Inf. Retr. 3(3), 225\u2013331 (2009)","journal-title":"Found. Trends Inf. Retr."},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Lu, S., Dou, Z., Jun, X., Nie, J.Y., Wen, J.R.: PSGAN: a minimax game for personalized search with limited and noisy click data. In: SIGIR, pp. 555\u2013564 (2019)","DOI":"10.1145\/3331184.3331218"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Oosterhuis, H., Jagerman, R., de Rijke, M.: Unbiased learning to rank: counterfactual and online approaches. In: WWW (Companion Volume), pp. 299\u2013300 (2020)","DOI":"10.1145\/3366424.3383107"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Oosterhuis, H., de Rijke, M.: Differentiable unbiased online learning to rank. In: CIKM, pp. 1293\u20131302 (2018)","DOI":"10.1145\/3269206.3271686"},{"key":"4_CR23","unstructured":"O\u2019Brien, M., Keane, M.T.: Modeling result-list searching in the world wide web: the role of relevance topologies and trust bias. In: Proceedings of the 28th Annual Conference of the Cognitive Science Society, vol. 28, pp. 1881\u20131886. Citeseer (2006)"},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"Richardson, M., Dominowska, E., Ragno, R.: Predicting clicks: estimating the click-through rate for new ads. In: WWW, pp. 521\u2013530 (2007)","DOI":"10.1145\/1242572.1242643"},{"issue":"1","key":"4_CR25","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1093\/biomet\/70.1.41","volume":"70","author":"PR Rosenbaum","year":"1983","unstructured":"Rosenbaum, P.R., Rubin, D.B.: The central role of the propensity score in observational studies for causal effects. Biometrika 70(1), 41\u201355 (1983)","journal-title":"Biometrika"},{"key":"4_CR26","doi-asserted-by":"crossref","unstructured":"Steck, H.: Training and testing of recommender systems on data missing not at random. In: KDD, pp. 713\u2013722 (2010)","DOI":"10.1145\/1835804.1835895"},{"key":"4_CR27","unstructured":"Sutton, R.S., McAllester, D.A., Singh, S.P., Mansour, Y.: Policy gradient methods for reinforcement learning with function approximation. In: NIPS, pp. 1057\u20131063 (2000)"},{"key":"4_CR28","doi-asserted-by":"crossref","unstructured":"Wang, J., et al.: IRGAN: a minimax game for unifying generative and discriminative information retrieval models. In: SIGIR, pp. 515\u2013524 (2017)","DOI":"10.1145\/3077136.3080786"},{"key":"4_CR29","doi-asserted-by":"crossref","unstructured":"Wang, X., Bendersky, M., Metzler, D., Najork, M.: Learning to rank with selection bias in personal search. In: SIGIR, pp. 115\u2013124 (2016)","DOI":"10.1145\/2911451.2911537"},{"key":"4_CR30","doi-asserted-by":"crossref","unstructured":"Wang, X., Golbandi, N., Bendersky, M., Metzler, D., Najork, M.: Position bias estimation for unbiased learning to rank in personal search. In: WSDM, pp. 610\u2013618 (2018)","DOI":"10.1145\/3159652.3159732"},{"key":"4_CR31","doi-asserted-by":"crossref","unstructured":"Yang, L., Cui, Y., Xuan, Y., Wang, C., Belongie, S., Estrin, D.: Unbiased offline recommender evaluation for missing-not-at-random implicit feedback. In: RecSys, pp. 279\u2013287 (2018)","DOI":"10.1145\/3240323.3240355"},{"key":"4_CR32","doi-asserted-by":"crossref","unstructured":"Yue, Y., Joachims, T.: Interactively optimizing information retrieval systems as a dueling bandits problem. In: ICML, pp. 1201\u20131208 (2009)","DOI":"10.1145\/1553374.1553527"},{"key":"4_CR33","doi-asserted-by":"crossref","unstructured":"Yue, Y., Patel, R., Roehrig, H.: Beyond position bias: Examining result attractiveness as a source of presentation bias in clickthrough data. In: WWW, pp. 1011\u20131018 (2010)","DOI":"10.1145\/1772690.1772793"},{"key":"4_CR34","doi-asserted-by":"crossref","unstructured":"Zhai, C., Lafferty, J.: A study of smoothing methods for language models applied to ad hoc information retrieval. In: ACM SIGIR Forum, vol. 51, pp. 268\u2013276. ACM, New York (2017)","DOI":"10.1145\/3130348.3130377"}],"container-title":["Lecture Notes in Computer Science","Web and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-60290-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T12:10:59Z","timestamp":1619266259000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-60290-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030602895","9783030602901"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-60290-1_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"14 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APWeb-WAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asia-Pacific Web (APWeb) and Web-Age Information Management (WAIM) Joint International Conference on Web and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tianjin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apwebwaim2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.tjudb.cn\/apwebwaim2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"259","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"68","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4.6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the COVID-19 pandemic the conference was organized as a fully online conference.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}