Bsmooth: Learning from user feedback to disambiguate query terms in interactive data retrieval
Bernardo Gon\c{c}alves, H. V. Jagadish

TL;DR
This paper introduces Bsmooth, a Bayesian smoothing algorithm that improves disambiguation of query terms in interactive data retrieval by effectively leveraging user feedback, outperforming standard methods.
Contribution
The paper presents a novel Bayesian smoothing algorithm, Bsmooth, specifically designed for type classification in query disambiguation, addressing noise and bias issues in user feedback integration.
Findings
Bsmooth outperforms standard methods in benchmark tests.
The algorithm is simple, fast, and flexible.
Analytical properties demonstrate desirable behavior.
Abstract
There is great interest in supporting imprecise queries (e.g., keyword search or natural language queries) over databases today. To support such queries, the database system is typically required to disambiguate parts of the user-specified query against the database, using whatever resources are intrinsically available to it (the database schema, data values distributions, natural language models etc). Often, systems will also have a user-interaction log available, which can serve as an extrinsic resource to supplement their model based on their own intrinsic resources. This leads to a problem of how best to combine the system's prior ranking with insight derived from the user-interaction log. Statistical inference techniques such as maximum likelihood or Bayesian updates from a subjective prior turn out not to apply in a straightforward way due to possible noise from user search…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Management and Algorithms · Information Retrieval and Search Behavior · Data Quality and Management
