Influential observations in principal factor analysis

We propose a method for detecting influential observations in iterative principal factor analysis. For this purpose we derive the influence functionsI(x; LL ^T ) andI(x; ) for the common variance matrixT =LL ^T and the unique variance matrix , respectively, in the common factor decomposition =LL ^T + . A numerical example is given for illustration.The authors are grateful to Tomoyuki Tarumi and Atsuhiro Hayashi for their kind permission to use their software Seto/B for drawing Figures 1 and 2 and to anonymous reviewers for comments on the paper.     

学业不良学生类型与特点的聚类分析

该研究运用Ｑ聚类分析对上海市区１４８０名初中预备班学生的能力和个性特征进行分类研究。结果发现１４８０名被试中存有心理发展水平不同的六个主要类别,这些类别与学生学业成绩的优劣关系密切。同时,３５３名差生可分为四个主要类型：即,暂时性困难学生、能力型困难学生、动力型困难学生和整体性困难学生,不同类型的差生具有不同的特点。这为针对不同类型学生的特点制定有效的教育措施提供了依据。     

U-statistic hierarchical clustering

A monotone invariant method of hierarchical clustering based on the Mann-Whitney U-statistic is presented. The effectiveness of the complete-link, single-link, and U-statistic methods in recovering tree structures from error perturbed data are evaluated. The U-statistic method is found to be consistently more effective in recovering the original tree structures than either the single-link or complete-link methods.     

An examination of the effect of six types of error perturbation on fifteen clustering algorithms

An evaluation of several clustering methods was conducted. Artificial clusters which exhibited the properties of internal cohesion and external isolation were constructed. The true cluster structure was subsequently hidden by six types of error-perturbation. The results indicated that the hierarchical methods were differentially sensitive to the type of error perturbation. In addition, generally poor recovery performance was obtained when random seed points were used to start theK-means algorithms. However, two alternative starting procedures for the nonhierarchical methods produced greatly enhanced cluster recovery and were found to be robust with respect to all of the types of error examined.     

Indclus: An individual differences generalization of the adclus model and the mapclus algorithm

We present a new model and associated algorithm, INDCLUS, that generalizes the Shepard-Arabie ADCLUS (ADditive CLUStering) model and the MAPCLUS algorithm, so as to represent in a clustering solution individual differences among subjects or other sources of data. Like MAPCLUS, the INDCLUS generalization utilizes an alternating least squares method combined with a mathematical programming optimization procedure based on a penalty function approach to impose discrete (0,1) constraints on parameters defining cluster membership. All subjects in an INDCLUS analysis are assumed to have a common set of clusters, which are differentially weighted by subjects in order to portray individual differences. As such, INDCLUS provides a (discrete) clustering counterpart to the Carroll-Chang INDSCAL model for (continuous) spatial representations. Finally, we consider possible generalizations of the INDCLUS model and algorithm.We are indebted to Seymour Rosenberg for making available the data from Rosenberg and Kim [1975]. Also, this work has benefited from the observations of S. A. Boorman, W. S. DeSarbo, G. Furnas, P. E. Green, L. J. Hubert, L. E. Jones, J. B. Kruskal, S. Pruzansky, D. Schmittlein, E. J. Shoben, S. D. Soli, and anonymous referees.This research was supported in part by NSF Grant SES82 00441, LEAA Grant 78-NI-AX-0142, and NSF Grant SES80 04815.     

Gennclus: New models for general nonhierarchical clustering analysis

A general class of nonhierarchical clustering models and associated algorithms for fitting them are presented. These (metric) clustering models generalize the Shepard-Arabie Additive Clusters model in allowing for: (1). either overlapping or nonoverlapping clusters; (2). either symmetric (one-way clustering) or nonsymmetric (two-way clustering) proximities (input data); and, (3). either symmetric or diagonal weights. The GENNCLUS algorithms utilize alternating least-squares methods combining ordinary and constrained least-squares, nonlinear constrained mathematical programming, and combinatorial optimization techniques in estimating model parameters. In addition to developing the mathematical bases of these models, a comprehensive set of Monte Carlo simulations of the different models is reported. Two applications concerning brand-switching data and celebrity-brand proximities are discussed. Finally, extensions to three-way models, nonmetric analyses, and other model specifications are provided.Wayne S. DeSarbo is a Member of Technical Staff in the Mathematics and Statistics Research Center at Bell Laboratories in Murray Hill, N.J. I wish to thank R. Gnanadesikan, J. D. Carroll, and P. Arabie for their comments on a previous draft of this paper. I also wish to acknowledge the computer assistance provided by Linda Clark. Finally, I wish to thank the reviewers and editor for their very complete reviews and comments.     

Tucker3 hierarchical classes analysis

This paper presents a new model for binary three-way three-mode data, called Tucker3 hierarchical classes model (Tucker3-HICLAS). This new model generalizes Leenen, Van Mechelen, De Boeck, and Rosenberg's (1999) individual differences hierarchical classes model (INDCLAS). Like the INDCLAS model, the Tucker3-HICLAS model includes a hierarchical classification of the elements of each mode, and a linking structure among the three hierarchies. Unlike INDCLAS, Tucker3-HICLAS (a) does not restrict the hierarchical classifications of the three modes to have the same rank, and (b) allows for more complex linking structures among the three hierarchies. An algorithm to fit the Tucker3-HICLAS model is described and evaluated in an extensive simulation study. An application of the model to hostility data is discussed.The first author is a Research Assistant of the Fund for Scientific Research-Flanders (Belgium). The research reported in this paper was partially supported by the Research Council of K.U. Leuven (GOA/2000/02). We are grateful to Kristof Vansteelandt for providing us with an interesting data set.     

Category clustering calculator for free recall

The free recall measure is one of the most popular measures in memory research. Using this measure, researchers can assess not only the amount of recall but also the strategy participants used to recall the material. Category clustering is a strategy participants often use when the input list is categorized. Unfortunately, computing category clustering measures is laborious. The present paper introduces a calculator that computes these measures for each participant using a platform that is accessible to most researchers in an attempt to make these measures more user-friendly.     

Interference by process, not content, determines semantic auditory distraction

Distraction by irrelevant background sound of visually-based cognitive tasks illustrates the vulnerability of attentional selectivity across modalities. Four experiments centred on auditory distraction during tests of memory for visually-presented semantic information. Meaningful irrelevant speech disrupted the free recall of semantic category-exemplars more than meaningless irrelevant sound (Experiment 1). This effect was exacerbated when the irrelevant speech was semantically related to the to-be-remembered material (Experiment 2). Importantly, however, these effects of meaningfulness and semantic relatedness were shown to arise only when instructions emphasized recall by category rather than by serial order (Experiments 3 and 4). The results favor a process-oriented, rather than a structural, approach to the breakdown of attentional selectivity and forgetting: performance is impaired by the similarity of process brought to bear on the relevant and irrelevant material, not the similarity in item content.