Issue No.02 - February (2012 vol.24)
Wisam Dakka , Google, California
Panagiotis G. Ipeirotis , New York University, New York
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2010.187
Time is an important dimension of relevance for a large number of searches, such as over blogs and news archives. So far, research on searching over such collections has largely focused on locating topically similar documents for a query. Unfortunately, topic similarity alone is not always sufficient for document ranking. In this paper, we observe that, for an important class of queries that we call time-sensitive queries, the publication time of the documents in a news archive is important and should be considered in conjunction with the topic similarity to derive the final document ranking. Earlier work has focused on improving retrieval for “recency” queries that target recent documents. We propose a more general framework for handling time-sensitive queries and we automatically identify the important time intervals that are likely to be of interest for a query. Then, we build scoring techniques that seamlessly integrate the temporal aspect into the overall ranking mechanism. We present an extensive experimental evaluation using a variety of news article data sets, including TREC data as well as real web data analyzed using the Amazon Mechanical Turk. We examine several techniques for detecting the important time intervals for a query over a news archive and for incorporating this information in the retrieval process. We show that our techniques are robust and significantly improve result quality for time-sensitive queries compared to state-of-the-art retrieval techniques.
Information search and retrieval, processing time-sensitive queries, time-sensitive search.
Wisam Dakka, Panagiotis G. Ipeirotis, "Answering General Time-Sensitive Queries", IEEE Transactions on Knowledge & Data Engineering, vol.24, no. 2, pp. 220-235, February 2012, doi:10.1109/TKDE.2010.187