In order to better grasp the needs of library users and provide them with more accurate knowledge services, combining the characteristics of university libraries, this article applies library small data to personalized recommendation and proposes a small data fusion algorithm model for library personalized recommendation. This model combines the…

Describes the two basic approaches to the calculation of term discrimination values for automatic indexing. The results of an experiment that investigated the differences between algorithms of these two approaches in terms of their impact on the discrimination value model are reported and discussed. (13 references) (Author/CLB)

Presents two new algorithms for performing arithmetic coding without employing multiplication and discusses their implementation requirements. The first algorithm, suitable for an alphabet of arbitrary size, reduces the worst case excess length to under 0.8%. The second algorithm, suitable only for alphabets of less than 12 symbols, allows even…

Demonstrates efficiency of preparation of query description using semantic analyser method based on analysis of semantic structure of documents in field of automatic indexing. Results obtained are compared with automatic indexing results performed by traditional methods and results of indexing done by human indexers. Sample terms and codes are…

A method of two-stage clustering of literature based on citation frequency is applied to 5,065 articles from 57 journals in environmental and civil engineering. Results of related methods of citation analysis (hierarchical graph, clustering of journals, multidimensional scaling) applied to same set of articles are compared. Ten references are…

Investigates the value of applying principles derived from simulated annealing to clustering tuples in database design, and compares this technique with a graph-collapsing clustering method. It is concluded that, while the new method does give superior results, the expense involved in algorithm run time is prohibitive. (24 references) (CLB)

Describes and discusses the findings of an experiment that tested the precision of full-text retrieval enhanced by 29 document term weighting algorithms at the lowest, middle, and highest levels of recall, and compared with the precision of full-text retrieval without algorithms and with paragraph retrieval. (29 references) (Author/CLB)

Analyzes the properties of genetic sequences that cause the failure of classical algorithms used for data compression. A lossless algorithm, which compresses the information contained in DNA and RNA sequences by detecting regularities such as palindromes, is presented. This algorithm combines substitutional and statistical methods and appears to…

This project examines anaphora (the linguistic device of abbreviated subsequent reference to a concept) in information retrieval (IR) systems in order to develop procedures to recognize anaphors in text and distinguish between anaphoric and non-anaphoric uses of a given term, estimate the number of anaphors appearing in bibliographic records, and…

Discusses the results of modeling the performance of searching large text databases via various parallel hardware architectures and search algorithms. The performance under load and the cost of each configuration are compared, and a common search workload used in the modeling is described. (Contains 26 references.) (LRW)

Describes an experiment that was designed to compare three different map displays used as a visual display for information retrieval by either a self-organizing algorithm or human subjects. Results indicate that the organization and visual appearance of map displays had a significant effect on subjects' searching and browsing on the map displays.…

Considers classifications produced by application of single linkage, complete linkage, group average, and word clustering methods to Keen and Cranfield document test collections, and studies structure of hierarchies produced, extent to which methods distort input similarity matrices during classification generation, and retrieval effectiveness…

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)

Evaluates and compares two recently proposed automatic methods for relevance feedback of Boolean queries (Dillon method, which uses probabilistic approach as basis, and disjunctive normal form method). Conclusions are drawn concerning the use of effective feedback methods in a Boolean query environment. Nineteen references are included. (EJS)

This study compared the efficiency (time) and accuracy of two representations of instructional algorithms--list versus flow chart--for the task of using indexes to search for document numbers in the U.S. Documents Monthly Catalog. Participants were 55 undergraduates and 5 adults at the Virginia Military Institute. Two sets (flow charts and lists)…