Computer Science – Information Retrieval
Scientific paper
2011-03-19
Computer Science
Information Retrieval
22 pages, 9 figures, 1 table. A preliminary and shorter version presented at CIKM-2010
Scientific paper
Traditional machine-learned ranking systems for web search are often trained to capture stationary relevance of documents to queries, which has limited ability to track non-stationary user intention in a timely manner. In recency search, for instance, the relevance of documents to a query on breaking news often changes significantly over time, requiring effective adaptation to user intention. In this paper, we focus on recency search and study a number of algorithms to improve ranking results by leveraging user click feedback. Our contributions are three-fold. First, we use real search sessions collected in a random exploration bucket for \emph{reliable} offline evaluation of these algorithms, which provides an unbiased comparison across algorithms without online bucket tests. Second, we propose a re-ranking approach to improve search results for recency queries using user clicks. Third, our empirical comparison of a dozen algorithms on real-life search data suggests importance of a few algorithmic choices in these applications, including generalization across different query-document pairs, specialization to popular queries, and real-time adaptation of user clicks.
Chang Yi
Chu Wei
Li Lihong
Moon Taesup
Zheng Zhaohui
No associations
LandOfFree
Refining Recency Search Results with User Click Feedback does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Refining Recency Search Results with User Click Feedback, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Refining Recency Search Results with User Click Feedback will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-198407