Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Artem Grotov

dblp:160/1711 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
1since 2021 · last 2021
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 4 · 2 first-author · 1 since 2021

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
2 papers
Information retrieval · 100%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information retrieval › ranking
learning to rank
0.322016
Online Learning to Rank for Information Retrieval: SIGIR 2016 Tutorial · SIGIR 2016
Bayesian Ranker Comparison Based on Historical User Interactions · SIGIR 2015
Information retrieval › ranking › learning to rank
online learning to rank
0.212016
Online Learning to Rank for Information Retrieval: SIGIR 2016 Tutorial · SIGIR 2016
Information retrieval › evaluation › online evaluation
click-based evaluation
0.212015
Bayesian Ranker Comparison Based on Historical User Interactions · SIGIR 2015
Information retrieval › user behavior › search behavior
click model
0.212015
Bayesian Ranker Comparison Based on Historical User Interactions · SIGIR 2015
Information retrieval
user interaction
0.112016
Online Learning to Rank for Information Retrieval: SIGIR 2016 Tutorial · SIGIR 2016

Methods — techniques the papers use, named apart from their topics

click model · 0.2bayesian inference · 0.2
YearPublicationVenuePosition
2021 Building a Platform for Ensemble-based Personalized Research Literature Recommendations for AI and Data Science at Zeta Alpha
abstract
No abstract available.
Jakub Zavrel, Artem Grotov, Jonathan Mitnik
RecSys2
2016 Online Learning to Rank for Information Retrieval: SIGIR 2016 Tutorial
abstract
During the past 10--15 years offline learning to rank has had a tremendous influence on information retrieval, both scientifically and in practice. Recently, as the limitations of offline learning to rank for information retrieval have become apparent, there is increased attention for online learning to rank methods for information retrieval in the community. Such methods learn from user interactions rather than from a set of labeled data that is fully available for training up front.
Artem Grotov, Maarten de Rijke
SIGIR1
2015 User Behavior in Location Search on Mobile Devices
Yaser Norouzzadeh Ravari, Ilya Markov, Artem Grotov, Maarten Clements, Maarten de Rijke
ECIR3
2015 Bayesian Ranker Comparison Based on Historical User Interactions
abstract
We address the problem of how to safely compare rankers for information retrieval. In particular, we consider how to control the risks associated with switching from an existing production ranker to a new candidate ranker. Whereas existing online comparison methods require showing potentially suboptimal result lists to users during the comparison process, which can lead to user frustration and abandonment, our approach only requires user interaction data generated through the natural use of the production ranker. Specifically, we propose a Bayesian approach for (1) comparing the production ranker to candidate rankers and (2) estimating the confidence of this comparison. The comparison of rankers is performed using click model-based information retrieval metrics, while the confidence of the comparison is derived from Bayesian estimates of uncertainty in the underlying click model. These confidence estimates are then used to determine whether a risk-averse decision criterion for switching to the candidate ranker has been satisfied. Experimental results on several learning to rank datasets and on a click log show that the proposed approach outperforms an existing ranker comparison method that does not take uncertainty into account.
Artem Grotov, Shimon Whiteson, Maarten de Rijke
SIGIR1