VLDB 2026 Research / reviewers in the wild / expert
Mikhail Ageev
dblp:39/9904
· DBLP profile ↗
4ranked-venue papers
3as first author
0since 2021 · last 2014
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 3 · 2 first-authorArtificial intelligence and machine learning · 2 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Databases, data mining, and information retrieval
4 papers |
Information retrieval · 89% Data mining · 11% |
Topics — the 12 heaviest of 13, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information retrieval › user behavior
search behavior |
0.3 | 2 | 2013 | Improving search result summaries by using searcher behavior data · SIGIR 2013 Find it if you can: a game for modeling different types of web search success using interaction data · SIGIR 2011 |
Information retrieval › user behavior
mouse movement analysis |
0.2 | 2 | 2014 | Discovering common motifs in cursor movement data for improving web search · WSDM 2014 Improving search result summaries by using searcher behavior data · SIGIR 2013 |
Data mining › structured data mining › graph mining
motif discovery |
0.2 | 1 | 2014 | Discovering common motifs in cursor movement data for improving web search · WSDM 2014 |
Information retrieval
reranking |
0.2 | 1 | 2014 | Discovering common motifs in cursor movement data for improving web search · WSDM 2014 |
Information retrieval › user behavior
search behavior analysis |
0.2 | 1 | 2014 | Discovering common motifs in cursor movement data for improving web search · WSDM 2014 |
Information retrieval › document retrieval
passage retrieval |
0.2 | 1 | 2013 | The Answer is at your Fingertips: Improving Passage Retrieval for Web Question Answering with Search Behavior Data · EMNLP 2013 |
Information retrieval › search interfaces
search result presentation |
0.2 | 1 | 2013 | Improving search result summaries by using searcher behavior data · SIGIR 2013 |
Information retrieval › text summarization
snippet generation |
0.2 | 1 | 2013 | Improving search result summaries by using searcher behavior data · SIGIR 2013 |
Information retrieval › interactive information retrieval
search success modeling |
0.1 | 1 | 2011 | Find it if you can: a game for modeling different types of web search success using interaction data · SIGIR 2011 |
Information retrieval › interactive information retrieval
search interaction |
0.1 | 1 | 2014 | Discovering common motifs in cursor movement data for improving web search · WSDM 2014 |
Data mining
crowdsourcing |
0.0 | 1 | 2011 | Find it if you can: a game for modeling different types of web search success using interaction data · SIGIR 2011 |
Information retrieval
evaluation |
0.0 | 1 | 2011 | Find it if you can: a game for modeling different types of web search success using interaction data · SIGIR 2011 |
Methods — techniques the papers use, named apart from their topics
frequent subsequence mining · 0.2scrolling analysis · 0.2mouse cursor movement analysis · 0.2behavior-biased snippet generation · 0.2game-based crowdsourcing · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2014 | Discovering common motifs in cursor movement data for improving web searchabstractWeb search behavior and interaction data, such as mouse cursor movements, can provide valuable information on how searchers examine and engage with the web search results. This interaction data is far richer than traditional search click data, and can be used to improve search ranking, evaluation, and presentation. Unfortunately, the diversity and complexity inherent in this interaction data make it more difficult to capture salient behavior characteristics through traditional feature engineering. To address this problem, we introduce a novel approach of automatically discovering frequent subsequences, or motifs, in mouse cursor movement data. In order to scale our approach to realistic datasets, we introduce novel optimizations for motif discovery, specifically designed for mining cursor movement data. As a practical application, we show that by encoding the motifs discovered from thousands of real web search sessions as features, enables significant improvements on result relevance estimation and re-ranking tasks, compared to a state-of-the-art baseline that relies on extensive feature engineering. These results, complemented with visualization and qualitative analysis, demonstrate that our approach is able to automatically capture key characteristics of mouse cursor movement behavior, providing a valuable new tool for search behavior analysis. Dmitry Lagun, Mikhail Ageev, Qi Guo 0002, Eugene Agichtein |
WSDM | 2 |
| 2013 | The Answer is at your Fingertips: Improving Passage Retrieval for Web Question Answering with Search Behavior DataabstractPassage retrieval is a crucial first step of automatic Question Answering (QA).While existing passage retrieval algorithms are effective at selecting document passages most similar to the question, or those that contain the expected answer types, they do not take into account which parts of the document the searchers actually found useful.We propose, to the best of our knowledge, the first successful attempt to incorporate searcher examination data into passage retrieval for question answering.Specifically, we exploit detailed examination data, such as mouse cursor movements and scrolling, to infer the parts of the document the searcher found interesting, and then incorporate this signal into passage retrieval for QA.Our extensive experiments and analysis demonstrate that our method significantly improves passage retrieval, compared to using textual features alone.As an additional contribution, we make available to the research community the code and the search behavior data used in this study, with the hope of encouraging further research in this area. Mikhail Ageev, Dmitry Lagun, Eugene Agichtein |
EMNLP | 1 |
| 2013 | Improving search result summaries by using searcher behavior dataabstractQuery-biased search result summaries, or "snippets", help users decide whether a result is relevant for their information need, and have become increasingly important for helping searchers with difficult or ambiguous search tasks. Previously published snippet generation algorithms have been primarily based on selecting document fragments most similar to the query, which does not take into account which parts of the document the searchers actually found useful. We present a new approach to improving result summaries by incorporating post-click searcher behavior data, such as mouse cursor movements and scrolling over the result documents. To achieve this aim, we develop a method for collecting behavioral data with precise association between searcher intent, document examination behavior, and the corresponding document fragments. In turn, this allows us to incorporate page examination behavior signals into a novel Behavior-Biased Snippet generation system (BeBS). By mining searcher examination data, BeBS infers document fragments of most interest to users, and combines this evidence with text-based features to select the most promising fragments for inclusion in the result summary. Our extensive experiments and analysis demonstrate that our method improves the quality of result summaries compared to existing state-of-the-art methods. We believe that this work opens a new direction for improving search result presentation, and we make available the code and the search behavior data used in this study to encourage further research in this area. Mikhail Ageev, Dmitry Lagun, Eugene Agichtein |
SIGIR | 1 |
| 2011 | Find it if you can: a game for modeling different types of web search success using interaction dataabstractA 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. Mikhail Ageev, Qi Guo 0002, Dmitry Lagun, Eugene Agichtein |
SIGIR | 1 |