Demo Data from VLDB 2026 / reviewers in the wild / expert
Paul Missault
dblp:349/0550
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2023
0009-0003-2378-1807ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 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
1 paper |
Information retrieval · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information retrieval › ranking
learning to rank |
0.7 | 1 | 2023 | RankFormer: Listwise Learning-to-Rank Using Listwide Labels · KDD 2023 |
Information retrieval › ranking › learning to rank
listwise learning to rank |
0.7 | 1 | 2023 | RankFormer: Listwise Learning-to-Rank Using Listwide Labels · KDD 2023 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | RankFormer: Listwise Learning-to-Rank Using Listwide LabelsabstractWeb applications where users are presented with a limited selection of items have long employed ranking models to put the most relevant results first. Any feedback received from users is typically assumed to reflect a relative judgement on the utility of items, e.g. a user clicking on an item only implies it is better than items not clicked in the same ranked list. Hence, the objectives optimized in Learning-to-Rank (LTR) tend to be pairwise or listwise. Maarten Buyl, Paul Missault, Pierre-Antoine Sondag |
KDD | 2 |