A Model for Generating Related Weighted Boolean Queries

In this paper a model for polyrepresenting weighted boolean queries based on reformulation is presented. This model tries to generate a set of boolean queries for completing the meaning of the original query instead of modifying the query adding, changing or removing terms as techniques such as query expansion propose. This model is specially designed for those systems which do not support very large queries such as the Web search engines. The input of the model are boolean queries which have been weighted by the user in order to express some semantics that the set of polyrepresented queries have to satisfy. The user is able to fix a threshold for limiting the minimum resemblance of the polyrepresented queries and the original one. From the original query, using a reformulation strategy which guarantees that length of the new queries is not enlarged excessively, the proposed model generates a set of candidate queries/concepts for representing the original one. That set is reduced by a bottom-up process based on the semantics established by the user in order to choose the best queries for representing the original one.

[1]  José A. Olivas,et al.  BUDI: Architecture for Fuzzy Search in Documental Repositories , 2009, SOCO 2009.

[2]  Amanda Spink,et al.  Patterns of query reformulation during Web searching , 2009 .

[3]  Paul B. Kantor,et al.  A Study of Information Seeking and Retrieving. III. Searchers, Searches, and Overlap* , 1988 .

[4]  Enrique Herrera-Viedma.  Modeling the retrieval process for an information retrieval system using an ordinal fuzzy linguistic approach , 2001 .

[5]  F. A. Grootjen,et al.  Conceptual query expansion , 2006, Data Knowl. Eng..

[6]  W. Bruce Croft,et al.  Improving the effectiveness of information retrieval with local context analysis , 2000, TOIS.

[7]  Jaana Kekäläinen,et al.  The Co-Effects of Query Structure and Expansion on Retrieval Performance in Probabilistic Text Retrieval , 2004, Information Retrieval.

[8]  Peter Ingwersen,et al.  The Turn - Integration of Information Seeking and Retrieval in Context , 2005, The Kluwer International Series on Information Retrieval.

[9]  Soo Young Rieh,et al.  Analysis of multiple query reformulations on the web: The interactive information retrieval context , 2006, Information Processing & Management.

[10]  Jaana Kekäläinen,et al.  ExpansionTool: Concept-Based Query Expansion and Construction , 2001, Information Retrieval.

[11]  Mette Skov,et al.  Inter and intra-document contexts applied in polyrepresentation for best match IR , 2008, Inf. Process. Manag..

[12]  E. A. Fox,et al.  Combining the Evidence of Multiple Query Representations for Information Retrieval , 1995, Inf. Process. Manag..

[13]  Amanda Spink,et al.  An analysis of Web searching by European AlltheWeb.com users , 2005, Inf. Process. Manag..

[14]  Gloria Bordogna,et al.  Query term weights as constraints in fuzzy information retrieval , 1991, Inf. Process. Manag..

[15]  Efthimis N. Efthimiadis,et al.  A user-centred evaluation of ranking algorithms for interactive query expansion , 1993, SIGIR.

[16]  Peter Bruza,et al.  Query Reformulation on the Internet: Empirical Data and the Hyperindex Search Engine , 1997, RIAO.