The DOI matches its Crossref record.
Recency ranking by diversification of result set
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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?
The cited source says what the claim attributes to it.
In the citing paper
“[Styskin et al. 2011] who relied on a recencysensitive query classifier to apply result diversification by combining ordinary search results with fresh documents.”
From Survey of Temporal Information Retrieval and Related Applications (2015) · cites this paper as Styskin et al. 2011
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
No references could be resolved yet.
Research works printed but not linked: 9
- 10.1145/1498759.1498766 · DOI
- 10.1145/1390334.1390446 · DOI
- 10.1145/1718487.1718490 · DOI
- 10.1145/1772690.1772725 · DOI
- 10.1145/1571941.1571997 · DOI
- 10.1145/1281192.1281295 · DOI
- Jerome H. Friedman. Greedy function approximation: A gradient boosting machine In Annals of Statistics 29 pages 1189--1232 2001. Jerome H. Friedman. Greedy function approximation: A gradient boosting machine In Annals of Statistics 29 pages 1189--1232 2001. · DOI · Paper page
- 10.1145/1645953.1646033 · DOI
- 10.1145/1458082.1458092 · DOI
Cited by
Sorted by citations
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
Metadata
- Authors
- Styskin, A., Romanenko, F., Vorobyev, F., & Serdyukov, P.
- Affiliations
- Yandex, Moscow, Russian Fed.
- Venue
- Proceedings of the 20th ACM international conference on Information and knowledge management
- Publisher
- ACM
- Published
- 2011-10-24
- Pages
- 1949-1952
- Cited by
- 14
- References
- 0
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
