Click-through prediction for news queries
The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
A growing trend in commercial search engines is the display of specialized content such as news, products, etc. interleaved with web search results. Ideally, this content should be displayed only when it is highly relevant to the search query, as it competes for space with "regular" results and advertisements. One measure of the relevance to the search query is the click-through rate the specialized content achieves when displayed; hence, if we can predict this click-through rate accurately, we can use this as the basis for selecting when to show specialized content. In this paper, we consider the problem of estimating the click-through rate for dedicated news search results. For queries for which news results have been displayed repeatedly before, the click-through rate can be tracked online; however, the key challenge for which previously unseen queries to display news results remains. In this paper we propose a supervised model that offers accurate prediction of news click-through rates and satisfies the requirement of adapting quickly to emerging news events.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Learning to rank using gradient descent
Burges, C., Shaked, T., Renshaw, E., Lazier, A., Deeds, M., Hamilton, N., & Hullender, G. (2005) · Proceedings of the 22nd international conference on Machine learning - ICML '05 · doi:10.1145/1102351.1102363 · Cited by 2,836 · cited 1×
“Also, techniques that leverage explicit relevance judgements (e.g., between a query and a given news article), which are obtained either directly (e.g., [4]) or implicitly via user-behavior (e.g., [2, 20]) are problematic in this scenario, because the underlying articles change so quickly.”
BackgroundPredicting clicks: estimating the click-through rate for new ads
Richardson, M., Dominowska, E., & Ragno, R. (2007) · Proceedings of the 16th international conference on World Wide Web · doi:10.1145/1242572.1242643 · Cited by 1,049
Navarro, G., & Mäkinen, V. (2007) · ACM Computing Surveys · doi:10.1145/1216370.1216372 · Cited by 735 · cited 1×
“As was shown in [19], inverted indices that uses a simple (and standard) gap-encoding scheme require space proportional to the size of the compressed text of the underlying corpora, which implies that the index structures required for feature extraction typically require significantly less space…”
Background
Cited by
Survey of Temporal Information Retrieval and Related Applications
Campos, R., Dias, G., Jorge, A. M., & Jatowt, A. (2015) · ACM Computing Surveys · doi:10.1145/2619088 · Cited by 262
“K¨onig et al. [2009], on the other hand, proposed a supervised learning method to estimate the click-through rate for news search results.”
MethodEffective Headlines of Newspaper Articles in a Digital Environment
Kuiken, J., Schuth, A., Spitters, M., & Marx, M. (2017) · Digital Journalism · doi:10.1080/21670811.2017.1279978 · Cited by 254
How fresh do you want your search results?
Cheng, S., Arvanitis, A., & Hristidis, V. (2013) · Proceedings of the 22nd ACM international conference on Information & Knowledge Management · doi:10.1145/2505515.2505696 · Cited by 11
Metadata
- Authors
- König, A. C., Gamon, M., & Wu, Q.
- Venue
- Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval
- Publisher
- ACM
- Published
- 2009-07-19
- Pages
- 347-354
- OpenAlex
- W1975292433
- Cited by
- 65
- References
- 3
- FWCI
- 5.73
- Type
- conference paper
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Click-through prediction for news queries. https://app.cochat.ai/papers/10.1145/1571941.1572002
- The paper
- König, A. C., Gamon, M., & Wu, Q. (2009). Click-through prediction for news queries. Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval. https://doi.org/10.1145/1571941.1572002
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.