ACM Home Page
Please provide us with feedback. Feedback
What queries are likely to recur in web search?
Full text PdfPdf (331 KB)
Source
Annual ACM Conference on Research and Development in Information Retrieval archive
Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval table of contents
Boston, MA, USA
POSTER SESSION: Posters table of contents
Pages 827-828  
Year of Publication: 2009
ISBN:978-1-60558-483-6
Authors
Dell Zhang  Birkbeck, University of London, London, United Kingdom
Jinsong Lu  Birkbeck, University of London, London, United Kingdom
Sponsors
SIGIR: ACM Special Interest Group on Information Retrieval
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 17,   Downloads (12 Months): 71,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1571941.1572149
What is a DOI?

ABSTRACT

We study the recurrence dynamics of queries in Web search by analysing a large real-world query log dataset. We find that query frequency is more useful in predicting collective query recurrence whereas query recency is more useful in predicting individual query recurrence. Our findings provide valuable insights for understanding and improving Web search.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
3
 
4
M. Kendall and J. D. Gibbons. Rank Correlation Methods. A Charles Griffin Book, 5th edition, 1990.
5
6
7
 
8
M. E. J. Newman. Power laws, pareto distributions and zipf's law. Contemporary Physics, 46:323--351, 2005.
9
10