Describes a new combinatorial algorithm for fitting additive trees to proximity data. This generalized triples method examines all triples of objects of interest in relation to the remaining set of objects to be clustered. The procedure is illustrated, and a simulation study shows its advantages. (SLD)

Provides a comprehensive, nontechnical overview of the three maximum likelihood algorithms available for use with missing data and discusses multiple imputation, frequently used in conjunction with the EM algorithm. (SLD)

The document describes the ALMO programing language. (Author)

An earlier model which proposed to determine the optimum number of shelves to minimize shelving cost of a book collection does not always yield optimal value. Underlying assumptions from this earlier model, which aren't always practical, are discussed, and algorithms providing a better solution for the same problem are presented. (Author)

Historical review of the development and dissemination of ordinary-language algorithms. (STS)

Early analysis sought to identify tasks while recent techniques focus upon analysis of the content of tasks and are more prescriptive. Examples of such analysis appropriate to sequential tasks, one behavior chain task and one algorithm task, are presented to illustrate the prescriptive function of content analysis. (Author)

Investigates techniques for automatic coding of English language strings which involve titles drawn from bibliographic files, but do not require prior knowledge of source. Coding methods (basic, maximum entropy principle), results of test using 6,260 titles from British National Bibliography, and variations in code element ordering are…

Frequently it is useful to abbreviate or otherwise transform keys used for information retrieval. Given a transformation algorithm and data to be transformed, certain qualities of the algorithm relating to retrieval problems can be characterized. This paper gives some measures of effectiveness of such transformation algorithms. (11 references)…

An algorithm, using a short cut due to Feldman and Klingler, for the Fisher-Yates exact test is presented. The algorithm is quick, simple and accurate. (Author)

The residual variance is often used as an approximation to the uniqueness in factor analysis. An upper bound approximation to the residual variance is presented for the case when the correlation matrix is singular. (Author/JKS)

Efron's Monte Carlo bootstrap algorithm is shown to cause degeneracies in Pearson's r for sufficiently small samples. Two ways of preventing this problem when programing the bootstrap of r are considered. (Author)

Describes a system for the automatic coding of most descriptive titles which generates Nested Phrase Indexing System (NEPHIS) input strings of sufficient quality for permuted index production. A series of examples and an 11-item reference list accompany the text. (JL)

The method proposed by Harman and Fukuda to treat the so-called Heywood case in the minres method in factor analysis (i.e., the case where the resulting communalities are greater than one) involves the frequent solution of eigenvalue problems. A simple method to treat this problem is presented. (Author/JKS)