VLDB 2026 Research / reviewers in the wild / expert
Norman Knyazev
dblp:220/8478
· DBLP profile ↗
3ranked-venue papers
3as first author
3since 2021 · last 2026
0000-0001-5036-3780ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 3 · 3 first-author · 3 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Sample-Free Almost-Exact Estimation of Plackett-Luce Propensities for Off-Policy Ranking
Norman Knyazev, Harrie Oosterhuis |
ECIR (1) | 1 |
| 2025 | Learning to Rank with Variable Result Presentation LengthsabstractLearning to Rank (LTR) methods generally assume that each document in a top-K ranking is presented in an equal format. However, previous work has shown that users' perceptions of relevance can be changed by varying presentations, i.e., allocating more vertical space to some documents to provide additional textual or image information. Furthermore, presentation length can also redirect attention, as users are more likely to notice longer presentations when scrolling through results. Deciding on the document presentation lengths in a fixed vertical space ranking is an important problem that has not been addressed by existing LTR methods. Norman Knyazev, Harrie Oosterhuis |
SIGIR | 1 |
| 2023 | A Lightweight Method for Modeling Confidence in Recommendations with Learned Beta DistributionsabstractMost recommender systems (RecSys) do not provide an indication of confidence in their decisions. Therefore, they do not distinguish between recommendations of which they are certain, and those where they are not. Existing confidence methods for RecSys are either inaccurate heuristics, conceptually complex or computationally very expensive. Consequently, real-world RecSys applications rarely adopt these methods, and thus, provide no confidence insights in their behavior. Norman Knyazev, Harrie Oosterhuis |
RecSys | 1 |