Describes two similarity measures used in citation and co-citation analysis--the Jaccard index and Salton's cosine formula--and investigates the relationship between the two measures. It is shown that Salton's formula yields a numerical value that is twice Jaccard's index in most cases, and an explanation is offered. (13 references) (CLB)

Describes a string-searching algorithm for multiple patterns in a text string; explains the construction of a pattern-matching machine; presents a theoretical analysis and empirical evidence that supports the sublinearity of the algorithm; and compares this algorithm with the Boyer-Moore algorithm for a single pattern. (Contains 10 references.)…

Identifies four components of a good predictive lossless image compression method: (1) pixel sequence, (2) image modeling and prediction, (3) error modeling, and (4) error coding. Highlights include Laplace distribution and a comparison of the multilevel progressive method for image coding with the prediction by partial precision matching method.…

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 new methods for compressing bit matrices in large information retrieval systems which exploit possible correlations between rows of words and columns of documents. Three encoding methods are tested and compared--Shannon-Fano, arithmetic, and Huffman--and an appendix discusses binomial coefficients. (20 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 PRECALL, PRR (probability of relevance given retrieval), and EP (expected precision) approaches for dealing with the problem of weak ordering in information retrieval systems. Findings of two experiments comparing evaluation results obtained by PRR and EP are reported. Several mathematical formulas and proofs are included. (20…

Investigates document ranking methods in thesaurus-based Boolean information retrieval systems and proposes a new thesaurus-based ranking algorithm called the Extended Relevance algorithm. Performance comparisons are made between the Extended Relevance algorithm and previous thesaurus-based ranking algorithms. (Contains 20 references.) (LRW)

Discussion of search strategies in information retrieval systems focuses on the implementation of document ranking based on inverted files. Highlights include descriptions of three heuristic methods for implementing a weighting strategy and a comparison of two methods for estimating retrieval accuracy, including document movement and linear…

Discussion of informetric distributions shows that generalized Leimkuhler functions give proper fits to a large variety of Bradford curves, including those exhibiting a Groos droop or a rising tail. The Kolmogorov-Smirnov test is used to test goodness of fit, and least-square fits are compared with Egghe's method. (Contains 53 references.) (LRW)

Describes an investigation of the use of document components, such as terms, sentences, and whole documents, for indexing and retrieval. A number of probabilistic similarity measures based on document components are studied, as well as a new method of handling probability estimations involving small sample sizes. (24 references) (Author/CLB)

Discusses the use of citation networks for constructing measures of the relative standing of journals in scientific journal-to-journal networks. Topics addressed include eigenvectors; measuring the standing of national scientific communities; and an empirical comparison of two measures of standing, one considering the environment and one without…

Describes three models for probabilistic indexing, all based on the Darmstadt automatic indexing approach, and presents experimental evaluation results for each. The discussion covers the improved retrieval effectiveness of probabilistic indexing over binary indexing, and suggestions for using this automatic indexing method with free text terms.…

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)