|Statement||G. Salton, E. Fox, and H. Wu.|
|Series||Technical report / Dept. of Computer Science, Cornell University -- TR 82-511, Technical report (Cornell University. Dept. of Computer Science) -- TR 82-511|
|Contributions||Fox, Edward A. 1950-, Wu, Harry Chih Chien.|
|The Physical Object|
|Pagination||49 p. :|
|Number of Pages||49|
Extended boolean models such as fuzzy set, Waller-Kraft, Paice, P-Norm and Infinite-One have been proposed in the past to support ranking facility for the boolean retrieval system. In this paper, we analyze the behavioural aspects of the previous extended boolean models and address important mathematical properties to affect retrieval by: In this contribution an analysis of the extended Boolean information retrieval models will be presented in the unique formal framework of fuzzy set theory. These models share the characteristics of numeric weights in both document representation and queries: nevertheless, they differ in the semantics adopted for query by: 5. ABSTRACT: A new, extended Boolean information-retrieval system is introduced that intermediate between the Boolean system of query processing and the vector-processing model. The query structure inherent in the Boolean system is preserved, while at the same time weighted terms may be incorporated into both queries andFile Size: 1MB. Information Processing & Management 24(3), FOX, E. A. "Extending the Boolean and Vector Space Models of Information Retrieval with P-Norm Queries and Multiple Concept Types." Cornell University, August. FOX, E. A., and S. SHARAT. "A Comparison of Two Methods for Soft Boolean Interpretation in Information Retrieval.".
The extended Boolean model versus ranked retrieval The Boolean retrieval model contrasts with ranked retrieval models such as the vector space model (Section ), in which users largely use free text queries, that is, just typing one or more words rather than using a precise language with operators for building up query expressions, and the system decides which . Keywords: Information retrieval, extended Boolean retrieval, p-norm, effectiveness, systematic review, biomedical. 1 Introduction Web search is one of the most prominent Information Retrieval (IR) applications. Typical question-answering scenarios are well supported by ranking highly the docu-ments thatnot onlylookrelevantbytheircontent,butalso. The extended Boolean system is illustrated by examples and evaluation output is used to demonstrate the effectiveness of the operations. References G. Salton, E.A. Fox and H. Wu, Extended Boolean Information Retrieval, Communications of the ACM, Vol. 26, No. 11, November , p. Author: SaltonGerard. Kim MH, Lee JH, Lee YJ. Analysis of fuzzy operators for high quality information retrieval. Information Processing Letters ; 46(5) Google Scholar Digital Library; Lee JH, Kim WY, Kim MH, Lee YJ. On the evaluation of boolean operators in the extended boolean retrieval framework.
Next: An example information retrieval Up: irbook Previous: Web and contact information Contents Index Boolean retrieval The meaning of the term information retrieval can be very broad. Just getting a credit card out of your wallet so that you can type in the card number is a form of information retrieval. The retrieval models based on the extended boolean retrieval framework, e.g., the fuzzy set model and the extended boolean model have been proposed in the past to provide the conventional boolean retrieval system with the document ranking facility. Extended Boolean Operations in Latent Semantic Indexing Search Jivko Steftchev Jeliazkov Preslav Ivanov Nakov Abstract. The paper presents method for the usage of Boolean expressions for information retrieval based on Latent Semantic Indexing (LSI). The basic binary Boolean expressions such as OR, AND and NOT(AND-Cited by: 1. Inexact top K document retrieval; Index elimination; Champion lists; Static quality scores and ordering; Impact ordering; Cluster pruning. Components of an information retrieval system. Tiered indexes; Query-term proximity; Designing parsing and scoring functions; Putting it all together. Vector space scoring and query operator interaction. Boolean retrieval.