Entropy of search logs: how hard is search? with personalization? with backoff?

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Qiaozhu Mei University of Illinois at Urbana Champaign, Urbana, IL
Kenneth Church Microsoft Research, Redmond, WA
Published in:
Cover Image
 
· Proceeding
WSDM '08 Proceedings of the 2008 International Conference on Web Search and Data Mining
Pages 45-54
ACM New York, NY, USA ©2008
table of contents ISBN: 978-1-59593-927-2 doi>10.1145/1341531.1341540
Entropy of search logs: how hard is search? with personalization? with backoff? Published by ACM 2008 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 9
· Downloads (12 Months): 47
· Downloads (cumulative): 764
· Citation Count: 19


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder