To date, virtually all techniques appropriate for ordinal data are based on the uniform probability distribution over the permutations. In this paper we introduce and examine an alternative probability model for the distribution of ordinal data. Preliminary to deriving the expectations of Spearman's rho and Kendall's tau under this model, we show how to compute certain conditional expectations of rho and tau under the uniform distribution. The alternative probability model is then applied to ordinal test theory, and the calculation of true scores and test reliability are discussed.

Inference models motivated by the combinatorial chance literature and the concept of object matching may be used in the analysis of a contingency table if the conditional assumption of fixed row and column totals is imposed. More specifically, by developing a matching reinterpretation for several problems of interest in the prediction analysis of cross-classifications—as defined by Hildebrand, Laing and Rosenthal, appropriate significance tests can be given that may differ from those justified by the more common multinomial models. In the course of the paper the distinction between a degree-1 statistic (based on the relationship between single objects) and a degree-2 statistic (based on the relationship between object pairs) is reviewed in some detail. Also, several specializations are presented to topics of current methodological importance in psychology; for instance, a number of references are made to the measurement of nominal scale response agreement between two raters.

A distinction is drawn between redundancy measurement and the measurement of multivariate association for two sets of variables. Several measures of multivariate association between two sets of variables are examined. It is shown that all of these measures are generalizations of the (univariate) squared-multiple correlation; all are functions of the canonical correlations, and all are invariant under linear transformations of the original sets of variables. It is further shown that the measures can be considered to be symmetric and are strictly ordered for any two sets of observed variables. It is suggested that measures of multivariate relationship may be used to generalize the concept of test reliability to the case of vector random variables.

When comparing examinees to a control, the examiner usually does not know the probability of correctly classifying the examinees based on the number of items used and the number of examinees tested. Using ranking and selection techniques, a general framework is described for deriving a lower bound on this probability. We illustrate how these techniques can be applied to the binomial error model. New exact results are given for normal populations having unknown and unequal variances.

A Monte Carlo study was carried out in order to investigate the ability of ALSCAL to recover true structure inherent in simulated proximity measures when portions of the data are missing. All sets of simulated proximity measures were based on 30 stimuli and three dimensions, and selection of missing elements was done randomly. Properties of the simulated data varied according to (a) the number of individuals, (b) the level of random error, (c) the proportion of missing data, and (d) whether the same entries or different entries were deleted for each individual. Results showed that very accurate recovery of true distances, stimulus coordinates, and weight vectors could be achieved with as much as 60% missing data as long as sample size was sufficiently large and the level of random error was low.

A procedure is proposed for approximating attained significance levels of exact conditional tests. The procedure utilizes a sampling from the null distribution of tables having the same marginal frequencies as the observed table. Application of the approximation through a computer subroutine yields precise approximations for practically any table dimensions and sample size.

Social and naturally occurring choice phenomena are often of the “pick-any” type in which the number of choices made by a subject as well as the set of alternatives from which they are chosen is unconstrained. These data present a special analytical problem because the meaning of non-choice among pick-any choice data is always ambiguous: A non-chosen alternative may be either unacceptable, or acceptable but not considered, or acceptable and considered but not chosen. A model and scaling method for these data are introduced, allowing for this ambiguity of non-choice. Subjects are represented as points whose coordinates are proportional to the centroids of the points representing their choices. Alternatives are represented at points whose coordinates are proportional to the centroids of the points representing subjects who have chosen them. This centroid scaling technique estimates multidimensional joint spaces from the pick-any data.

A theorem is presented which gives the range of possible correlations between a common factor and an external variable (i.e., a variable not included in the test battery factor analyzed). Analogous expressions for component (and regression component) theory are also derived. Some situations involving external correlations are then discussed which dramatize the theoretical differences between components and common factors.

Several algorithms for covariance structure analysis are considered in addition to the Fletcher-Powell algorithm. These include the Gauss-Newton, Newton-Raphson, Fisher Scoring, and Fletcher-Reeves algorithms. Two methods of estimation are considered, maximum likelihood and weighted least squares. It is shown that the Gauss-Newton algorithm which in standard form produces weighted least squares estimates can, in iteratively reweighted form, produce maximum likelihood estimates as well. Previously unavailable standard error estimates to be used in conjunction with the Fletcher-Reeves algorithm are derived. Finally all the algorithms are applied to a number of maximum likelihood and weighted least squares factor analysis problems to compare the estimates and the standard errors produced. The algorithms appear to give satisfactory estimates but there are serious discrepancies in the standard errors. Because it is robust to poor starting values, converges rapidly and conveniently produces consistent standard errors for both maximum likelihood and weighted least squares problems, the Gauss-Newton algorithm represents an attractive alternative for at least some covariance structure analyses.

Two revisions of interactive MDS data selection procedures are presented. One revision improves the estimates of the MDS parameters by adding an analysis of the volume of the spatial coordinates of stimuli. Frames of stimuli augmented by an analysis of volume should more nearly surround the swarm of stimulus points. The second revision, based on randomly ordering the list of stimuli, permits more efficient data designs to be selected by reducing the number of judgments collected but never analyzed.

Meredith developed a criterion for weighted procrustes rotation. The solution was given using Lagrange multipliers. We show that the solution can be obtained more simply, and that our approach enables us to transform the orthogonalization problem, also considered by Meredith, to that of minimizing a quadratic form on the unit sphere.

In this note, we describe the iterative procedure introduced earlier by Goodman to calculate the maximum likelihood estimates of the parameters in latent structure analysis, and we provide here a simple and direct proof of the fact that the parameter estimates obtained with the iterative procedure cannot lie outside the allowed interval. Formann recently stated that Goodman's algorithm can yield parameter estimates that lie outside the allowed interval, and we prove in the present note that Formann's contention is incorrect.