It is known that the Maxbet algorithm, which is an alternative to the method of generalized canonical correlation analysis and Procrustes analysis, may converge to local maxima. Discusses an eigenvalue criterion that is sufficient, but not necessary, for global optimality of the successive Maxbet algorithm. (SLD)

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)

Comments on P. Arabie's article, "Concerning Monte Carlo Evaluations of Nonmetric Multidimensional Scaling Algorithms.", Psychometrika, 1973, 38, 607-8. (RC)

A formula for the determinant of a partitioned matrix, possibly with singular submatrices, is derived and applied to some psychometric and numerical problems. (Author)

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)

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)

Defines a random effects diagonal metric multidimensional scaling model, gives its computational algorithms, describes researchers' experiences with these algorithms, and provides an illustration of the use of the model and algorithms. (Author/SLD)

Identifies a general algorithm for orthogonal rotation and shows that when an algorithm parameter alpha is sufficiently large, the algorithm converges monotonically to a stationary point of the rotation criterion from any starting value. Introduces a modification that does not require a large alpha and discusses the use of this modification as a…

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)