Query dependent time-sensitive ranking model for microblog search

N/ACitations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Previous works show that one main difference between web search and microblog search is that most microblog queries are time-sensitive. Therefore, many existing works based on one straightforward temporal assumption have tried to incorporate the temporal factors into ranking model to improve the retrieval effectiveness. However, our study show that temporal role in ranking is complicated and hard to be summarized into one straightforward assumption. In addition, temporal influence is different among queries. To address these problems, we propose a query-dependent time-sensitive microblog ranking model, which use learning to rank to combine both temporal and entity evidences into the ranking process as the basic ranking model. In order to leverage the query difference, the k most similar training queries are used to train the ranking model. Experimental results on the public TrecMicroblog2011 data set show that comparing with the existing time-sensitive models, our models can significantly improve the performance of microblog search. © 2014 Springer International Publishing Switzerland.

Cite

CITATION STYLE

APA

Wang, S., Lu, K., Lu, X., & Wang, B. (2014). Query dependent time-sensitive ranking model for microblog search. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8709 LNCS, pp. 644–651). Springer Verlag. https://doi.org/10.1007/978-3-319-11116-2_62

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free