Most current information retrieval systems use boolean search methods to request and retrieve documents. While e ective for precise query speci cations, boolean search systems su er when the request is of a more general nature such as in a subject search request. If the query is too precise, the search may fail with no documents returned, however, if the query is too general, too many documents...

Two common assumptions held by information retrieval researchers are that searching using Boolean operators is inferior to natural language searching and that results from batch-style retrieval evaluations are generalizable to the real-world searching. We challenged these assumptions in the Text Retrieval Conference (TREC) interactive track, with real users following a consensus protocol to sea...

Due to increase in web-based applications, the need for enhanced information retrieval system that accommodate user’s needs become crucial. Most of commercial information retrieval system are based on standard Boolean model and at less scale vector models. Although the deficiencies of these models are now part of text-book knowledge, the development of new models still have to overcome the feas...

We develop a new method to rank the degree of similarity between Boolean expressions contrast it with other known methods and describe its implementation Our method reduces time and space complexity from exponential to polynomial in the number of Boolean terms Index Terms Boolean query information retrieval ranking resource discovery similarity measure

Search engines use significant hardware and energy resources to process billions of user queries per day, where Boolean query processing for document retrieval is an essential ingredient. Considering the huge number users large scale network, traditional mechanisms may not be applicable since they mostly depend on a centralized method. To remedy this issue, paper proposes technique aggregated i...

Whether using Boolean queries or ranking documents using document and term weights will result in better retrieval performance has been the subject of considerable discussion among document retrieval system users and researchers. We suggest a method that allows one to analytically compare the two approaches to retrieval and examine their relative merits. The performance of information retrieval...

A document retrieval system may be described by three formal characteristics: the syntax employed to describe documents (keywords or vectors of weights, for instance), the form of machine-processable queries it accepts as valid (unordered sets of keywords, keywords with Boolean connectives or weighted vectors, for example), and the retrieval rules used to rank or retrieve documents. This articl...

Restricted Boltzmann machines are described by the Gibbs measure of a bipartite spin glass, which in turn can be seen as a generalized Hopfield network. This equivalence allows us to characterize the state of these systems in terms of their retrieval capabilities, both at low and high load, of pure states. We study the paramagnetic-spin glass and the spin glass-retrieval phase transitions, as t...

Arabic language is one of the most widely spoken languages. This language has a complex morphological structure and is considered as one of the most prolific languages in terms of article linguistic. Therefore, Arabic Information Retrieval (AIR) models need specific techniques to deal with this complex morphological structure. This paper aims to develop an integrate AIR frameworks. It lists and...