A general procedure is provided for comparing correlation coefficients between optimal linear composites. The procedure allows computationally efficient significance tests on independent or dependent multiple correlations, partial correlations, and canonical correlations, with or without the assumption of multivariate normality. Evidence from some Monte Carlo studies on the effectiveness of the methods is also provided.

A comprehensive statistical framework is presented which encompasses a wide range of existing nonparametric methods. The basic strategy, referred to as linear assignment (LA), depends on a simple index of correspondence defined between two object sets that have been matched in some a priori manner. In this broad sense, LA can be interpreted as a general correlational technique. A variety of extensions are discussed along with the attendant problems of significance testing and the construction of normalized descriptive indices.

A least-squares algorithm for fitting ultrametric and path length or additive trees to two-way, two-mode proximity data is presented. The algorithm utilizes a penalty function to enforce the ultrametric inequality generalized for asymmetric, and generally rectangular (rather than square) proximity matrices in estimating an ultrametric tree. This stage is used in an alternating least-squares fashion with closed-form formulas for estimating path length constants for deriving path length trees. The algorithm is evaluated via two Monte Carlo studies. Examples of fitting ultrametric and path length trees are presented.

Bootstrap and jackknife techniques are used to estimate ellipsoidal confidence regions of group stimulus points derived from INDSCAL. The validity of these estimates is assessed through Monte Carlo analysis. Asymptotic estimates of confidence regions based on a MULTISCALE solution are also evaluated. Our findings suggest that the bootstrap and jackknife techniques may be used to provide statements regarding the accuracy of the relative locations of points in space. Our findings also suggest that MULTISCALE asymptotic estimates of confidence regions based on small samples provide an optimistic view of the actual statistical reliability of the solution.

The partial derivatives of the squared error loss function for the metric unfolding problem have a unique geometry which can be exploited to produce unfolding methods with very desirable properties. This paper details a simple unidimensional unfolding method which uses the geometry of the partial derivatives to find conditional global minima; i.e., one set of points is held fixed and the global minimum is found for the other set. The two sets are then interchanged. The procedure is very robust. It converges to a minimum very quickly from a random or non-random starting configuration and is particularly useful for the analysis of large data sets with missing entries.

A Monte Carlo study assessed the effect of sampling error and model characteristics on the occurrence of nonconvergent solutions, improper solutions and the distribution of goodness-of-fit indices in maximum likelihood confirmatory factor analysis. Nonconvergent and improper solutions occurred more frequently for smaller sample sizes and for models with fewer indicators of each factor. Effects of practical significance due to sample size, the number of indicators per factor and the number of factors were found for GFI, AGFI, and RMR, whereas no practical effects were found for the probability values associated with the chi-square likelihood ratio test.

This study formulates a property of a quantification method, the principle of equivalent partitioning (PEP). When the PEP is used together with Guttman's principle of internal consistency (PIC) in a simple way, the combination offers an interesting way of analyzing categorical data in terms of the variate(s) chosen by the investigator, a type of canonical analysis. The study discusses applications of the technique to multiple-choice, rank-order, and paired comparison data.

The most widely-used computer programs for structural equation models analysis are the LISREL series of Jöreskog and Sörbom. The only types of constraints which may be made directly are fixing parameters at a constant value and constraining parameters to be equal. Rindskopf (1983) showed how these simple properties could be used to represent models with more complicated constraints, namely inequality constraints on unique variances. In this paper, two new concepts are introduced which enable a much wider variety of constraints to be made. The concepts, “phantom” and “imaginary” latent variables, allow fairly general equality and inequality constraints on factor loadings and structural model coefficients.

Most of the factor solutions can be got by minimizing a corresponding loss function. However, up to now, a loss function for the alpha factor analysis (AFA) has not been known. The present paper establishes such a loss function for the AFA. Some analogies to the maximum likelihood factor analysis are discussed.

Three methods for dual scaling of successive categories data are formulated. They are mathematically equivalent, and provide an appropriate technique to determine stimulus values and category boundaries on a joint scale, a problem that Nishisato's method (1980a) failed to handle.

The purpose of the current paper is to propose a general multicomponent latent trait model (GLTM) for response processes. The proposed model combines the linear logistic latent trait (LLTM) with the multicomponent latent trait model (MLTM). As with both LLTM and MLTM, the general multicomponent latent trait model can be used to (1) test hypotheses about the theoretical variables that underlie response difficulty and (2) estimate parameters that describe test items by basic substantive properties. However, GLTM contains both component outcomes and complexity factors in a single model and may be applied to data that neither LLTM nor MLTM can handle. Joint maximum likelihood estimators are presented for the parameters of GLTM and an application to cognitive test items is described.

In many classification problems, one often possesses external and/or internal information concerning the objects or units to be analyzed which makes it appropriate to impose constraints on the set of allowable classifications and their characteristics. CONCLUS, or CONstrained CLUStering, is a new methodology devised to perform constrained classification in either an overlapping or nonoverlapping (hierarchical or nonhierarchial) manner. This paper initially reviews the related classification literature. A discussion of the use of constraints in clustering problems is then presented. The CONCLUS model and algorithm are described in detail, as well as their flexibility for use in various applications. Monte Carlo results are presented for two synthetic data sets with appropriate discussion of the resulting implications. An illustration of CONCLUS is presented with respect to a sales territory design problem where the objects classified are various Forbes-500 companies. Finally, the discussion section highlights the main contribution of the paper and offers some areas for future research.

Redundancy analysis (also called principal components analysis of instrumental variables) is a technique for two sets of variables, one set being dependent of the other. Its aim is maximization of the explained variance of the dependent variables by a linear combination of the explanatory variables. The technique is generalized to qualitative variables; it then gives implicitly a simultaneous ‘optimal’ scaling of the dependent, qualitative variables. Examples are taken from the Dutch Life Situation Survey 1977, using Satisfaction with Life and Happiness as dependent variables. The analysis leads to one well-being scale, defined by the explanatory variables Marital status, Schooling, Income and Activity.

We introduce an extended multivariate logistic response model for multiple choice items; this model includes several earlier proposals as special cases. The discussion includes a theoretical development of the model, a description of the relationship between the model and data, and a marginal maximum likelihood estimation scheme for the item parameters. Comparisons of the performance of different versions of the full model with more constrained forms corresponding to previous proposals are included, using likelihood ratio statistics and empirical data.

Methods for orthogonal Procrustes rotation and orthogonal rotation to a maximal sum of inner products are examined for the case when the matrices involved have different numbers of columns. An inner product solution offered by Cliff is generalized to the case of more than two matrices. A nonrandom start for a Procrustes solution suggested by Green and Gower is shown to give better results than a random start. The Green-Gower Procrustes solution (with nonrandom start) is generalized to the case of more than two matrices. Simulation studies indicate that both the generalized inner product solution and the generalized Procrustes solution tend to attain their global optima within acceptable computation times. A simple procedure is offered for approximating simple structure for the rotated matrices without affecting either the Procrustes or the inner product criterion.

It is shown that the PAR Derivative-Free Nonlinear Regression program in BMDP can be used to fit structural equation models, producing generalized least squares estimates, standard errors, and goodness-of-fit test statistics. Covariance structure models more general than LISREL can be analyzed. The approach is particularly useful for dealing with new non-standard models and experimenting with alternate methods of estimation.

A general class of differentiation indices is introduced for profiles of scores. Their ordinal properties and an application to Holland's classification system are examined. Comparison with other suggested indices is performed both theoretically and empirically.

The present paper contains a lemma which implies that varimax rotation can be interpreted as a special case of diagonalizing symmetric matrices as discussed in multidimensional scaling. It is shown that the solution by De Leeuw and Pruzansky is essentially equivalent to the solution by Kaiser. Necessary and sufficient conditions for maxima and minima are derived from first and second order partial derivatives. A counter-example by Gebhardt is reformulated and examined in terms of these conditions. It is concluded that Kaiser's method or, equivalently, the method by De Leeuw and Pruzansky is the most attractive method currently available for the problem at hand.

In the application of clustering methods to real world data sets, two problems frequently arise: (a) how can the various contributory variables in a specific battery be weighted so as to enhance some cluster structure that may be present, and (b) how can various alternative batteries be combined to produce a single clustering that “best” incorporates each contributory set. A new method is proposed (SYNCLUS, SYNthesized CLUStering) for dealing with these two problems.