Developed a branch-and-bound algorithm that can be used to seriate a symmetric dissimilarity matrix by identifying a reordering of rows and columns of the matrix optimizing an anti-Robinson criterion. Computational results suggest that with respect to computational efficiency, the approach is generally competitive with dynamic programming. (SLD)

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 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)

Several algorithms for computing the greatest lower bound to reliability or the constrained minimum-trace communality solution in factor analysis have been developed. The convergence properties of these methods are examined. A uniqueness proof for the desired solution is offered. (Author/JKS)

Two algorithms based on a latent class model are presented for discovering hierarchical relations that exist among a set of dichotomous items. The algorithms presented, and three competing deterministic algorithms are compared using computer-generated data. (Author/JKS)

The polyserial and point polyserial correlations are discussed as generalizations of the biserial and point biserial correlations. The relationship between the polyserial and point polyserial correlation is derived. Some practical applications of the polyserial correlation are described. (Author/JKS)

Johnson has shown that the single linkage and complete linkage hierarchical clustering algorithms induce a metric on the data known as the ultrametric. Johnson's proof is extended to four other common clustering algorithms. Two additional methods also produce hierarchical structures which can violate the ultrametric inequality. (Author/CTM)

Six different algorithms to generate widely different non-normal distributions are reviewed. These algorithms are compared in terms of speed, simplicity, and generality of the technique. The advantages and disadvantages of using these algorithms are briefly discussed. (Author)

Bond criticized the base-free measure of change proposed by Tucker, Damarin, and Messick by pointing to an incorrect derivation which is here viewed instead as a correct derivation entailing an inadequately specified assumption. Bond's revision leads to negatively biased estimates, whereas the original approach leads to unbiased estimates.…

A new algorithm to obtain the least squares solution in common factor analysis is presented. It is based on the up-and-down Marquadt algorithm developed by the present authors. Experiments in the use of the algorithm under various conditions are discussed. (Author/JKS)

Confirmatory factor analysis is considered from a Bayesian viewpoint, in which prior information concerning parameters is incorporated in the analysis. An interactive algorithm is developed to obtain the Bayesian estimates. A numerical example is presented. (Author/JKS)

The concept of sequential estimation is introduced in multidimensional scaling. The sequential estimation method developed in this paper refers to continually updating estimates of a configuration as new observations are added. Using artificial data, the performance of this sequential method is illustrated. (Author/JKS)

A general class of nonhierarchical clustering models and associated algorithms for fitting them are presented. These models generalize the Shepard-Arabie Additive clusters model. Two applications are given and extensions to three-way models, nonmetric analyses, and other model specifications are provided. (Author/JKS)

A method for externally constraining certain distances in multidimensional scaling configurations is introduced and illustrated. The method is described in detail and several examples are presented. (Author/JKS)

A new algorithm is used to test and describe the set of all possible solutions for any linear model of an empirical ordering derived from techniques such as additive conjoint measurement, unfolding theory, general Fechnerian scaling, and ordinal multiple regression. The algorithm is computationally faster and numerically superior to previous…