Entropy of search logs: how hard is search? with personalization? with backoff? - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Qiaozhu Mei, Kenneth Ward Church. Entropy of search logs: how hard is search? with personalization? with backoff?. In Marc Najork, Andrei Z. Broder, Soumen Chakrabarti, editors, Proceedings of the International Conference on Web Search and Web Data Mining, WSDM 2008, Palo Alto, California, USA, February 11-12, 2008. pages 45-54, ACM, 2008. [doi]

This author has not been identified. Look up 'Qiaozhu Mei' in GoogleThis author has not been identified. Look up 'Kenneth Ward Church' in Google

runs on WebDSL