A model is proposed in which different sets of linear constraints are imposed on different dimensions in component analysis and classical multidimensional scaling frameworks. An algorithm is presented for fitting the model to the data by least squares. Examples demonstrate the method. (SLD)

Describes an approach that combines concepts from information retrieval, fuzzy set theory, and genetic programing to improve weighted Boolean query formulation via relevance feedback. Highlights include background on information retrieval systems; genetic algorithms; subproblem formulation; and preliminary results based on a testbed. (Contains 12…

This learning activity develops algorithms to ensure that the process of selecting materials is well defined and sound. These procedures require the use of many databases to provide the designer with information such as physical, mechanical, and chemical properties of the materials under consideration. A design brief, student quiz, and five…

Described are ways that errors of magnitude can be unwittingly caused when using various supercalculator algorithms to solve linear systems of equations that are represented by nearly singular matrices. Precautionary measures for the unwary student are included. (JJK)

Reports on the validity of the Multiple Poisson (nP) model of word distribution in full-text document collections. A practical algorithm for determining whether a certain word is distributed according to an nP distribution and the results of a test of this algorithm in three different document collections are described. (14 references) (KRN)

An algorithm based on the majorization theory of J. de Leeuw and W. J. Heiser is presented for fitting the slide-vector model. It views the model as a constrained version of the unfolding model. A three-way variant is proposed, and two examples from market structure analysis are presented. (SLD)

Describes the theoretical framework of a retrieval system that uses data structures called bitmaps to improve search algorithms for medium-sized systems. Information retrieval systems that contain the full text of the documents are discussed, and the use of inverted files such as concordances for small texts is explained. (24 references) (LRW)

This issue contains nine articles that provide an overview of trends and research in parallel information retrieval. Topics discussed include network design for text searching; the Connection Machine System; PThomas, an adaptive information retrieval system on the Connection Machine; algorithms for document clustering; and system architecture for…

Describes fast, dynamic update algorithms for document retrieval systems. B-trees are discussed; the M-B-T file directory structure is explained; insertions and deletions in inverted files are described; and performance evaluation is discussed. An appendix provides the formal definition of an M-B-T directory. (Contains 18 references.) (LRW)

A new procedure is proposed for handling nominal variables in the analysis of variables of mixed measurement levels, and a procedure is developed for handling ordinal variables. Using these procedures, a monotonically convergent algorithm is constructed for the FACTALS method for any mixture of variables. (SLD)

Presents a technique for developing a knowledge-base of information to use in an expert system. Proposed approach employs a popular machine-learning algorithm along with a method for forming a finite number of features or conjuncts of at most n primitive attributes. Illustrates this procedure by examining qualitative information represented in a…

Discusses the development of an algorithm for an equitable distribution of state prevention funds to its substate jurisdiction based on the need for prevention services. Suggests that the final decision on the level of funding must be based on the selection of the schedule for resource allocation rather than the suggested amount or level of…

Presents a relevance-feedback strategy that improves the effectiveness of information-retrieval systems based on back-propagation of the relevance of retrieved documents using an algorithm developed in a neural approach. Describes a neural information-retrieval model and reports results obtained with the algorithm in three different environments.…

Investigates methods for the correct and efficient handling of annotations in a full-text information-retrieval system in a hypertext environment. Goals were to increase relevant items retrieved, reduce non-relevant items, permit selective retrieval, and to explore the notion of distance between words as given in the distance-evaluation algorithm.…

Discussion of electronic news available on the World Wide Web focuses on a methodology of associating news documents using similarity measures and a name-phrase algorithm to create news representations that can be compared and ranked to find related news items. Considers precision over recall and interactivity with the users. (Author/LRW)