Unsupervised Search Algorithm Configuration using Query Performance Prediction

10/03/2022
by   Haggai Roitman, et al.
0

Search engine configuration can be quite difficult for inexpert developers. Instead, an auto-configuration approach can be used to speed up development time. Yet, such an automatic process usually requires relevance labels to train a supervised model. In this work, we suggest a simple solution based on query performance prediction that requires no relevance labels but only a sample of queries in a given domain. Using two example usecases we demonstrate the merits of our solution.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/29/2019

Learning Image Information for eCommerce Queries

Computing similarity between a query and a document is fundamental in an...
research
03/02/2022

Stable and Semi-stable Sampling Approaches for Continuously Used Samples

Information retrieval systems are usually measured by labeling the relev...
research
03/28/2018

Deeply Supervised Semantic Model for Click-Through Rate Prediction in Sponsored Search

In sponsored search it is critical to match ads that are relevant to a q...
research
01/27/2020

Leveraging Schema Labels to Enhance Dataset Search

A search engine's ability to retrieve desirable datasets is important fo...
research
05/17/2023

Selective Query Processing: a Risk-Sensitive Selection of System Configurations

In information retrieval systems, search parameters are optimized to ens...
research
11/19/2018

A Trustworthy, Responsible and Interpretable System to Handle Chit-Chat in Conversational Bots

Most often, chat-bots are built to solve the purpose of a search engine ...
research
06/04/2020

Syntactic Search by Example

We present a system that allows a user to search a large linguistically ...

Please sign up or login with your details

Forgot password? Click here to reset