نتایج جستجو برای: boolean retrieval
تعداد نتایج: 106155 فیلتر نتایج به سال:
This is the rst participation of the Graduate School of Library and Information Science, University of California at Los Angeles in the TREC Conference. For TREC{2, Category B, UCLA used a version of the Okapi text retrieval system that was made available to UCLA by City University, London, UK. OKAPI has been described in TREC1 (Robertson, Walker, Hancock-Beaulieu, Gull & Lau, 1993a) as well as...
Statistically based ranked retrieval of records using keywords provides many advantages over traditional Boolean retrieval methods, especially for end users. This approach to retrieval, however, has not seen widespread use in large operational retrieval systems. To show the feasibility of this retrieval methodology, research was done to produce very fast search techniques using these ranking al...
1 Abstract In our rst participation in TREC, our focus was on improving the basic ranking systems and applying text clustering techniques for query expansion. We tested a variety of techiniques including reference measures, passage retrieval, and data fusion for the basic ranking systems. Some te-chiniques were used in the oocial run, others were not used because of time limitations. We applied...
Implementing Powerful Retrieval Capabilities in a Distributed Environment for Libraries and Archives
An on-line distributed environment, which was implemented in the context of the VENIVA project for historical libraries and archives is presented here. Emphasis is given in the presentation of the powerful search capabilities provided to the end-users, which are typical for the end-users (either researchers or ordinary people) of any Digital Library environment. The information managed resides ...
The relevance feedback process uses information obtained from a user about a set of initially retrieved documents to improve subsequent search formulations and retrieval performance. In extended Boolean models, the relevance feedback implies not only that new query terms must be identified and re-weighted, but also that the terms must be connected with Boolean And/Or operators properly. Salton ...
This paper systematically develops the logical and algebraic possibilities inherent in vector space models for language, considerably beyond those which are customarily used in semantic applications such as information retrieval and word sense disambiguation. The cornerstone of the approach lies in a simple implementation of the connectives of quantum logic as introduced by Birkhoff and von Neu...
Thesis Statement This thesis introduces a new full-text document retrieval model based on the use of document signature access structures combined with ranked retrieval methods. Specifically, it investigates the use of term co-occurence as a measure of similarity between the source document signatures and the signatures of the query terms. The co-occurence of terms is shown to be an attribute c...
In this contribution, an information retrieval system (IRS) based on fuzzy multi-granular linguistic information is proposed. The user queries and IRS responses are modelled using different linguistic domains or label sets with different cardinalities and/or semantics. We present a method to process the multigranular linguistic information in the retrieval activity of the IRS. The system accept...
An information retrieval system (IRS) based on fuzzy multi-granular linguistic information is proposed. The system has an evaluation method to process multi-granular linguistic information, in such a way that the inputs to the IRS are represented in a different linguistic domain than the outputs. The system accepts Boolean queries whose terms are weighted by means of the ordinal linguistic valu...
One of the difficulties in using current Boolean-based eration of networks and online databases makes it possible information retrieval systems is that it is hard for a user, to disseminate and retrieve information in fast and easy especially a novice, to formulate an effective Boolean ways. Information updates are often simpler and cheaper query. Query reformulation can be even more difficult ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید