In web search, recency ranking refers to ranking documents by relevance which takes freshness into account. In this paper, we propose a retrieval system which automatically detects and responds to recency sensitive queries. The system detects recency sensitive queries using a high precision classifier. The system responds to recency sensitive queries by using a machine learned ranking model trained for such queries. We use multiple recency features to provide temporal evidence which effectively represents document recency. Furthermore, we propose several training methodologies important for training recency sensitive rankers. Finally, we develop new evaluation metrics for recency sensitive queries. Our experiments demonstrate the efficacy of the proposed approaches.
bibtex
Copied!
@inproceedings{dong:y-recency,
year = {2010},
title = {Towards recency ranking in web search},
publisher = {ACM},
pages = {11--20},
location = {New York, New York, USA},
isbn = {978-1-60558-889-6},
doi = {http://doi.acm.org/10.1145/1718487.1718490},
booktitle = {WSDM '10: Proceedings of the third ACM international conference on Web search and data mining},
author = {Dong, Anlei and Chang, Yi and Zheng, Zhaohui and Mishne, Gilad and Bai, Jing and Zhang, Ruiqiang and Buchner, Karolina and Liao, Ciya and Diaz, Fernando},
address = {New York, NY, USA}
}