CoChat
Sign Up
Cited by 398Information Retrieval and Search BehaviorRecommender Systems and TechniquesWeb Data Mining and Analysis

Click Models for Web Search

Chuklin, Aleksandr, Markov, Ilya, de Rijke, Maarten·2015·Synthesis Lectures on Information Concepts, Retrieval, and Services
DOI 10.1007/978-3-031-02294-4
Open this paper in CoChat — free account

Integrity signals

Registry

Crossref · 10.1007/978-3-031-02294-4

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Extracting signal from noisy implicit evidence is the problem that click models and unbiased learning to rank were built for.

    “Extracting signal from noisy implicit evidence is the problem that click models and unbiased learning to rank were built for [17, 31].”

    From Agentic Memory Management Is the Next Frontier of Information Retrieval (2026) · cites this paper as [17]

Cited by

Sorted by citations

Authors
Chuklin, A., Markov, I., & de Rijke, M.
Affiliations
  • Google (Switzerland) (CH)
  • University of Amsterdam (NL)
ORCID
Venue
Synthesis Lectures on Information Concepts, Retrieval, and Services
Publisher
Springer International Publishing
Published
2015
Volume
7
Issue
3
Pages
1-115
ISSN
  • 1947-945X (ISSN-L)
  • 1947-9468
DOI
10.1007/978-3-031-02294-4
OpenAlex
W2402441596
Cited by
398
References
0
Citations by year
2026: 19 · 2025: 22 · 2024: 46 · 2023: 38 · 2022: 31 · 2021: 33 · 2020: 83 · 2019: 31 · 2018: 34 · 2017: 26 · 2016: 31 · 2015: 4
FWCI
39.59
Type
book
Language
en
Open access
closed
Licence
Locations
  • Synthesis lectures on information concepts, retrieval, and services (publishedVersion)
  • UvA-DARE (University of Amsterdam) (publishedVersion)
  • CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
  • Data Archiving and Networked Services (DANS) (submittedVersion)
Topics
  • Physical Sciences › Computer Science › Information Systems › Information Retrieval and Search Behavior
  • Physical Sciences › Computer Science › Information Systems › Recommender Systems and Techniques
  • Physical Sciences › Computer Science › Information Systems › Web Data Mining and Analysis
Keywords
click models, web search, user modeling, click-through data

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review