Based on a simple nonparametric procedure for comparing two proximity matrices, a measure of concordance is introduced that is appropriate when K independent proximity matrices are available. In addition to the development of a general concept of concordance and specific techniques for its evaluation within and between the subsets of a partition of the K matrices, several methods are also suggested for comparing and/or for fitting a particular structure to the given data. Finally, brief indications are provided as to how the well-known notion of concordance for K rank orders can be included within the more general framework.

A method is presented to provide estimates of parameters of specified nonlinear equations from ordinal data generated from a crossed design. The analytic method, NOPE, is an iterative method in which monotone regression and the Gauss-Newton method of least squares are applied alternatively until a measure of stress is minimized. Examples of solutions from artificial data are presented together with examples of applications of the method to experimental results.

The issue of factor indeterminacy, and its meaning and significance for factor analysis, has been the subject of considerable debate in recent years. Interestingly, the identical issue was discussed widely in the literature of the late 1920's and early 1930's, but this early discussion was somehow lost or forgotten during the development and popularization of multiple factor analysis. There are strong parallels between the arguments in the early literature, and those which have appeared in recent papers. Here I review the history of this early literature, briefly survey the more recent work, and discuss these parallels where they are especially illuminating.

A new subroutine has been developed for calculating the terachoric correlation coefficient. Recent advances in computing inverse normal and bivariate normal distributions have been utilized. The iterative procedure is started with an approximation with an error less than ±.0135.

It is shown that for nonpositive values of the parameter γ in the oblimin criterion, the criterion achieves a minimum on the manifold of all possible oblique rotations of any given full rank initial loading matrix A. For every positive value of γ, on the other hand, it is shown that there exists a full rank initial loading matrix A for which the oblimin criterion does not achieve a minimum over the manifold of all oblique rotations of A. These results help explain the sometimes divergent behavior that results from using direct oblimin algorithms with γ set to a positive value.

Assuming that subject responses rank order stimuli by preference, statistical methods are presented for testing the hypothesis that responses conform to a unidimensional, qualitative unfolding model and to an a priori stimulus ordering. The model postulates that persons and stimulus variables are ordered along a single continuum and that subjects most prefer stimuli nearest their own position. The underlying continuum need not form an interval scale of the stimulus attribute. The general assumptions of the test for the unfolding model make it suitable for the analysis of structure in attitude responses, preference data, and developmental stage data.

Synthetic data are used to examine how well axiomatic and numerical conjoint measurement methods, individually and comparatively, recover simple polynomial generators in three dimensions. The study illustrates extensions of numerical conjoint measurement (NCM) to identify and model distributive and dual-distributive, in addition to the usual additive, data structures. It was found that while minimum STRESS was the criterion of fit, another statistic, predictive capability, provided a better diagnosis of the known generating model. That NCM methods were able to better identify generating models conflicts with Krantz and Tversky's assertion that, in general, the direct axiom tests provide a more powerful diagnostic test between alternative composition rules than does evaluation of numerical correspondence. For all methods, dual-distributive models are most difficult to recover, while consistent with past studies, the additive model is the most robust of the fitted models.

Conditions are given under which the stationary points and values of a ratio of quadratic forms in two singular matrices can be obtained by a series of simple matrix operations. It is shown that two classes of optimal weighting problems, based respectively on the grouping of variables and on the grouping of observations, satisfy these conditions. The classical treatment of optimal scaling of forced-choice multicategory data is extended for these cases. It is shown that previously suggested methods based on reparameterization will work only under very special conditions.

Consider a repeated measurements study in which a single observation is taken at each of t(t > 2) equally spaced time points for each of n subjects. This paper uses a result of Box to find the appropriate multiplicative correction term for the degrees of freedom in the analysis of variance table for the case when there is equal variability per time point, and when the correlation between observations u time units apart is equal to ρu. For large values of t, the multiplicative correction has a lower bound approximately equal to 2.5/(t − 1).

The hypothesis that two variables have a perfect disattenuated correlation and hence measure the same trait, except for errors of measurement, is discussed. Equivalently, the underlying variables, the true scores, are related linearly. We show that several previously proposed ad hoc tests are in fact likelihood ratio tests. The cases when the linear relation is specified and when it is unspecified are both discussed.

Two least squares procedures for symmetrization of a conditional proximity matrix are derived. The solutions provide multiplicative constants for scaling the rows or columns of the matrix to maximize symmetry. It is suggested that the symmetrization is applicable for the elimination of bias effects like response bias, or constraints on the marginal frequencies imposed by the experimental design, as in confusion matrices.

Recently there has been interest in the problem of determining an optimal passing score for a mastery test when the purpose of the test is to predict success or failure on an external criterion. For the case of constant losses for the two error types, a method of determining an optimal passing score is readily derived using standard techniques. The purpose of this note is to describe a lower bound to the probability of identifying an optimal passing score based on a random sample of N examinees.

Use of the same term “split-half” for division of an n-item test into two subtests containing equal [Cronbach], and possibly unequal [Guttman], numbers of items sometimes leads to a misunderstanding about the relation between Guttman’s maximum split-half bound and Cronbach’s coefficient alpha.

Coefficient alpha is the average of split-half bounds in the Cronbach sense and so is not larger than the maximum split-half bound in either sense when n is even. When n is odd, however, splithalf bounds exist only in the Guttman sense and the largest of these may be smaller than coefficient alpha.