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

@inproceedings{citeulike:2402461, address = {New York, NY, USA}, author = {Mei, Qiaozhu and Church, Kenneth}, booktitle = {WSDM '08: Proceedings of the international conference on Web search and web data mining}, citeulike-article-id = {2402461}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1341531.1341540}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/1341531.1341540}, doi = {10.1145/1341531.1341540}, isbn = {9781595939279}, keywords = {personalized-search, query-logs}, pages = {45--54}, posted-at = {2008-03-27 14:32:34}, priority = {2}, publisher = {ACM}, title = {Entropy of search logs: how hard is search? with personalization? with backoff?}, url = {http://dx.doi.org/10.1145/1341531.1341540}, year = {2008} }

TY - CONF ID - citeulike:2402461 L3 - citeulike-article-id:2402461 SN - 9781595939279 AD - New York, NY, USA EP - 54 TI - Entropy of search logs: how hard is search? with personalization? with backoff? PB - ACM T2 - WSDM '08: Proceedings of the international conference on Web search and web data mining SP - 45 KW - personalized-search KW - query-logs AU - Mei, Qiaozhu AU - Church, Kenneth PY - 2008/// UR - http://dx.doi.org/10.1145/1341531.1341540 ER -