Find it if you can: a game for modeling different types of web search success using interaction data
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
A better understanding of strategies and behavior of successful searchers is crucial for improving the experience of all searchers. However, research of search behavior has been struggling with the tension between the relatively small-scale, but controlled lab studies, and the large-scale log-based studies where the searcher intent and many other important factors have to be inferred. We present our solution for performing controlled, yet realistic, scalable, and reproducible studies of searcher behavior. We focus on difficult informational tasks, which tend to frustrate many users of the current web search technology. First, we propose a principled formalization of different types of "success" for informational search, which encapsulate and sharpen previously proposed models. Second, we present a scalable game-like infrastructure for crowdsourcing search behavior studies, specifically targeted towards capturing and evaluating successful search strategies on informational tasks with known intent. Third, we report our analysis of search success using these data, which confirm and extends previous findings. Finally, we demonstrate that our model can predict search success more effectively than the existing state-of-the-art methods, on both our data and on a different set of log data collected from regular search engine sessions. Together, our search success models, the data collection infrastructure, and the associated behavior analysis techniques, significantly advance the study of success in web search.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
How does search behavior change as search becomes more difficult?
Aula, A., Khan, R. M., & Guan, Z. (2010) · Proceedings of the SIGCHI Conference on Human Factors in Computing Systems · doi:10.1145/1753326.1753333 · Cited by 209 · cited 4×
“Aula et al. [2] examined the changes of searcher behavior associated with difficult search tasks using data collected from a usability lab study and an online study.”
BackgroundMethodResultInfluential
Cited by
Modeling dwell time to predict click-level satisfaction
Kim, Y., Hassan, A., White, R. W., & Zitouni, I. (2014) · Proceedings of the 7th ACM international conference on Web search and data mining · doi:10.1145/2556195.2556220 · Cited by 164
Kelly, D., Arguello, J., Edwards, A., & Wu, W.-C. (2015) · Proceedings of the 2015 International Conference on The Theory of Information Retrieval · doi:10.1145/2808194.2809465 · Cited by 155
“could not be solved, or solved easily [1, 6].”
BackgroundUnderstanding User Satisfaction with Intelligent Assistants
Kiseleva, J., Williams, K., Jiang, J., Hassan Awadallah, A., Crook, A. C., Zitouni, I., & Anastasakos, T. (2016) · Proceedings of the 2016 ACM on Conference on Human Information Interaction and Retrieval · doi:10.1145/2854946.2854961 · Cited by 150
Predicting User Satisfaction with Intelligent Assistants
Kiseleva, J., Williams, K., Hassan Awadallah, A., Crook, A. C., Zitouni, I., & Anastasakos, T. (2016) · Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval · doi:10.1145/2911451.2911521 · Cited by 108
Struggling and Success in Web Search
Odijk, D., White, R. W., Hassan Awadallah, A., & Dumais, S. T. (2015) · Proceedings of the 24th ACM International on Conference on Information and Knowledge Management · doi:10.1145/2806416.2806488 · Cited by 79
Metadata
- Authors
- Ageev, M., Guo, Q., Lagun, D., & Agichtein, E.
- Venue
- Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval
- Publisher
- ACM
- Published
- 2011-07-24
- Pages
- 345-354
- OpenAlex
- W2008251177
- Cited by
- 116
- References
- 1
- FWCI
- 9.61
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.