{"id":"https://openalex.org/W2163996478","doi":"https://doi.org/10.1145/2433396.2433429","title":"Optimized interleaving for online retrieval evaluation","display_name":"Optimized interleaving for online retrieval evaluation","publication_year":2013,"publication_date":"2013-02-04","ids":{"openalex":"https://openalex.org/W2163996478","doi":"https://doi.org/10.1145/2433396.2433429","mag":"2163996478"},"language":"en","primary_location":{"id":"doi:10.1145/2433396.2433429","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2433396.2433429","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the sixth ACM international conference on Web search and data mining","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5081692910","display_name":"Filip Radlinski","orcid":"https://orcid.org/0000-0002-1386-9288"},"institutions":[{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Filip Radlinski","raw_affiliation_strings":["Microsoft, Cambridge, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft, Cambridge, United Kingdom","institution_ids":["https://openalex.org/I4210164937"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055132321","display_name":"Nick Craswell","orcid":"https://orcid.org/0000-0002-9351-8137"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]},{"id":"https://openalex.org/I4210108985","display_name":"Bellevue Hospital Center","ror":"https://ror.org/01ky34z31","country_code":"US","type":"healthcare","lineage":["https://openalex.org/I1283621791","https://openalex.org/I4210086933","https://openalex.org/I4210108985"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nick Craswell","raw_affiliation_strings":["Microsoft, Bellevue, WA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft, Bellevue, WA, USA","institution_ids":["https://openalex.org/I1290206253","https://openalex.org/I4210108985"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":105,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"245","last_page":"254"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10286","display_name":"Information Retrieval and Search Behavior","score":0.9977999925613403,"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"}},"topics":[{"id":"https://openalex.org/T10286","display_name":"Information Retrieval and Search Behavior","score":0.9977999925613403,"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/T10203","display_name":"Recommender Systems and Techniques","score":0.9944999814033508,"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/T13274","display_name":"Expert finding and Q&A systems","score":0.9937000274658203,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/interleaving","display_name":"Interleaving","score":0.9844406843185425},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.77777099609375},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.595621645450592},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.543463408946991},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47127053141593933},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.4254697859287262},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38761472702026367},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.3489091992378235}],"concepts":[{"id":"https://openalex.org/C28034677","wikidata":"https://www.wikidata.org/wiki/Q17092530","display_name":"Interleaving","level":2,"score":0.9844406843185425},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.77777099609375},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.595621645450592},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.543463408946991},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47127053141593933},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4254697859287262},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38761472702026367},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3489091992378235},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2433396.2433429","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2433396.2433429","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the sixth ACM international conference on Web search and data mining","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W103521101","https://openalex.org/W1532325895","https://openalex.org/W1982530130","https://openalex.org/W2011285051","https://openalex.org/W2041576073","https://openalex.org/W2047221353","https://openalex.org/W2061503185","https://openalex.org/W2069997576","https://openalex.org/W2094790959","https://openalex.org/W2108415592","https://openalex.org/W2120889650","https://openalex.org/W2138909795","https://openalex.org/W2156541733","https://openalex.org/W2160471965","https://openalex.org/W2197919320","https://openalex.org/W2407295445","https://openalex.org/W4230624213"],"related_works":["https://openalex.org/W1655266410","https://openalex.org/W2389051085","https://openalex.org/W2330343234","https://openalex.org/W1901012776","https://openalex.org/W1991298643","https://openalex.org/W2353718002","https://openalex.org/W2393269950","https://openalex.org/W2132971779","https://openalex.org/W2152844235","https://openalex.org/W2376454312"],"abstract_inverted_index":{"Interleaving":[0],"is":[1],"an":[2,66,76,106],"online":[3],"evaluation":[4],"technique":[5],"for":[6,61],"comparing":[7],"the":[8,73,86,89],"relative":[9],"quality":[10],"of":[11,25,58,88,122],"information":[12],"retrieval":[13],"functions":[14],"by":[15],"combining":[16],"their":[17],"result":[18],"lists":[19],"and":[20,45,108],"tracking":[21],"clicks.":[22],"A":[23],"sequence":[24],"such":[26],"algorithms":[27],"have":[28],"been":[29],"proposed,":[30],"each":[31],"being":[32],"shown":[33],"to":[34,75,105],"address":[35],"problems":[36],"in":[37],"earlier":[38],"algorithms.":[39],"In":[40],"this":[41,47],"paper,":[42],"we":[43,99],"formalize":[44],"generalize":[46],"process,":[48],"while":[49],"introducing":[50],"a":[51,56,118],"formal":[52],"model:":[53],"We":[54],"identify":[55],"set":[57],"desirable":[59],"properties":[60],"interleaving,":[62],"then":[63],"show":[64,100],"that":[65,101],"interleaving":[67,111],"algorithm":[68,112],"can":[69],"be":[70],"obtained":[71],"as":[72,91,93],"solution":[74],"optimization":[77],"problem":[78],"within":[79],"those":[80],"constraints.":[81],"Our":[82],"approach":[83,103],"makes":[84],"explicit":[85],"parameters":[87],"algorithm,":[90],"well":[92],"assumptions":[94],"about":[95],"user":[96,123],"behavior.":[97,125],"Further,":[98],"our":[102],"leads":[104],"unbiased":[107],"more":[109],"efficient":[110],"than":[113],"any":[114],"previous":[115],"approach,":[116],"using":[117],"novel":[119],"log-based":[120],"analysis":[121],"search":[124]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":35},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":14},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":5}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}