{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:18:47Z","timestamp":1750220327425,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T00:00:00Z","timestamp":1650844800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,4,25]]},"DOI":"10.1145\/3485447.3511967","type":"proceedings-article","created":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T05:13:07Z","timestamp":1650863587000},"page":"392-400","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["ParClick: A Scalable Algorithm for EM-based Click Models"],"prefix":"10.1145","author":[{"given":"Pooya","family":"Khandel","sequence":"first","affiliation":[{"name":"University of Amsterdam, Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ilya","family":"Markov","sequence":"additional","affiliation":[{"name":"Independent researcher, Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Yates","sequence":"additional","affiliation":[{"name":"University of Amsterdam, Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ana-Lucia","family":"Varbanescu","sequence":"additional","affiliation":[{"name":"University of Amsterdam, Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,4,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3289600.3291017"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487628"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2872427.2883033"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3209978.3210004"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2009.00698.x"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526711"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2124295.2124351"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3336191.3371819"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Aleksandr Chuklin Ilya Markov and Maarten de Rijke. 2015. Click Models for Web Search. Morgan & Claypool.","DOI":"10.1007\/978-3-031-02294-4"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341545"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449913"},{"volume-title":"Proceedings of the 31st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval(SIGIR \u201908)","author":"E.","key":"e_1_3_2_1_12_1","unstructured":"Georges\u00a0E. Dupret and Benjamin Piwowarski. 2008. A User Browsing Model to Predict Search Engine Click Data from Past Observations.. In Proceedings of the 31st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval(SIGIR \u201908). Association for Computing Machinery, 331\u2013338."},{"volume-title":"Designing and Building Parallel Programs: Concepts and Tools for Parallel Software Engineering","author":"Foster Ian","key":"e_1_3_2_1_13_1","unstructured":"Ian Foster. 1995. Designing and Building Parallel Programs: Concepts and Tools for Parallel Software Engineering. Addison-Wesley Longman Publishing Co., Inc."},{"key":"e_1_3_2_1_14_1","unstructured":"A. Grama V. Kumar A. Gupta and G. Karypis. 2003. Introduction to Parallel Computing. Addison-Wesley."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-24027-5_7"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526712"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1498759.1498818"},{"volume-title":"Unbiased Learning-to-Rank with Biased Feedback(WSDM \u201917)","author":"Joachims Thorsten","key":"e_1_3_2_1_18_1","unstructured":"Thorsten Joachims, Adith Swaminathan, and Tobias Schnabel. 2017. Unbiased Learning-to-Rank with Biased Feedback(WSDM \u201917). Association for Computing Machinery, 781\u2013789."},{"volume-title":"Probabilistic Graphical Models: Principles and Techniques - Adaptive Computation and Machine Learning","author":"Koller Daphne","key":"e_1_3_2_1_19_1","unstructured":"Daphne Koller and Nir Friedman. 2009. Probabilistic Graphical Models: Principles and Techniques - Adaptive Computation and Machine Learning. The MIT Press."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/3157096.3157276"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462895"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557081"},{"volume-title":"Online Expectation-Maximization for Click Models","author":"Markov Ilya","key":"e_1_3_2_1_23_1","unstructured":"Ilya Markov, Alexey Borisov, and Maarten de Rijke. 2017. Online Expectation-Maximization for Click Models. Association for Computing Machinery, 2195\u20132198."},{"volume-title":"A View of the EM Algorithm That Justifies Incremental, Sparse, and Other Variants","author":"Neal M.","key":"e_1_3_2_1_24_1","unstructured":"Radford\u00a0M. Neal and Geoffrey\u00a0E. Hinton. 1999. A View of the EM Algorithm That Justifies Incremental, Sparse, and Other Variants. MIT Press, 355\u2013368."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458092"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2124295.2124396"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2124295.2124336"},{"key":"e_1_3_2_1_28_1","volume-title":"Cascade Model-Based Propensity Estimation for Counterfactual Learning to Rank","author":"Vardasbi Ali","year":"2089","unstructured":"Ali Vardasbi, Maarten de Rijke, and Ilya Markov. 2020. Cascade Model-Based Propensity Estimation for Counterfactual Learning to Rank. Association for Computing Machinery, 2089\u20132092."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488508"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"Xuanhui Wang Nadav Golbandi Michael Bendersky Donald Metzler and Marc Najork. 2018. Position Bias Estimation for Unbiased Learning to Rank in Personal Search. In WSDM. ACM 610\u2013618.","DOI":"10.1145\/3159652.3159732"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3295750.3298920"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020613"}],"event":{"name":"WWW '22: The ACM Web Conference 2022","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"location":"Virtual Event, Lyon France","acronym":"WWW '22"},"container-title":["Proceedings of the ACM Web Conference 2022"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3485447.3511967","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3485447.3511967","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:09Z","timestamp":1750191129000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3485447.3511967"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,25]]},"references-count":32,"alternative-id":["10.1145\/3485447.3511967","10.1145\/3485447"],"URL":"https:\/\/doi.org\/10.1145\/3485447.3511967","relation":{},"subject":[],"published":{"date-parts":[[2022,4,25]]},"assertion":[{"value":"2022-04-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}