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)

Two alternating least squares algorithms are presented for the simultaneous components analysis method of R. E. Millsap and W. Meredith (1988). These methods, one for small data sets and one for large data sets, can indicate whether or not a global optimum for the problem has been attained. (SLD)

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…

ORDMET is applicable to structures obtained from additive conjoint measurement designs, unfolding theory, general Fechnerian scaling, types of multidimensional scaling, and ordinal multiple regression. A description is obtained of the space containing all possible numerical representations which can satisfy the structure, size, and shape of which…

A procedure is described for minimizing a class of matrix trace functions, which is a refinement of an earlier procedure for minimizing the class of matrix trace functions using majorization. Several trial analyses demonstrate that the revised procedure is more efficient than the earlier majorization-based procedure. (SLD)

A model for the analysis of paired comparison data is presented which is metric, mathematically tractable, and has an exact algebraic solution. (Authors/MB)

The details of EM algorithms for maximum likelihood factor analysis are presented for both the exploratory and confirmatory models. An example is presented to demonstrate potential problems in other approaches to maximum likelihood factor analysis. (Author/JKS)

The present paper discusses two rather different types of partitioning techniques that still have the same property of monotone invariance. (Author)

Paper is an attempt to extend the hierarchical partitioning algorithms and to emphasize a general connection between these clustering procedures and the mathematical theory of lattices. (Author)

A new method to estimate the parameters of Tucker's three mode principal component model is discussed, and the convergence properties of the alternating least squares algorithm to solve the estimation problem are considered. An example is presented. (Author/JKS)