نتایج جستجو برای: boolean retrieval
تعداد نتایج: 106155 فیلتر نتایج به سال:
In this paper the concept of an $Omega$- Almost Boolean ring is introduced and illistrated how a sheaf of algebras can be constructed from an $Omega$- Almost Boolean ring over a locally Boolean space.
In this article, our interest is focused on the automatic learning of Boolean queries in information retrieval systems (IRSs) by means of multi-objective evolutionary algorithms considering the classic performance criteria, precision and recall. We present a comparative study of four well-known, general-purpose, multi-objective evolutionary algorithms to learn Boolean queries in IRSs. These evo...
UMKC participated in the 2007 legal track. Our experiments focused mainly on evaluating the different query formulations in the negotiated query refinement process of legal e-discovery. For our study, we considered three sets of paired runs in vector space model and language model respectively. Our experiments indicated that although the Boolean query negotiating process was successful for the ...
In classical Boolean logic, data is represented as being either entirely true or entirely false. In most real world phenomena however, it is rare that en entity will be absolutely true or absolutely false. When designing a system, Boolean logic lacks the tools necessary to deal with this kind of uncertainty. Using fuzzy logic we were able to develop a system that is able to deal with uncertaint...
For our participation in the Batch Task of the TREC 2009 Legal Track, we produced several retrieval sets to compare experimental Boolean, vector, fusion and relevance feedback techniques for e-Discovery requests. In this paper, we have reported not just the mean scores of the experimental approaches but also the largest per-topic impacts of the techniques for several measures. The experimental ...
one of the models that can be used to study the relationship between boolean random sets and explanatory variables is growth regression model which is defined by generalization of boolean model and permitting its grains distribution to be dependent on the values of explanatory variables. this model can be used in the study of behavior of boolean random sets when their coverage regions variation...
Translation ambiguity is a major problem in dictionary-based cross-language information retrieval. To attack the problem, indirect disambiguation approaches, which do not explicitly resolve translation ambiguity, rely on query-structuring techniques such as a structured Boolean model and Pirkola’s method. Direct disambiguation approaches try to assign translation probabilities to translation eq...
Information Retrieving is task of recuperating information with high relevance, precision and recall. Basic methods for information retrieval include Boolean Retrieval, Fuzzy retrieval, Vector Space model. Searching depends on matching keywords between user-query and document. Ontology can be used in information retrieval. In software engineering and information science, ontology is a formal na...
This paper describes our participation in the GeoCLEF monolingual English task of the Cross Language Evaluation Forum 2006. Our retrieval system consists of four modules: the geographic knowledge base; the indexing module; the document retrieval module and the ranking module. The geographic knowledge base provides information about important geographic entities around the world and relationship...
In this paper we study the impact of query term expansion (QTE) using synonyms on patent document retrieval. We use an automatically generated lexical database from USPTO query logs, called PatNet, which provides synonyms and equivalents for a query term. Our experiments on the CLEF-IP 2010 benchmark dataset show that automatic query expansion using PatNet tends to decrease or only slightly imp...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید