Current practice in structural modeling of observed continuous random variables is limited to representation systems for first and second moments (e.g., means and covariances), and to distribution theory based on multivariate normality. In psychometrics the multinormality assumption is often incorrect, so that statistical tests on parameters, or model goodness of fit, will frequently be incorrect as well. It is shown that higher order product moments yield important structural information when the distribution of variables is arbitrary. Structural representations are developed for generalizations of the Bentler-Weeks, Jöreskog-Keesling-Wiley, and factor analytic models. Some asymptotically distribution-free efficient estimators for such arbitrary structural models are developed. Limited information estimators are obtained as well. The special case of elliptical distributions that allow nonzero but equal kurtoses for variables is discussed in some detail. The argument is made that multivariate normal theory for covariance structure models should be abandoned in favor of elliptical theory, which is only slightly more difficult to apply in practice but specializes to the traditional case when normality holds. Many open research areas are described.

Kristof has derived a theorem on the maximum and minimum of the trace of matrix products of the form \documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$X_1 \hat \Gamma _1 X_2 \hat \Gamma _2\cdots X_n \hat \Gamma _n$$\end{document} where the matrices \documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$\hat \Gamma _i$$\end{document} are diagonal and fixed and the Xi vary unrestrictedly and independently over the set of orthonormal matrices. The theorem is a useful tool in deriving maxima and minima of matrix trace functions subject to orthogonality constraints. The present paper contains a generalization of Kristof's theorem to the case where the Xi are merely required to be submatrices of orthonormal matrices and to have a specified maximum rank. The generalized theorem contains the Schwarz inequality as a special case. Various examples from the psychometric literature, illustrating the practical use of the generalized theorem, are discussed.

The problem of predicting universe scores for samples of examinees based on their responses to samples of items is treated. A general measurement procedure is described in which multiple test forms are developed from a table of specifications and each form is administered to a different sample of examinees. The measurement model categorizes items according to the cells of such a table, and the linear function derived for minimizing error variance in prediction uses responses to these categories. In addition, some distinctions are drawn between aspects of the approach taken here and the familiar regressed score estimates.

For the clustering problem with general (not necessarily symmetric) relational constraints, different sets of feasible clusterings, also called clustering types, determined by the same relation, can be defined. In this paper some clustering types are discussed and adaptations of the hierarchical clustering method compatible with these clustering types are proposed.

After introducing some extensions of a recently proposed probabilistic vector model for representing paired comparisons choice data, an iterative procedure for obtaining maximum likelihood estimates of the model parameters is developed. The possibility of testing various hypotheses by means of likelihood ratio tests is discussed. Finally, the algorithm is applied to some existing data sets for illustrative purposes.

Latent trait models for binary responses to a set of test items are considered from the point of view of estimating latent trait parameters θ= (θ1, …, θn) and item parameters β=(β1, …, βk), where βj may be vector valued. With θ considered a random sample from a prior distribution with parameter ϕ, the estimation of (θ, β) is studied under the theory of the EM algorithm. An example and computational details are presented for the Rasch model.

Consider a set of data consisting of measurements of n objects with respect to p variables displayed in an n × p matrix. A monotone transformation of the values in each column, represented as a linear combination of integrated basis splines, is assumed determined by a linear combination of a new set of values characterizing each row object. Two different models are used: one, an Eckart-Young decomposition model, and the other, a multivariate normal model. Examples for artificial and real data are presented. The results indicate that both methods are helpful in choosing dimensionality and that the Eckart-Young model is also helpful in displaying the relationships among the objects and the variables. Also, results suggest that the resulting transformations are themselves illuminating.

A new algorithm to obtain the least-squares or MINRES solution in common factor analysis is presented. It is based on the up-and-down Marquardt algorithm developed by the present authors for a general nonlinear least-squares problem. Experiments with some numerical models and some empirical data sets showed that the algorithm worked nicely and that SMC (Squared Multiple Correlation) performed best among four sets of initial values for common variances but that the solution might sometimes be very sensitive to fluctuations in the sample covariance matrix.

A logit vector model and a logit ideal point model are presented for external analysis of paired comparison preference judgments aggregated over a homogeneous group. The logit vector model is hierarchically nested within the logit ideal point model so that statistical tests are available to distinguish between these two models. Generalized least squares estimation procedures are developed to account for heteroscedastic sampling error variances and specification error variances. Two numerical illustrations deal with judgments concerning employee compensation plans and preferences for salt and sugar in the brine of canned green beans.

A least squares algorithm for fitting additive trees to proximity data is described. The algorithm uses a penalty function to enforce the four point condition on the estimated path length distances. The algorithm is evaluated in a small Monte Carlo study. Finally, an illustrative application is presented.

A modified version of a coordinate adjustment technique which permits the analysis of comparisons of psychological intervals for an unknown ordering of stimuli is described and compared to the original version and to TORSCA. For configurations with a large number of points, knowledge of the rank order of the stimuli does not improve the solution. For configurations with a small number of points, the performance of the new algorithm with an unknown ordering is equivalent to TORSCA.

Verhelst derived a solution for a constrained regression problem which occurs in the interval measurement application of ALSCAL and related MDS-algorithms. In the present paper it is shown that Verhelst's solution is based on an implicit nonsingularity assumption. A general solution, which contains Verhelst's solution as a special case, is derived by a simple completing-the-squares type approach instead of partial differentiation with a Lagrange multiplier. In addition, this approach permits the identification of a small interval which uniquely contains the optimal value of a parameter needed to solve the special case where Verhelst's solution is valid.

A paradoxical implication of Kraemer's expression for the large-sample standard error of Brogden's form of the biserial correlation is identified, and a new expression is given which does not imply the paradox. However, numerical evidence is presented which calls into question the correctness of the expression.