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

Michael Llordes

dblp:345/8697 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2023
0009-0004-5778-2987ORCID · reported

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

Databases, data management, data science and information retrieval · 1 · 1 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
1 paper
Information retrieval · 100%

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

TopicWeightPapersLastEvidence papers
Information retrieval › retrieval models
neural retrieval
0.712023
Explain Like I am BM25: Interpreting a Dense Model's Ranked-List with a Sparse Approximation · SIGIR 2023
Information retrieval › query reformulation
query expansion
0.712023
Explain Like I am BM25: Interpreting a Dense Model's Ranked-List with a Sparse Approximation · SIGIR 2023
Information retrieval
retrieval models
0.712023
Explain Like I am BM25: Interpreting a Dense Model's Ranked-List with a Sparse Approximation · SIGIR 2023
Information retrieval › evaluation
retrieval effectiveness
0.212023
Explain Like I am BM25: Interpreting a Dense Model's Ranked-List with a Sparse Approximation · SIGIR 2023
Information retrieval
retrieval evaluation
0.212023
Explain Like I am BM25: Interpreting a Dense Model's Ranked-List with a Sparse Approximation · SIGIR 2023

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

sparse approximation · 0.7RM3-based query expansion · 0.7
YearPublicationVenuePosition
2023 Explain Like I am BM25: Interpreting a Dense Model's Ranked-List with a Sparse Approximation
abstract
Neural retrieval models (NRMs) have been shown to outperform their statistical counterparts owing to their ability to capture semantic meaning via dense document representations. These models, however, suffer from poor interpretability as they do not rely on explicit term matching. As a form of local per-query explanations, we introduce the notion of equivalent queries that are generated by maximizing the similarity between the NRM's results and the result set of a sparse retrieval system with the equivalent query. We then compare this approach with existing methods such as RM3-based query expansion and contrast differences in retrieval effectiveness and in the terms generated by each approach.
Michael Llordes, Debasis Ganguly, Sumit Bhatia, Chirag Agarwal
SIGIR1