{"id":"https://openalex.org/W4224314529","doi":"https://doi.org/10.1145/3485447.3511967","title":"ParClick: A Scalable Algorithm for EM-based Click Models","display_name":"ParClick: A Scalable Algorithm for EM-based Click Models","publication_year":2022,"publication_date":"2022-04-25","ids":{"openalex":"https://openalex.org/W4224314529","doi":"https://doi.org/10.1145/3485447.3511967"},"language":"en","primary_location":{"id":"doi:10.1145/3485447.3511967","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3485447.3511967","pdf_url":null,"source":{"id":"https://openalex.org/S4363608783","display_name":"Proceedings of the ACM Web Conference 2022","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM Web Conference 2022","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://handle.uba.uva.nl/personal/pure/en/publications/parclick-a-scalable-algorithm-for-embased-click-models(1ff8374d-3fa4-454e-9f4f-aa04f88229b4).html","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5040368729","display_name":"Pooya Khandel","orcid":"https://orcid.org/0000-0001-5197-2983"},"institutions":[{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Pooya Khandel","raw_affiliation_strings":["University of Amsterdam, Netherlands"],"affiliations":[{"raw_affiliation_string":"University of Amsterdam, Netherlands","institution_ids":["https://openalex.org/I887064364"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103028673","display_name":"Ilya Markov","orcid":"https://orcid.org/0000-0001-9221-3043"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ilya Markov","raw_affiliation_strings":["Independent researcher, Netherlands"],"affiliations":[{"raw_affiliation_string":"Independent researcher, Netherlands","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059489981","display_name":"Andrew Yates","orcid":"https://orcid.org/0000-0002-5970-880X"},"institutions":[{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Andrew Yates","raw_affiliation_strings":["University of Amsterdam, Netherlands"],"affiliations":[{"raw_affiliation_string":"University of Amsterdam, Netherlands","institution_ids":["https://openalex.org/I887064364"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087297053","display_name":"Ana-Lucia Varbanescu","orcid":"https://orcid.org/0000-0002-4932-1900"},"institutions":[{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Ana-Lucia Varbanescu","raw_affiliation_strings":["University of Amsterdam, Netherlands"],"affiliations":[{"raw_affiliation_string":"University of Amsterdam, Netherlands","institution_ids":["https://openalex.org/I887064364"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5040368729"],"corresponding_institution_ids":["https://openalex.org/I887064364"],"apc_list":null,"apc_paid":null,"fwci":0.1796,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.47991483,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"392","last_page":"400"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10203","display_name":"Recommender Systems and Techniques","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9932000041007996,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.8743787407875061},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8742220401763916},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.5591630935668945},{"id":"https://openalex.org/keywords/click-through-rate","display_name":"Click-through rate","score":0.528385579586029},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.48279058933258057},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.4676477611064911},{"id":"https://openalex.org/keywords/aggregate","display_name":"Aggregate (composite)","score":0.44511353969573975},{"id":"https://openalex.org/keywords/relevance","display_name":"Relevance (law)","score":0.4252418279647827},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3727818727493286},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36929354071617126},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.32659077644348145},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32297250628471375},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.15906977653503418},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.14553087949752808},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.14048686623573303},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.09148293733596802}],"concepts":[{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.8743787407875061},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8742220401763916},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.5591630935668945},{"id":"https://openalex.org/C115174607","wikidata":"https://www.wikidata.org/wiki/Q1100934","display_name":"Click-through rate","level":2,"score":0.528385579586029},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.48279058933258057},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.4676477611064911},{"id":"https://openalex.org/C4679612","wikidata":"https://www.wikidata.org/wiki/Q866298","display_name":"Aggregate (composite)","level":2,"score":0.44511353969573975},{"id":"https://openalex.org/C158154518","wikidata":"https://www.wikidata.org/wiki/Q7310970","display_name":"Relevance (law)","level":2,"score":0.4252418279647827},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3727818727493286},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36929354071617126},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.32659077644348145},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32297250628471375},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.15906977653503418},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.14553087949752808},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.14048686623573303},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.09148293733596802},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/3485447.3511967","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3485447.3511967","pdf_url":null,"source":{"id":"https://openalex.org/S4363608783","display_name":"Proceedings of the ACM Web Conference 2022","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM Web Conference 2022","raw_type":"proceedings-article"},{"id":"pmh:oai:dare.uva.nl:openaire_cris_publications/1ff8374d-3fa4-454e-9f4f-aa04f88229b4","is_oa":true,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/parclick-a-scalable-algorithm-for-embased-click-models(1ff8374d-3fa4-454e-9f4f-aa04f88229b4).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Khandel, P, Markov, I, Yates, A & Varbanescu, A-L 2022, ParClick: A Scalable Algorithm for EM-based Click Models. in WWW'22 : proceedings of the ACM Web Conference 2022 : April 25-29, 2022, VIrtual Event, Lyon, France. Association for Computing Machinery, New York, NY, pp. 392-400, ACM Web Conference, 25/04/22. https://doi.org/10.1145/3485447.3511967","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:dare.uva.nl:publications/1ff8374d-3fa4-454e-9f4f-aa04f88229b4","is_oa":true,"landing_page_url":"https://hdl.handle.net/11245.1/1ff8374d-3fa4-454e-9f4f-aa04f88229b4","pdf_url":"https://pure.uva.nl/ws/files/128571188/3485447.3511967.pdf","source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Khandel, P, Markov, I, Yates, A & Varbanescu, A-L 2022, ParClick: A Scalable Algorithm for EM-based Click Models. in WWW'22 : proceedings of the ACM Web Conference 2022 : April 25-29, 2022, VIrtual Event, Lyon, France. Association for Computing Machinery, New York, NY, pp. 392-400, ACM Web Conference, 25/04/22. https://doi.org/10.1145/3485447.3511967","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:uvapub:oai:dare.uva.nl:openaire_cris_publications/1ff8374d-3fa4-454e-9f4f-aa04f88229b4","is_oa":true,"landing_page_url":"https://dare.uva.nl/personal/pure/en/publications/parclick-a-scalable-algorithm-for-embased-click-models(1ff8374d-3fa4-454e-9f4f-aa04f88229b4).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"WWW'22: proceedings of the ACM Web Conference 2022 : April 25-29, 2022, VIrtual Event, Lyon, France, 392 - 400","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":{"id":"pmh:oai:dare.uva.nl:openaire_cris_publications/1ff8374d-3fa4-454e-9f4f-aa04f88229b4","is_oa":true,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/parclick-a-scalable-algorithm-for-embased-click-models(1ff8374d-3fa4-454e-9f4f-aa04f88229b4).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Khandel, P, Markov, I, Yates, A & Varbanescu, A-L 2022, ParClick: A Scalable Algorithm for EM-based Click Models. in WWW'22 : proceedings of the ACM Web Conference 2022 : April 25-29, 2022, VIrtual Event, Lyon, France. Association for Computing Machinery, New York, NY, pp. 392-400, ACM Web Conference, 25/04/22. https://doi.org/10.1145/3485447.3511967","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W114565888","https://openalex.org/W1580684925","https://openalex.org/W1686266550","https://openalex.org/W1804792716","https://openalex.org/W1992549066","https://openalex.org/W2035590009","https://openalex.org/W2083730062","https://openalex.org/W2094790959","https://openalex.org/W2099213975","https://openalex.org/W2106630408","https://openalex.org/W2116505464","https://openalex.org/W2135114864","https://openalex.org/W2151153134","https://openalex.org/W2154739689","https://openalex.org/W2166693285","https://openalex.org/W2170051049","https://openalex.org/W2339829457","https://openalex.org/W2567948266","https://openalex.org/W2767972677","https://openalex.org/W2769473018","https://openalex.org/W2798492560","https://openalex.org/W2905569957","https://openalex.org/W2921870143","https://openalex.org/W2997919341","https://openalex.org/W3099404779","https://openalex.org/W3153413682","https://openalex.org/W3155333579","https://openalex.org/W3156055390","https://openalex.org/W4302322961"],"related_works":["https://openalex.org/W2485872624","https://openalex.org/W3161249280","https://openalex.org/W2267059662","https://openalex.org/W2364268683","https://openalex.org/W2023578311","https://openalex.org/W4388411807","https://openalex.org/W1519906715","https://openalex.org/W4286419063","https://openalex.org/W2478803962","https://openalex.org/W2011720192"],"abstract_inverted_index":{"Research":[0],"on":[1,6,123,129],"click":[2,24,41,68,80,89],"models":[3,25,42],"usually":[4],"focuses":[5],"developing":[7],"effective":[8],"approaches":[9],"to":[10,105,157,168],"reduce":[11,106],"biases":[12],"in":[13,182],"user":[14,88],"clicks.":[15],"However,":[16],"one":[17],"of":[18,22,29,38,66,77,116,144,173],"the":[19,27,36,53,83,117,130,142,169,174],"major":[20],"drawbacks":[21],"existing":[23],"is":[26,153],"lack":[28],"scalability.":[30],"In":[31,150],"this":[32,58,78],"work,":[33],"we":[34,60,71,86,110],"tackle":[35],"scalability":[37],"Expectation-Maximization":[39],"(EM)-based":[40],"by":[43,51],"introducing":[44],"ParClick,":[45],"a":[46,63,112,124],"new":[47],"parallel":[48,75,114],"algorithm":[49],"designed":[50],"following":[52,82],"Partitioning-Communication-Aggregation-Mapping":[54],"(PCAM)":[55],"method.":[56],"To":[57],"end,":[59],"first":[61],"provide":[62,111],"generic":[64,79],"formulation":[65],"EM-based":[67],"models.":[69],"Then,":[70],"design":[72],"an":[73],"efficient":[74],"version":[76,172],"model":[81,92],"PCAM":[84],"approach:":[85],"partition":[87],"logs":[90],"and":[91,101,147,164],"parameters":[93],"into":[94],"separate":[95],"tasks,":[96],"analyze":[97],"communication":[98,107],"among":[99],"them,":[100],"aggregate":[102],"these":[103],"tasks":[104],"overhead.":[108],"Finally,":[109],"scalable,":[113],"implementation":[115],"proposed":[118],"design,":[119],"which":[120],"maps":[121],"well":[122,139],"multi-core":[125],"machine.":[126],"Our":[127],"experiments":[128],"Yandex":[131],"relevance":[132],"prediction":[133],"dataset":[134],"show":[135],"that":[136],"ParClick":[137,152],"scales":[138],"when":[140],"increasing":[141],"amount":[143],"training":[145],"data":[146],"computational":[148],"resources.":[149],"particular,":[151],"24.7":[154],"times":[155],"faster":[156],"train":[158],"with":[159],"40":[160,165],"million":[161],"search":[162],"sessions":[163],"threads":[166],"compared":[167],"standard":[170],"sequential":[171],"Click":[175],"Chain":[176],"Model":[177],"(CCM)":[178],"without":[179],"any":[180],"degradation":[181],"effectiveness.":[183]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1}],"updated_date":"2026-03-17T09:09:15.849793","created_date":"2025-10-10T00:00:00"}