A model for generating related weighted Boolean queries

Authors:
Jesus Serrano-Guerrero;Jose A. Olivas;Enrique Herrera-Viedma;Francisco P. Romero;Jose Ruiz-Morilla
Affiliations:
Department of Information Technologies and Systems, University of Castilla-La Mancha, Ciudad Real, Spain and Department of Computer Science and Artificial Intelligence, University of Granada, Gran ...;Department of Information Technologies and Systems, University of Castilla-La Mancha, Ciudad Real, Spain and Department of Computer Science and Artificial Intelligence, University of Granada, Gran ...;Department of Information Technologies and Systems, University of Castilla-La Mancha, Ciudad Real, Spain and Department of Computer Science and Artificial Intelligence, University of Granada, Gran ...;Department of Information Technologies and Systems, University of Castilla-La Mancha, Ciudad Real, Spain and Department of Computer Science and Artificial Intelligence, University of Granada, Gran ...;Department of Information Technologies and Systems, University of Castilla-La Mancha, Ciudad Real, Spain and Department of Computer Science and Artificial Intelligence, University of Granada, Gran ...
Venue:
IEA/AIE'10 Proceedings of the 23rd international conference on Industrial engineering and other applications of applied intelligent systems - Volume Part III
Year:
2010

Citing 13
Cited 0

Query term weights as constraints in fuzzy information retrieval

Information Processing and Management: an International Journal
A user-centred evaluation of ranking algorithms for interactive query expansion

SIGIR '93 Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval
Combining the evidence of multiple query representations for information retrieval

TREC-2 Proceedings of the second conference on Text retrieval conference
Improving the effectiveness of information retrieval with local context analysis

ACM Transactions on Information Systems (TOIS)
Modeling the retrieval process for an information retrieval system using an ordinal fuzzy linguistic approach

Journal of the American Society for Information Science and Technology
The Co-Effects of Query Structure and Expansion on RetrievalPerformance in Probabilistic Text Retrieval

Information Retrieval
ExpansionTool: Concept-Based Query Expansion and Construction

Information Retrieval
An analysis of web searching by European AlltheWeb.com users

Information Processing and Management: an International Journal
The Turn: Integration of Information Seeking and Retrieval in Context (The Information Retrieval Series)

The Turn: Integration of Information Seeking and Retrieval in Context (The Information Retrieval Series)
Conceptual query expansion

Data & Knowledge Engineering
Inter and intra-document contexts applied in polyrepresentation for best match IR

Information Processing and Management: an International Journal
Patterns of query reformulation during Web searching

Journal of the American Society for Information Science and Technology
Analysis of multiple query reformulations on the web: The interactive information retrieval context

Information Processing and Management: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.