Anlei Dong
ABSTRACT
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.
- I. Arikan, S. Bedathur, and K. Berberich. Time will tell: Leveraging temporal expressions in ir. WSDM, 2009.Google Scholar
- R. Baeza-Yates, F. Saint-Jean, and C. Castillo. Web dynamics, age and page qualit. String Processing and Information Retrieval, pages 453--461, 2002.Google ScholarCross Ref
- K. Berberich, M. Vazirgiannis, and G. Weikum. Time-aware authority rankings. Internet Math, 2(3):301--332, 2005.Google ScholarCross Ref
- C. Burges, T. Shaked, E. Renshaw, A. Lazier, M. Deeds, N. Hamilton, and G. Hullender. Learning to rank using gradient descent.Google Scholar
- Z. Cao, T. Qin, T. Liu, M. Tsai, and H. Li. Learning to rank: From pairwise approach to listwise. Proceedings of ICML conference, 2007. Google ScholarDigital Library
- J. Cho, S. Roy, and R. Adams. Page quality: In search of an unbiased web ranking. Proc. of ACM SIGMOD Conference, 2005. Google ScholarDigital Library
- G.M. Del Corso, A. Gulli, and F. Romani. Ranking a stream of news. Proc. of WWW Conference, 2005. Google ScholarDigital Library
- F. Diaz. Integration of news content into web results. Proceedings of the Second ACM International Conference on Web Search and Data Mining (WSDM), pages 182--191, 2009. Google ScholarDigital Library
- Y. Freund, R.D. Iyer, R.E. Schapire, and Y. Singer. An efficient boosting algorithm for combining preferences. Proceedings of International Conference on Machine Learning, 1998. Google ScholarDigital Library
- J. Friedman. Greedy function approximation: a gradient boosting machine. Ann. Statist., 29:1189--1232, 2001.Google ScholarCross Ref
- K. Jarvelin and J. Kekalainen. Cumulated gain-based evaluation of ir techniques. ACM Transactions on Information Systems, 20:422--446, 2002. Google ScholarDigital Library
- T. Joachims. Optimizing search engines using clickthrough data. In Proceedings of the ACM Conference on Knowledge Discovery and Data Mining (KDD), 2002. Google ScholarDigital Library
- J. Kleinberg. Bursty and hierarchical structure in streams. In KDD, pages 91--101, 2002. Google ScholarDigital Library
- A.C. König, M. Gamon, and Q. Wu. Click-through prediction for news queries. Proc. of SIGIR, pages 347--354, 2009. Google ScholarDigital Library
- X. Li, B. Liu, and P. Yu. Time sensitive ranking with application to publication search. Proceedings of Eighth IEEE International Conference on Data Mining, pages 893--898, 2008. Google ScholarDigital Library
- T.Y. Liu. Learning to rank for information retrieval. Tutorial on WWW conference, 2009.Google ScholarDigital Library
- S. Nunes. Exploring temporal evidence in web information retrieval. BCS IRSG Symposium: Future Directions in Information Access, 2007. Google ScholarDigital Library
- S. Pandey, S. Roy, C. Olston, J. Cho, and S. Chakrabarti. Shuffling a stacked deck: The case for partially randomized ranking of search engine results. VLDB, 2005. Google ScholarDigital Library
- M. Pasca. Towards temporal web search. ACM SAC, 2008. Google ScholarDigital Library
- M. Vlachos, C. Meek, Z. Vagena, and D. Gunopulos. Identifying similarities, periodicities and bursts for online search queries. In SIGMOD, pages 131--142, 2004. Google ScholarDigital Library
- X. Wang and C. Zhai. Learn from web search logs to organize search results. In Proceedings of the 30th ACM SIGIR, 2007. Google ScholarDigital Library
- R. Zhang, Y. Chang, Z. Zheng, D. Metzler, and J. Nie. Search result re-ranking by feedback control adjustment for time-sensitive query. North American Chapter of the Association for Computational Linguistics -- Human Language Technologies (NAACL HLT), 2009. Google ScholarDigital Library
- Z. Zheng, H. Zhang, T. Zhang, O. Chapelle, K. Chen, and G. Sun. A general boosting method and its application to learning ranking functions for web search. NIPS, 2007.Google Scholar
Index Terms
- Towards recency ranking in web search
Recommendations
Improving recency ranking using twitter data
Special section on twitter and microblogging services, social recommender systems, and CAMRa2010: Movie recommendation in contextIn Web search and vertical search, recency ranking refers to retrieving and ranking documents by both relevance and freshness. As impoverished in-links and click information is the the biggest challenge for recency ranking, we advocate the use of ...
Recency ranking by diversification of result set
CIKM '11: Proceedings of the 20th ACM international conference on Information and knowledge managementIn 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 ...
Online learning for recency search ranking using real-time user feedback
CIKM '10: Proceedings of the 19th ACM international conference on Information and knowledge managementTraditional machine-learned ranking algorithms for web search are trained in batch mode, which assume static relevance of documents for a given query. Although such a batch-learning framework has been tremendously successful in commercial search engines,...
Comments