Entropy of search logs: how hard is search? with personalization? with backoff?
Qiaozhu Mei|Kenneth Ward Church
| Anthology ID: | DBLP:conf/wsdm/MeiC08 |
|---|---|
| Volume: | Proceedings of the International Conference on Web Search and Web Data Mining, WSDM 2008, Palo Alto, California, USA, February 11-12, 2008 |
| Year: | 2008 |
| Venue: | Web Search and Data Mining (WSDM) |
| Publisher: | ACM |
| Pages: | 45-54 |
| URL: | https://doi.org/10.1145/1341531.1341540 |
| DOI: | https://doi.org/10.1145/1341531.1341540 |
| DBLP: | conf/wsdm/MeiC08 |
| BibTeX: |
@inproceedings{mei-2008-entropy,
author = {Qiaozhu Mei and
Kenneth Ward Church},
editor = {Marc Najork and
Andrei Z. Broder and
Soumen Chakrabarti},
title = {{Entropy of search logs: how hard is search? with personalization? with backoff?}},
booktitle = {{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},
publisher = {ACM},
year = {2008},
url = {https://doi.org/10.1145/1341531.1341540},
doi = {https://doi.org/10.1145/1341531.1341540}
}