A model for longitudinal latent structure analysis is proposed. We assume that test scores for a given mental or attitudinal test are observed for the same individuals at two different points in time. The purpose of the analysis is to fit a model that combines the values of the latent variable at the two time points in a two-dimensional latent density. The correlation coefficient between the two values of the latent variable can then be estimated. The theory and methods are illustrated by a Danish dataset concerning psychic vulnerability.

Four types of metric scales are distinguished: the absolute scale, the ratio scale, the difference scale and the interval scale. A general coefficient of association for two variables of the same metric scale type is developed. Some properties of this general coefficient are discussed. It is shown that the matrix containing these coefficients between any number of variables is Gramian. The general coefficient reduces to specific coefficients of association for each of the four metric scales. Two of these coefficients are well known, the product-moment correlation and Tucker's congruence coefficient. Applications of the new coefficients are discussed.

The linear regression model y=β′x+ ε is reanalyzed. Taking the modest position that β′x is an approximation of the “best” predictor of y we derive the asymptotic distribution of b and R2, under mild assumptions.

The method of derivation yields an easy answer to the estimation of β from a data set which contains incomplete observations, where the incompleteness is random.

A latent class model for rating data is presented which is the analogue of Andrich's binomial Rasch model for Lazarsfeld's latent class analysis (LCA). The response probabilities for the rating categories follow a binomial distribution and depend on class-specific item parameters. The EM-algorithm for parameter estimation as well as goodness of fit tests for the model are described. An example using questionnaire items on interest in physics illustrates the use of the model as an alternative to the latent trait approach of analyzing test data.

While a rotation procedure currently exists to maximize simultaneously Tucker's coefficient of congruence between corresponding factors of two factor matrices under orthogonal rotation of one factor matrix, only approximate solutions are known for the generalized case where two or more matrices are rotated. A generalization and modification of the existing rotation procedure to simultaneously maximize the congruence is described. An example using four data matrices, comparing the generalized congruence maximization procedure with alternative rotation procedures, is presented. The results show a marked improvement of the obtained congruence using the generalized congruence maximization procedure compared to other procedures, without a significant loss of success with respect to the least squares criterion. A computer program written by the author to perform the rotations is briefly discussed.

If a loss function is available specifying the social cost of an error of measurement in the score on a unidimensional test, an asymptotic method, based on item response theory, is developed for optimal test design for a specified target population of examinees. Since in the real world such loss functions are not available, it is more useful to reverse this process; thus a method is developed for finding the loss function for which a given test is an optimally designed test for the target population. An illustrative application is presented for one operational test.

This paper brings together and compares two developments in the analysis of Likert attitude scales. The first is the generalization of latent class models to ordered response categories. The second is the introduction of latent trait models with multiplicative parameter structures for the analysis of rating scales. Key similarities and differences between these two methods are described and illustrated by applying a latent trait model and a latent class model to the analysis of a set of “life satisfaction” data. The way in which the latent trait model defines a unit of measurement, takes into account the order of the response categories, and scales the latent classes, is discussed. While the latent class model provides better fit to these data, this is achieved at the cost of a logically inconsistent assignment of individuals to latent classes.

A procedure for computing the power of the likelihood ratio test used in the context of covariance structure analysis is derived. The procedure uses statistics associated with the standard output of the computer programs commonly used and assumes that a specific alternative value of the parameter vector is specified. Using the noncentral Chi-square distribution, the power of the test is approximated by the asymptotic one for a sequence of local alternatives. The procedure is illustrated by an example. A Monte Carlo experiment also shows how good the approximation is for a specific case.

We discuss a variety of methods for quantifying categorical multivariate data. These methods have been proposed in many different countries, by many different authors, under many different names. In the first major section of the paper we analyze the many different methods and show that they all lead to the same equations for analyzing the same data. In the second major section of the paper we introduce the notion of a duality diagram, and use this diagram to synthesize the many superficially different methods into a single method.

The purpose of this note is to show that Van den Wollenberg's method of redundancy analysis is a special case of a simultaneous linear prediction method offered by Fortier.

An algorithm for generating artificial data sets which contain distinct nonoverlapping clusters is presented. The algorithm is useful for generating test data sets for Monte Carlo validation research conducted on clustering methods or statistics. The algorithm generates data sets which contain either 1, 2, 3, 4, or 5 clusters. By default, the data are embedded in either a 4, 6, or 8 dimensional space. Three different patterns for assigning the points to the clusters are provided. One pattern assigns the points equally to the clusters while the remaining two schemes produce clusters of unequal sizes. Finally, a number of methods for introducing error in the data have been incorporated in the algorithm.