Bsmooth: Learning from user feedback to disambiguate query terms in interactive data retrieval

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 behavior and to encoding biases endemic to the system's models. In this paper, we address such learning problem in interactive data retrieval, with specific focus on type classification for user-specified query terms. We develop a novel Bayesian smoothing algorithm, Bsmooth, which is simple, fast, flexible and accurate. We analytically establish some desirable properties and show, through experiments against an independent benchmark, that the addition of such a learning layer performs much better than standard methods.

[1]  Xuemin Lin,et al.  SPARK2: Top-k Keyword Query in Relational Databases , 2007, IEEE Transactions on Knowledge and Data Engineering.

[2]  Lotfi A. Zadeh,et al.  Review of A Mathematical Theory of Evidence , 1984 .

[3]  Thierry Denoeux,et al.  Forecasting using belief functions: An application to marketing econometrics , 2014, Int. J. Approx. Reason..

[4]  Vagelis Hristidis,et al.  DISCOVER: Keyword Search in Relational Databases , 2002, VLDB.

[5]  Shan Wang,et al.  Finding Top-k Min-Cost Connected Trees in Databases , 2007, 2007 IEEE 23rd International Conference on Data Engineering.

[6]  Fei Li,et al.  Constructing an Interactive Natural Language Interface for Relational Databases , 2014, Proc. VLDB Endow..

[7]  Leif Azzopardi,et al.  Modelling interaction with economic models of search , 2014, SIGIR.

[8]  Sonia Bergamaschi,et al.  QUEST: A Keyword Search System for Relational Data based on Semantic and Machine Learning Techniques , 2013, Proc. VLDB Endow..

[9]  Jeffrey Xu Yu,et al.  Keyword Search in Relational Databases: A Survey , 2010, IEEE Data Eng. Bull..

[10]  Clement T. Yu,et al.  Effective keyword search in relational databases , 2006, SIGMOD Conference.

[11]  Philip S. Yu,et al.  BLINKS: ranked keyword searches on graphs , 2007, SIGMOD '07.

[12]  Alfred C. Weaver,et al.  Structured data retrieval using cover density ranking , 2010, KEYS '10.

[13]  Alfred C. Weaver,et al.  A framework for evaluating database keyword search strategies , 2010, CIKM.

[14]  William Webber,et al.  Evaluating the Effectiveness of Keyword Search , 2010, IEEE Data Eng. Bull..

[15]  Luis Gravano,et al.  Efficient IR-Style Keyword Search over Relational Databases , 2003, VLDB.

[16]  Aniket Kittur,et al.  Crowdsourcing user studies with Mechanical Turk , 2008, CHI.

[17]  Cosma Rohilla Shalizi,et al.  Advanced Data Analysis from an Elementary Point of View , 2012 .

[18]  Gerhard Weikum,et al.  STAR: Steiner-Tree Approximation in Relationship Graphs , 2009, 2009 IEEE 25th International Conference on Data Engineering.

[19]  S. Sudarshan,et al.  Bidirectional Expansion For Keyword Search on Graph Databases , 2005, VLDB.

[20]  Jonathan Baron,et al.  Combining multiple probability predictions using a simple logit model , 2014 .

[21]  Christopher D. Manning,et al.  Introduction to Information Retrieval , 2010, J. Assoc. Inf. Sci. Technol..

[22]  Mark D. Smucker,et al.  Report on the SIGIR 2010 workshop on the simulation of interaction , 2011, SIGF.

[23]  S. Sudarshan,et al.  Keyword searching and browsing in databases using BANKS , 2002, Proceedings 18th International Conference on Data Engineering.

[24]  Lotfi A. Zadeh,et al.  Book Review: A Mathematical Theory of Evidence , 1984, AI Mag..

[25]  Glenn Shafer,et al.  A Mathematical Theory of Evidence , 2020, A Mathematical Theory of Evidence.

[26]  Jeffrey F. Naughton,et al.  Toward scalable keyword search over relational data , 2010, Proc. VLDB Endow..

[27]  Emine Yilmaz,et al.  Crowdsourcing interactions: using crowdsourcing for evaluating interactive information retrieval systems , 2012, Information Retrieval.

[28]  J Allan,et al.  Readings in information retrieval. , 1998 .

[29]  Thierry Denoeux,et al.  Combining statistical and expert evidence using belief functions: Application to centennial sea level estimation taking into account climate change , 2014, Int. J. Approx. Reason..

[30]  Kevin P. Murphy,et al.  Machine learning - a probabilistic perspective , 2012, Adaptive computation and machine learning series.

[31]  Jane Li,et al.  Good abandonment in mobile and PC internet search , 2009, SIGIR.

[32]  Alfred C. Weaver,et al.  Ieee Transactions on Knowledge and Data Engineering 1 an Empirical Performance Evaluation of Relational Keyword Search Techniques , 2022 .