Demo Data from VLDB 2026 / reviewers in the wild / expert
Chun Ming Chin
dblp:183/0629
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2016
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 1
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
1 paper |
Information retrieval · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information retrieval › ranking › learning to rank
click-based learning to rank |
0.2 | 1 | 2016 | Click-based Hot Fixes for Underperforming Torso Queries · SIGIR 2016 |
Information retrieval › ranking
learning to rank |
0.2 | 1 | 2016 | Click-based Hot Fixes for Underperforming Torso Queries · SIGIR 2016 |
Information retrieval
ranking |
0.2 | 1 | 2016 | Click-based Hot Fixes for Underperforming Torso Queries · SIGIR 2016 |
Information retrieval
reranking |
0.2 | 1 | 2016 | Click-based Hot Fixes for Underperforming Torso Queries · SIGIR 2016 |
Information retrieval › query understanding
query classification |
0.1 | 1 | 2016 | Click-based Hot Fixes for Underperforming Torso Queries · SIGIR 2016 |
Methods — techniques the papers use, named apart from their topics
pairwise preference learning · 0.2exploration · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2016 | Click-based Hot Fixes for Underperforming Torso QueriesabstractRanking documents using their historical click-through rate (CTR) can improve relevance for frequently occurring queries, i.e., so-called head queries. It is difficult to use such click signals on non-head queries as they receive fewer clicks. In this paper, we address the challenge of dealing with torso queries on which the production ranker is performing poorly. Torso queries are queries that occur frequently enough so that they are not considered as tail queries and yet not frequently enough to be head queries either. They comprise a large portion of most commercial search engines' traffic, so the presence of a large number of underperforming torso queries can harm the overall performance significantly. We propose a practical method for dealing with such cases, drawing inspiration from the literature on learning to rank (LTR). Our method requires relatively few clicks from users to derive a strong re-ranking signal by comparing document relevance between pairs of documents instead of using absolute numbers of clicks per document. By infusing a modest amount of exploration into the ranked lists produced by a production ranker and extracting preferences between documents, we obtain substantial improvements over the production ranker in terms of page-level online metrics. We use an exploration dataset consisting of real user clicks from a large-scale commercial search engine to demonstrate the effectiveness of the method. We conduct further experimentation on public benchmark data using simulated clicks to gain insight into the inner workings of the proposed method. Our results indicate a need for LTR methods that make more explicit use of the query and other contextual information. Masrour Zoghi, Tomás Tunys, Lihong Li 0001, Damien Jose, Chun Ming Chin, Maarten de Rijke |
SIGIR | 6 |