The DOI matches its Crossref record; 58 of the 58 references it cites were found in a registry or an index.
Optimizing the recency-relevance-diversity trade-offs in non-personalized news recommendations
Open accessAbstract
Online news media sites are emerging as the primary source of news for a large number of users. Due to a large number of stories being published in these media sites, users usually rely on news recommendation systems to find important news. In this work, we focus on automatically recommending news stories to all users of such media websites, where the selection is not influenced by a particular user’s news reading habit. When recommending news stories in such non-personalized manner, there are three basic metrics of interest—recency, importance (analogous to relevance in personalized recommendation) and diversity of the recommended news. Ideally, recommender systems should recommend the most important stories soon after they are published. However, the importance of a story only becomes evident as the story ages, thereby creating a tension between recency and importance. A systematic analysis of popular recommendation strategies in use today reveals that they lead to poor trade-offs between recency and importance in practice. So, in this paper, we propose a new recommendation strategy (called Highest Future-Impact ) which attempts to optimize on both the axes. To implement our proposed strategy in practice, we propose two approaches to predict the future-impact of news stories, by using crowd-sourced popularity signals and by observing editorial selection in past news data. Finally, we propose approaches to inculcate diversity in recommended news which can maintain a balanced proportion of news from different news sections. Evaluations over real-world news datasets show that our implementations achieve good performance in recommending news stories.
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.
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 source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“The relevance of AI-personalized recommendations is becoming increasingly evident, with their scope gradually extending to encompass diverse recommendation mechanisms [13].”
From The Impact of AI-Personalized Recommendations on Clicking Intentions: Evidence from Chinese E-Commerce (2025) · cites this paper as [13]
Experimental — accuracy not yet measured
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
Greedy function approximation: A gradient boosting machine
Friedman, J. H. (2001) · The Annals of Statistics · doi:10.1214/aos/1013203451 · Cited by 30,731
Classification and Regression Trees.
Ryzin, J. V., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1986) · Journal of the American Statistical Association · doi:10.2307/2288003 · Cited by 20,825
Convolutional Neural Networks for Sentence Classification
Kim, Y. (2014) · Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.3115/v1/d14-1181 · Cited by 14,831
Classification And Regression Trees
Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (2017) · doi:10.1201/9781315139470 · Cited by 11,417
Classification and regression trees
Praagman, J. (1985) · European Journal of Operational Research · doi:10.1016/0377-2217(85)90321-2 · Cited by 10,053
Constrained Optimization and Lagrange Multiplier Methods
(1982) · Elsevier eBooks · doi:10.1016/c2013-0-10366-2 · Cited by 4,016
Combinatorial optimization. Polyhedra and efficiency.
Schrijver, A. (2003) · UvA-DARE (University of Amsterdam) · Cited by 3,045
The Two-Step Flow of Communication: An Up-To-Date Report on an Hypothesis
Katz, E. (1957) · Public Opinion Quarterly · doi:10.1086/266687 · Cited by 1,544
Mass Media Flow and Differential Growth in Knowledge
Tichenor, P. J., Donohue, G. A., & Olien, C. N. (1970) · Public Opinion Quarterly · doi:10.1086/267786 · Cited by 1,537
Deb, K., & Deb, K. (2014) · Search Methodologies · doi:10.1007/978-1-4614-6940-7_15 · Cited by 1,248
Research works printed but not linked: 1
- Novendstern, M. (2011). Why do we read the news? Harvard Political Review. http://harvardpolitics.com/online/hprgument-blog/why-bother-to-read-the-news/ . Accessed Dec 2018.
Cited by
News recommender system: a review of recent progress, challenges, and opportunities
Raza, S., & Ding, C. (2022) · Artificial Intelligence Review · doi:10.1007/s10462-021-10043-x · Cited by 217
A many-objective optimization recommendation algorithm based on knowledge mining
Cai, X., Hu, Z., & Chen, J. (2020) · Information Sciences · doi:10.1016/j.ins.2020.05.067 · Cited by 119
Yin, J., Qiu, X., & Wang, Y. (2025) · Journal of Theoretical and Applied Electronic Commerce Research · doi:10.3390/jtaer20010021 · Cited by 103
“The relevance of AI-personalized recommendations is becoming increasingly evident, with their scope gradually extending to encompass diverse recommendation mechanisms [13].”
Fernandes, E., Moro, S., & Cortez, P. C. (2023) · Expert Systems with Applications · doi:10.1016/j.eswa.2023.119795 · Cited by 52
Where Are the Values? A Systematic Literature Review on News Recommender Systems
Bauer, C., Bagchi, C., Hundogan, O. A., & van Es, K. F. (2024) · ACM Transactions on Recommender Systems · doi:10.1145/3654805 · Cited by 47
Metadata
- Authors
- Chakraborty, A., Ghosh, S., Ganguly, N., & Gummadi, K. P.
- Affiliations
- Indian Institute of Technology Kharagpur (IN)
- Max Planck Institute for Software Systems (DE)
- Corresponding author
- Chakraborty, Abhijnan
- Venue
- Information Retrieval Journal
- Published
- 2019-02-27
- Volume
- 22
- Issue
- 5
- Pages
- 447-475
- ISSN
- 1386-4564 (ISSN-L)
- 1573-7659
- OpenAlex
- W2916827919
- Cited by
- 24
- References
- 58
- Citations by year
- 2026: 2 · 2025: 2 · 2024: 4 · 2023: 4 · 2022: 3 · 2021: 3 · 2020: 4 · 2019: 2
- FWCI
- 3.73
- Type
- journal article
- Language
- en
- Open access
- hybrid
- doi.org
- Licence
- cc-by
- creativecommons.org/licenses/by/4.0 (tdm)
- Locations
- Information Retrieval (publishedVersion, cc-by)
- Greater South Information System
- Funders
- European Commission (HORIZON2020)
- Max-Planck-Gesellschaft
- Horizon 2020 Framework Programme
- Science and Engineering Research Board
- H2020 European Research Council (789373)
- Topics
- Physical Sciences › Computer Science › Information Systems › Recommender Systems and Techniques
- Physical Sciences › Computer Science › Information Systems › Information Retrieval and Search Behavior
- Physical Sciences › Computer Science › Information Systems › Web Data Mining and Analysis
- Keywords
- news recommendation systems, editorial selection, online news
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: Optimizing the recency-relevance-diversity trade-offs in non-personalized news recommendations. https://app.cochat.ai/papers/10.1007/s10791-019-09351-2
- The paper
- Chakraborty, A., Ghosh, S., Ganguly, N., & Gummadi, K. P. (2019). Optimizing the recency-relevance-diversity trade-offs in non-personalized news recommendations. Information Retrieval Journal. https://doi.org/10.1007/s10791-019-09351-2
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.