2000 character limit reached
Recency Ranking by Diversification of Result Set (2401.14595v2)
Published 26 Jan 2024 in cs.IR
Abstract: In this paper, we propose a web search retrieval approach which automatically detects recency sensitive queries and increases the freshness of the ordinary document ranking by a degree proportional to the probability of the need in recent content. We propose to solve the recency ranking problem by using result diversification principles and deal with the query's non-topical ambiguity appearing when the need in recent content can be detected only with uncertainty. Our offline and online experiments with millions of queries from real search engine users demonstrate the significant increase in satisfaction of users presented with a search result generated by our approach.
- Diversifying Search Results. In WSDM’09
- Novelty and Diversity in Information Retrieval Evaluation In SIGIR’09, 2009.
- Towards Recency Ranking in Web Search In WSDM’10, 2010.
- Time is of the Essence: Improving Recency Ranking Using Twitter Data In WWW’10, 2010.
- Sources of Evidence for Vertical Selection. In SIGIR’09, 2009.
- J. Callan. Distributed information retrieval. In W. B. Croft, editor, Advances in Information Retrieval.
- Practical Guide to Controlled Experiments on the Web: Listen to Your Customers not to the HiPPO. In KDD ’07, pages 959–967, 2007.
- Jerome H. Friedman. Greedy function approximation: A gradient boosting machine In Annals of Statistics, 29, pages 1189–1232, 2001.
- Expected reciprocal rank for graded relevance. In Proceedings of the 18th ACM conference on Information and knowledge management, pages 621–630, 2009.
- How Does Clickthrough Data Reflect Retrieval Quality? In CIKM’08, pages 26–30, 2008.
- Andrey Styskin (1 paper)
- Fedor Romanenko (2 papers)
- Fedor Vorobyev (1 paper)
- Pavel Serdyukov (14 papers)