{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:13:53Z","timestamp":1743077633159,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031506833"},{"type":"electronic","value":"9783031506840"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-50684-0_18","type":"book-chapter","created":{"date-parts":[[2024,4,15]],"date-time":"2024-04-15T10:02:09Z","timestamp":1713175329000},"page":"232-245","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["MassiveClicks: A Massively-Parallel Framework for\u00a0Efficient Click Models Training"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-1267-3708","authenticated-orcid":false,"given":"Skip","family":"Thijssen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pooya","family":"Khandel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5970-880X","authenticated-orcid":false,"given":"Andrew","family":"Yates","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4932-1900","authenticated-orcid":false,"given":"Ana-Lucia","family":"Varbanescu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,4,16]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, A., et al.: Estimating position bias without intrusive interventions. In: WSDM\u201919, pp. 474\u2013482 (2019)","DOI":"10.1145\/3289600.3291017"},{"key":"18_CR2","doi-asserted-by":"publisher","unstructured":"Augonnet, C., et al.: StarPU: a unified platform for task scheduling on heterogeneous multicore architectures. In: CCPE Special Issue: Euro-Par 2009 23, 2 February 2011, pp. 187\u2013198. https:\/\/doi.org\/10.1002\/cpe.1631","DOI":"10.1002\/cpe.1631"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Borisov, A., et al.: A neural click model for web search. In: WWW \u201916, pp. 531\u2013541 (2016)","DOI":"10.1145\/2872427.2883033"},{"key":"18_CR4","doi-asserted-by":"publisher","unstructured":"Bosilca, G., et al.: PaRSEC: exploiting heterogeneity to enhance scalability. Comput. Sci. Eng. 15(6), 36\u201345 (2013). https:\/\/doi.org\/10.1109\/MCSE.2013.98","DOI":"10.1109\/MCSE.2013.98"},{"key":"18_CR5","doi-asserted-by":"publisher","unstructured":"Bueno, J., et al.: Productive programming of gpu clusters with OmpSs. In: IEEE IPDPS\u201912, pp. 557\u2013568 (2012). https:\/\/doi.org\/10.1109\/IPDPS.2012.58","DOI":"10.1109\/IPDPS.2012.58"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Chapelle, O., Zhang, Y.: A dynamic Bayesian network click model for web search ranking. In: ACM WWW \u201909, pp. 1\u201310. Association for Computing Machinery (2009)","DOI":"10.1145\/1526709.1526711"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Chuklin, A., et al.: Click Models for Web Search. Morgan & Claypool, San Rafael (2015)","DOI":"10.1007\/978-3-031-02294-4"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Craswell, N., et al.: An experimental comparison of click position-bias models. In: ACM WSDM \u201908, pp. 87\u201394 (2008)","DOI":"10.1145\/1341531.1341545"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Dupret, G.E., Piwowarski, B.: A user browsing model to predict search engine click data from past observations. In: ACM SIGIR \u201908, pp. 331\u2013338 (2008)","DOI":"10.1145\/1390334.1390392"},{"key":"18_CR10","doi-asserted-by":"publisher","unstructured":"Fang, J., et al.: Parallel programming models for heterogeneous many-cores: a comprehensive survey. CCF Trans. High Perform. Comput. 2(4), 382\u2013400 (2020). issn 2524-4930. https:\/\/doi.org\/10.1007\/s42514-020-00039-4","DOI":"10.1007\/s42514-020-00039-4"},{"key":"18_CR11","unstructured":"Fraunhofer SCAI: LAMA - development of fast and scalable software. https:\/\/www.scai.fraunhofer.de\/en\/business-research-areas\/high-performance-computing\/products\/lama.html"},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-319-24027-5_7","volume-title":"Experimental IR Meets Multilinguality, Multimodality, and Interaction","author":"A Grotov","year":"2015","unstructured":"Grotov, A., Chuklin, A., Markov, I., Stout, L., Xumara, F., de Rijke, M.: A comparative study of click models for web search. In: Mothe, J., et al. (eds.) CLEF 2015. LNCS, vol. 9283, pp. 78\u201390. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24027-5_7"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Guo, F., et al.: Click chain model in web search. In: ACM WWW\u201909, pp. 11\u201320 (2009)","DOI":"10.1145\/1526709.1526712"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Joachims, T., et al.: Unbiased learning-to-rank with biased feedback. In: ACM WSDM \u201917, pp. 781\u2013789 (2017)","DOI":"10.1145\/3018661.3018699"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Jones, N., et al.: How to stop data centres from gobbling up the world\u2019s electricity. Nature 561(7722), 163\u2013166 (2018)","DOI":"10.1038\/d41586-018-06610-y"},{"key":"18_CR16","doi-asserted-by":"publisher","unstructured":"Khandel, P., et al.: ParClick: a scalable algorithm for EM-based click models. In: ACM Web 2022.WWW\u201922, pp. 392\u2013400. Virtual Event, Lyon, France: ACM (2022). isbn 9781450390965. https:\/\/doi.org\/10.1145\/3485447.3511967","DOI":"10.1145\/3485447.3511967"},{"key":"18_CR17","doi-asserted-by":"publisher","unstructured":"Kim, J., et al.: IRIS: a portable runtime system exploiting multiple heterogeneous programming systems. In: IEEE HPEC\u201921, pp. 1\u20138 (2021). https:\/\/doi.org\/10.1109\/HPEC49654.2021.9622873","DOI":"10.1109\/HPEC49654.2021.9622873"},{"key":"18_CR18","unstructured":"Koller, D., Friedman, N.: Probabilistic Graphical Models: Principles and Techniques - Adaptive Computation and Machine Learning. The MIT Press, Cambridge (2009)"},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"Lin, J., et al.: A graph-enhanced click model for web search. In: ACM SIGIR \u201921, pp. 1259\u20131268. New York, NY, USA (2021)","DOI":"10.1145\/3404835.3462895"},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Liu, C., et al.: BBM: Bayesian browsing model from petabyte-scale data. In: ACM KDD\u201909, pp. 537\u2013546. Paris, France (2009)","DOI":"10.1145\/1557019.1557081"},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Radlinski, F., et al.: How does clickthrough data reflect retrieval quality? In: ACM CIKM\u201908, pp. 43\u201352. New York, NY, USA: ACM (2008)","DOI":"10.1145\/1458082.1458092"},{"key":"18_CR22","doi-asserted-by":"crossref","unstructured":"Vardasbi, A., et al.: Cascade model-based propensity estimation for counterfactual learning to rank. In: ACM SIGIR\u201920, pp. 2089\u20132092. Association for Computing Machinery (2020)","DOI":"10.1145\/3397271.3401299"},{"key":"18_CR23","doi-asserted-by":"crossref","unstructured":"Wang, X., et al.: Position bias estimation for unbiased learning to rank in personal search. In: ACM WSDM\u201918, pp. 610\u2013618 (2018)","DOI":"10.1145\/3159652.3159732"},{"key":"18_CR24","doi-asserted-by":"crossref","unstructured":"Yu, H.-T., et al.: A rank-biased neural network model for click modeling. In: CHIIR \u201919 (2019)","DOI":"10.1145\/3295750.3298920"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2023: Parallel Processing Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-50684-0_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,7]],"date-time":"2024-05-07T17:03:55Z","timestamp":1715101435000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-50684-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031506833","9783031506840"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-50684-0_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"16 April 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Euro-Par","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Limassol","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cyprus","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"europar2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2023.euro-par.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"164","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":"49","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":"0","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":"30% - 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.98","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","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}