Exposing Query Identification For Search Transparency

Abstract

Search systems control the exposure of ranked content to searchers. In many cases, creators value not only the exposure of their content but, moreover, an understanding of the specific searches where the content is surfaced. The problem of identifying which queries expose a given piece of content in the ranking results is an important and relatively under-explored search transparency challenge. Exposing queries are useful for quantifying various issues of search bias, privacy, data protection, security, and search engine optimization. Exact identification of exposing queries in a given system is computationally expensive, especially in dynamic contexts such as web search. We explore the feasibility of approximate exposing query identification (EQI) as a retrieval task by reversing the role of queries and documents in two classes of search systems: dense dual-encoder models and traditional BM25 models. We then propose how this approach can be improved through metric learning over the

Stats

• citations7
• S2 citations—
• github stars0
• HF likes0
• heat score6.77
• arxiv keyli2021exposing

Related papers

• Query Exposure Prediction For Groups Of Documents In Rankings (2024)4.52
• Axiomatic Explanations For Visual Search, Retrieval, And Similarity Learning (2021)0.00
• Excluir: Exclusionary Neural Information Retrieval (2024)7.23
• Evaluating Stochastic Rankings With Expected Exposure (2020)15.83
• On The Interpolation Of Contextualized Term-based Ranking With BM25 For Query-by-example Retrieval (2022)7.50
• CEQE: Contextualized Embeddings For Query Expansion (2021)10.35
• Jointly Optimizing Query Encoder And Product Quantization To Improve Retrieval Performance (2021)12.74
• QAIR: Practical Query-efficient Black-box Attacks For Image Retrieval (2021)12.54