Proposes a new learning algorithm to improve the retrieval effectiveness of the search system used in the hypertext environment using an extended Boolean model with links to improve the ranking of retrieved items. Highlights include the basic retrieval scheme, the learning scheme, and a review of basic probabilistic retrieval models. (Contains 32…

Describes a model for a front end query processor to deal with incomplete information in a database. The effectiveness of the processor in restricting the number of objects to be processed in a query and in aiding the interpretation of a query is discussed. (26 references) (Author/CLB)

Presents a mathematical theory that can be used to define concentration places of objects within unordered classes. The application to research on the evolution of journals and subject areas is illustrated, and an online method of calculating concentration evolution is described. (1 references) (CLB)

Compares the performance of inverted and signature file organizations in handling incrementally specified Boolean queries to an information retrieval system. The discussion covers the impact of more sophisticated signature file organizations, related problems, and possible future work. (65 references) (CLB)

Presents the theoretical aspects of a data analysis methodology that can help transform sequential raw data from a database into useful information, using the statistical analysis of patents as an example. Topics discussed include relational analysis and a technology watch approach. (Contains 17 references.) (LRW)

Discusses end-user searching in Boolean information retrieval systems considers the role of search intermediaries and proposes a model of user preferences that incorporates a user's profile. Highlights include document representation; information queries; document output ranking; calculating user profiles; and selecting documents for a local…

Discusses the problems of compressing a large textual database for storage on CD-ROM. A text-compression algorithm is presented, new algorithms for compression of indices are described, and the ARTFL (American and French Research on the Treasury of the French Language) database is used as an example. (14 references) (LRW)

Describes an interface mechanism called "complex view support" to be used with a relational database system (RDBS) in supporting increasingly complex distributed environments in automated library systems. The interface system refers queries to multidimensional tables as well as to flat tables on RDBS and is shown to efficiently support…

Studies the performance of probabilistic information retrieval systems using differing statistical dependence assumptions when estimating the probabilities inherent in the retrieval model. Experimental results using the Bahadur Lazarsfeld expansion on the Cystic Fibrosis database are discussed that suggest that incorporating term dependence…

Discusses indeterminancy of selection of terms by indexers and by inquirers as major factors influencing subject access to documents in document retrieval systems. Five types of interactions between these two indeterminancies are discussed, and a change in traditional method of subject searching is suggested to reduce effect of inter-indexer…

Discussion of relevancy in information retrieval systems focuses on an analysis of the efficiency of various cluster-based retrieval (CBR) strategies. A method for combining CBR and inverted index search is proposed that is cost effective in terms of time efficiency; and results of experiments are reported. (Contains 32 references.) (LRW)