Find it if you can: a game for modeling different types of web search success using interaction data.

Mikhail Ageev|Qi Guo|Dmitry Lagun|Eugene Agichtein


Anthology ID:DBLP:conf/sigir/AgeevGLA11
Volume:Proceeding of the 34th International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 2011, Beijing, China, July 25-29, 2011
Year:2011
Venue:Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR)
Publisher:ACM
Pages:345-354
URL:https://doi.org/10.1145/2009916.2009965
DOI:https://doi.org/10.1145/2009916.2009965
DBLP:conf/sigir/AgeevGLA11
BibTeX:
@inproceedings{ageev-2011-find, author = {Mikhail Ageev and Qi Guo and Dmitry Lagun and Eugene Agichtein}, editor = {Wei-Ying Ma and Jian-Yun Nie and Ricardo Baeza-Yates and Tat-Seng Chua and W. Bruce Croft}, title = {{Find it if you can: a game for modeling different types of web search success using interaction data}}, booktitle = {{Proceeding of the 34th International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 2011, Beijing, China, July 25-29, 2011}}, pages = {345--354}, publisher = {ACM}, year = {2011}, url = {https://doi.org/10.1145/2009916.2009965}, doi = {https://doi.org/10.1145/2009916.2009965} }