Robust and powerful nonorthogonal analyses

Numerous types of analyses for factorial designs having unequal cell frequencies have been discussed in the literature. These analyses test either weighted or unweighted marginal means which, in turn, correspond to different model comparisons. Previous research has indicated, however, that these analyses result in biased (liberal or conservative) tests when cell variances are heterogeneous. We show how to obtain a generally robust and powerful analysis with any of the recommended nonorthogonal solutions by adapting a modification of the Welch-James procedure for comparing means when population variances are heterogeneous.This research was supported by a Social Sciences and Humanities Research Council (SSHRC) grant (# 410-92-0430) to the first author, a Manitoba Health Research Council Scholar Award and a grant from Natural Sciences and Engineering Research Council to the second author, and a SSHRC Doctoral Fellowship (# 752-92-1628) to the third author. The authors would like to express their gratitude to Joanne Keselman and three anonymous reviewers for their many helpful substantive comments on earlier drafts of this paper.     

教育和心理研究中的多层线性模型

多层线性模型是分析具有层次结构数据的一种新型统计分析技术,与传统统计方法相比,具有模型假设与实际更吻合、结果解释更合理等特点。近年来这一方法的应用逐渐在社会科学的研究中受到重视。文章从多层线性模型的基本假设入手,较系统地介绍了模型参数估计和假设检验的方法,并通过一个具体例子将这一方法与传统回归分析方法相比,进一步说明了多层线性模型在分析具有层次结构数据时的优点。     

The analysis of structural equation models by means of derivative free nonlinear least squares

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. The research of the second author was supported by the NSF grant MCS 83-01587. We wish to thank our referees for some very valuable suggestions.     

Weighted least squares fitting using ordinary least squares algorithms

A general approach for fitting a model to a data matrix by weighted least squares (WLS) is studied. This approach consists of iteratively performing (steps of) existing algorithms for ordinary least squares (OLS) fitting of the same model. The approach is based on minimizing a function that majorizes the WLS loss function. The generality of the approach implies that, for every model for which an OLS fitting algorithm is available, the present approach yields a WLS fitting algorithm. In the special case where the WLS weight matrix is binary, the approach reduces to missing data imputation.This research has been made possible by a fellowship from the Royal Netherlands Academy of Arts and Sciences to the author.     

Principal component analysis of three-mode data by means of alternating least squares algorithms

A new method to estimate the parameters of Tucker's three-mode principal component model is discussed, and the convergence properties of the alternating least squares algorithm to solve the estimation problem are considered. A special case of the general Tucker model, in which the principal component analysis is only performed over two of the three modes is briefly outlined as well. The Miller & Nicely data on the confusion of English consonants are used to illustrate the programs TUCKALS3 and TUCKALS2 which incorporate the algorithms for the two models described.     

Constrained multidimensional scaling inN spaces

A gradient method is used to obtain least squares estimates of parameters of them-dimensional euclidean model simultaneously inN spaces, given the observation of all pairwise distances ofn stimuli for each space. The procedure can estimate an additive constant as well as stimulus projections and the metric of the reference axes of the configuration in each space. Each parameter in the model can be fixed to equal some a priori value, constrained to be equal to any other parameter, or free to take on any value in the parameter space. Two applications of the procedure are described.     

Scale freeness in factor analysis

The notion of scale freeness does not seem to have been well understood in the factor analytic literature. It has been believed that if the loss function that is minimized to obtain estimates of the parameters in the factor model is scale invariant, then the estimates are scale free. It is shown that scale invariance of the loss function is neither a necessary nor a sufficient condition for scale freeness. A theorem that ensures scale freeness in the orthogonal factor model is given in this paper.The authors are grateful for the suggestions of the referees.     

An optimal property of least squares weights in prediction models

In predicting scores fromp > 1 observed scores in a sample of sizeñ, the optimal strategy (minimum expected loss), under certain assumptions, is shown to be based upon the least squares regression weights computed from a previous sample. Letting represent the correlation between and the predicted values , and letting represent the correlation between and a different set of predicted values , where w is any weighting system which is not a function of , it is shown that the probability of being less than cannot exceed .50. The relationship of this result to previous research and practical implications are discussed.     

Constrained DEDICOM

The DEDICOM method for the analysis of asymmetric data tables gives representations that are identified only up to a nonsingular transformation. To identify solutions it is proposed to impose subspace constraints on the stimulus coefficients. Most attention is paid to the case where different subspace constraints are imposed on different dimensions. The procedures are discussed both for the case where the complete table is fitted, and for cases where only offdiagonal elements are fitted. The case where the data table is skew-symmetric is treated separately as well.The research of H. A. L. Kiers has been made possible by a fellowship of the Royal Netherlands Academy of Arts and Sciences. The research of Y. Takane has been supported by the Natural Sciences and Engineering Research Council of Canada, grant number A6394, and by the McGill-IBM Cooperative Grant. The authors are obliged to Richard A. Harshman for helpful comments on an earlier version.     

A monotonically convergent algorithm for factals

Takane, Young, and de Leeuw proposed a procedure called FACTALS for the analysis of variables of mixed measurement levels (numerical, ordinal, or nominal). Mooijaart pointed out that their algorithm does not necessarily converge, and Nevels proposed a new algorithm for the case of nominal variables. In the present paper it is shown that Nevels' procedure is incorrect, and a new procedure for handling nominal variables is proposed. In addition, a procedure for handling ordinal variables is proposed. Using these results, a monotonically convergent algorithm is constructed for FACTALS of any mixture of variables.The authors are obliged to Jos ten Berge for stimulating comments on an earlier version of this paper. The research of H. A. L. Kiers has been made possible by a fellowship of the Royal Netherlands Academy of Arts and Sciences. The research of Y. Takane has been supported by the Natural Sciences and Engineering Research Council of Canada, grant number A6394, and by the McGill-IBM Cooperative Grant.