独体汉字的字形相似性研究

本文以速示呈现方式获得了一系列独体汉字和字符的混淆矩阵。用Luce（1963）的选择模型特混淆矩阵分解为对称的相似矩阵和反应倾向矢量。基于相似矩阵,以聚类分析和多维量表法探索了汉字和字符的视觉特征及其表征形式,为揭示汉字视觉特征的几何特性和潜在结构,在研究方法上作了有意义的偿试、此外,本研究的结果支持了作者（1995）关于在含“十”或“口”的独体汉字中,“十”与“口”是该类汉字的突出视觉特征的结论。     

A note on the factor analysis of partial covariance matrices

A relationship is given between the joint common factor structure of two sets of variables, and the factor structure of the partial covariance matrix of one of the sets with the other partialled out.     

A direct approach to individual differences scaling using increasingly complex transformations

A family of models for the representation and assessment of individual differences for multivariate data is embodied in a hierarchically organized and sequentially applied procedure called PINDIS. The two principal models used for directly fitting individual configurations to some common or hypothesized space are the dimensional salience and perspective models. By systematically increasing the complexity of transformations one can better determine the validities of the various models and assess the patterns and commonalities of individual differences. PINDIS sheds some new light on the interpretability and general applicability of the dimension weighting approach implemented by the commonly used INDSCAL procedure.     

Scaling a conditional proximity matrix to symmetry

Two least squares procedures for symmetrization of a conditional proximity matrix are derived. The solutions provide multiplicative constants for scaling the rows or columns of the matrix to maximize symmetry. It is suggested that the symmetrization is applicable for the elimination of bias effects like response bias, or constraints on the marginal frequencies imposed by the experimental design, as in confusion matrices.The application of the scaling procedure to a matrix of conditional probabilities was suggested by one of the referees, whose helpful comments are gratefully acknowledged.     

Adjusting researchers’ approach to adjustment: On the use of covariates when testing interactions

A common design in social psychology involves the use of two independent variables, an experimental manipulation and a measured individual difference, and the interest is in the interaction between them. In such designs, there are often obvious covariate(s), correlated with the measured independent variable, which the researcher wishes to control. Typically this is done by including the covariate in the analytic model. We show that in most cases this is an inadequate model. In general, the interaction between the two independent variables will be estimated without bias only when the interaction between the covariate and the manipulated independent variable is included in the analysis. We present simulations showing the factors affecting the magnitude of the bias and provide a survey of recent social psychological literature illustrating the frequency of the problem. Finally, we discuss cases where both independent variables are manipulated and the covariate is a potential mediator.     

Asymptotic distributions of the estimators of communalities in factor analysis

Asymptotic distributions of the estimators of communalities are derived for the maximum likelihood method in factor analysis. It is shown that the common practice of equating the asymptotic standard error of the communality estimate to the unique variance estimate is correct for standardized communality but not correct for unstandardized communality. In a Monte Carlo simulation the accuracy of the normal approximation to the distributions of the estimators are assessed when the sample size is 150 or 300. This study was carried out in part under the ISM Cooperative Research Program (90-ISM-CRP-9).     

Graph-theoretic representations for proximity matrices through strongly-anti-Robinson or circular strongly-anti-Robinson matrices

There are various optimization strategies for approximating, through the minimization of a least-squares loss function, a given symmetric proximity matrix by a sum of matrices each subject to some collection of order constraints on its entries. We extend these approaches to include components in the approximating sum that satisfy what are called the strongly-anti-Robinson (SAR) or circular strongly-anti-Robinson (CSAR) restrictions. A matrix that is SAR or CSAR is representable by a particular graph-theoretic structure, where each matrix entry is reproducible from certain minimum path lengths in the graph. One published proximity matrix is used extensively to illustrate the types of approximation that ensue when the SAR or CSAR constraints are imposed.The authors are indebted to Boris Mirkin who first noted in a personal communication to one of us (LH, April 22, 1996) that the optimization method for fitting anti-Robinson matrices in Hubert and Arabie (1994) should be extendable to the fitting of strongly anti-Robinson matrices as well.     

The mixed model for multivariate repeated measures: validity conditions and an approximate test

Repeated measures on multivariate responses can be analyzed according to either of two models: a doubly multivariate model (DMM) or a multivariate mixed model (MMM). This paper reviews both models and gives three new results concerning the MMM. The first result is, primarily, of theoretical interest; the second and third have implications for practice. First, it is shown that, given multivariate normality, a condition called multivariate sphericity of the covariance matrix is both necessary and sufficient for the validity of the MMM analysis. To test for departure from multivariate sphericity, the likelihood ratio test can be employed. The second result is an approximation to the null distribution of the likelihood ratio test statistic, useful for moderate sample sizes. Third, for situations satisfying multivariate normality, but not multivariate sphericity, a multivariate correction factor is derived. The correction factor generalizes Box's and can be used to construct an adjusted MMM test.I am grateful to an anonymous referee for carefully attending to the mathematical details of this paper.     

The rowwise correlation between two proximity matrices and the partial rowwise correlation

This paper discusses rowwise matrix correlation, based on the weighted sum of correlations between all pairs of corresponding rows of two proximity matrices, which may both be square (symmetric or asymmetric) or rectangular. Using the correlation coefficients usually associated with Pearson, Spearman, and Kendall, three different rowwise test statistics and their normalized coefficients are discussed, and subsequently compared with their nonrowwise alternatives like Mantel'sZ. It is shown that the rowwise matrix correlation coefficient between two matricesX andY is the partial correlation between the entries ofX andY controlled for the nominal variable that has the row objects as categories. Given this fact, partial rowwise correlations (as well as multiple regression extensions in the case of Pearson's approach) can be easily developed.The author wishes to thank the Editor, two referees, Jan van Hooff, and Ruud Derix for their useful comments, and E. J. Dietz for a copy of the algorithm of the Mantel permutation test.     

A simple Gauss-Newton procedure for covariance structure analysis with high-level computer languages

An implementation of the Gauss-Newton algorithm for the analysis of covariance structures that is specifically adapted for high-level computer languages is reviewed. With this procedure one need only describe the structural form of the population covariance matrix, and provide a sample covariance matrix and initial values for the parameters. The gradient and approximate Hessian, which vary from model to model, are computed numerically. Using this approach, the entire method can be operationalized in a comparatively small program. A large class of models can be estimated, including many that utilize functional relationships among the parameters that are not possible in most available computer programs. Some examples are provided to illustrate how the algorithm can be used.We are grateful to M. W. Browne and S. H. C. du Toit for many invaluable discussions about these computing ideas. Thanks also to Scott Chaiken for providing the data in the first example. They were collected as part of the U.S. Air Force's Learning Ability Measurement Project (LAMP), sponsored by the Air Force Office of Scientific Research (AFOSR) and the Human Resource Directorate of the Armstrong Laboratory (AL/HRM).