A simplification of a result by zellini on the maximal rank of symmetric three-way arrays

Zellini (1979, Theorem 3.1) has shown how to decompose an arbitrary symmetric matrix of ordern ×n as a linear combination of 1/2n(n+1) fixed rank one matrices, thus constructing an explicit tensor basis for the set of symmetricn ×n matrices. Zellini's decomposition is based on properties of persymmetric matrices. In the present paper, a simplified tensor basis is given, by showing that a symmetric matrix can also be decomposed in terms of 1/2n(n+1) fixed binary matrices of rank one. The decomposition implies that ann ×n ×p array consisting ofp symmetricn ×n slabs has maximal rank 1/2n(n+1). Likewise, an unconstrained INDSCAL (symmetric CANDECOMP/PARAFAC) decomposition of such an array will yield a perfect fit in 1/2n(n+1) dimensions. When the fitting only pertains to the off-diagonal elements of the symmetric matrices, as is the case in a version of PARAFAC where communalities are involved, the maximal number of dimensions can be further reduced to 1/2n(n–1). However, when the saliences in INDSCAL are constrained to be nonnegative, the tensor basis result does not apply. In fact, it is shown that in this case the number of dimensions needed can be as large asp, the number of matrices analyzed.     

An efficient algorithm for PARAFAC of three-way data with large numbers of observation units

The CANDECOMP algorithm for the PARAFAC analysis ofn×m×p three-way arrays is adapted to handle arrays in whichn>mp more efficiently. For such arrays, the adapted algorithm needs less memory space to store the data during the iterations, and uses less computation time than the original CANDECOMP algorithm. The size of the arrays that can be handled by the new algorithm is in no way limited by the number of observation units (n) in the data.The authors are obliged to Jos ten Berge for his comments on an earlier version of this paper. The research of Henk A. L. Kiers has been made possible by a fellowship of the Royal Netherlands Academy of Arts and Sciences.     

Kruskal's polynomial for 2×2×2 arrays and a generalization to 2×n×n arrays

A remarkable difference between the concept of rank for matrices and that for three-way arrays has to do with the occurrence of non-maximal rank. The set ofn×n matrices that have a rank less thann has zero volume. Kruskal pointed out that a 2×2×2 array has rank three or less, and that the subsets of those 2×2×2 arrays for which the rank is two or three both have positive volume. These subsets can be distinguished by the roots of a certain polynomial. The present paper generalizes Kruskal's results to 2×n×n arrays. Incidentally, it is shown that twon ×n matrices can be diagonalized simultaneously with positive probability.The author is obliged to Joe Kruskal and Henk Kiers for commenting on an earlier draft, and to Tom Wansbeek for raising stimulating questions.     

Transforming three-way arrays to maximal simplicity

Transforming the core array in Tucker three-way component analysis to simplicity is an intriguing way of revealing structures in between standard Tucker three-way PCA, where the core array is unconstrained, and CANDECOMP/PARAFAC, where the core array has a generalized diagonal form. For certain classes of arrays, transformations to simplicity, that is, transformations that produce a large number of zeros, can be obtained explicitly by solving sets of linear equations. The present paper extends these results. First, a method is offered to simplifyJ ×J × 2 arrays. Next, it is shown that the transformation that simplifies anI ×J ×K array can be used to also simplify the (complementary) arrays of order (JK −I) ×J ×K, of orderI × (IK −J) ×K and of orderI ×J × (IJ −K). Finally, the question of what constitutes the maximal simplicity for arrays (the maximal number of zero elements) will be considered. It is shown that cases of extreme simplicity, considered in the past, are, in fact, cases of maximal simplicity.     

Some clarifications of the CANDECOMP algorithm applied to INDSCAL

Carroll and Chang have claimed that CANDECOMP applied to symmetric matrices yields equivalent coordinate matrices, as needed for INDSCAL. Although this claim has appeared to be valid for all practical purposes, it has gone without a rigorous mathematical footing. The purpose of the present paper is to clarify CANDECOMP in this respect. It is shown that equivalent coordinate matrices are not granted at global minima when the symmetric matrices are not Gramian, or when these matrices are Gramian but the solution not globally optimal.Part of this research has been supported by The Netherlands Organization for Scientific Research (NWO), PSYCHON-grant (560-267-011).     

Decompositions and biplots in three-way correspondence analysis

In this paper correspondence analysis for three-way contingency tables is presented using three-way generalisations of the singular value decomposition. It is shown that in combination with Lancaster's (1951) additive decomposition of interactions in three-way tables, a detailed analysis is possible of the deviations from independence. Finally, biplots are shown to produce powerful graphical representations of the results from three-way correspondence analyses. An example from child development is used to illustrate the theoretical developments.     

Some clarifications of the TUCKALS2 algorithm applied to the IDIOSCAL problem

Kroonenberg and de Leeuw have suggested fitting the IDIOSCAL model by the TUCKALS2 algorithm for three-way components analysis. In theory, this is problematic because TUCKALS2 produces two possibly different coordinate matrices, that are useless for IDIOSCAL unless they are equal. Kroonenberg has claimed that, when IDIOSCAL is fitted by TUCKALS2, the resulting coordinate matrices will be identical. In the present paper, this claim is proven valid when the data matrices are semidefinite. However, counterexamples for indefinite matrices are also constructed, by examining the global minimum in the case where the data matrices have the same eigenvectors. Similar counterexamples have been considered by ten Berge and Kiers in the related context of CANDECOMP/PARAFAC to fit the INDSCAL model.     

Some uniqueness results for PARAFAC2

Whereas the unique axes properties of PARAFAC1 have been examined extensively, little is known about uniqueness properties for the PARAFAC2 model for covariance matrices. This paper is concerned with uniqueness in the rank two case of PARAFAC2. For this case, Harshman and Lundy have recently shown, subject to mild assumptions, that PARAFAC2 is unique when five (covariance) matrices are analyzed. In the present paper, this result is sharpened. PARAFAC2 is shown to be usually unique with four matrices. With three matrices it is not unique unless a certain additional assumption is introduced. If, for instance, the diagonal matrices of weights are constrained to be non-negative, three matrices are enough to have uniqueness in the rank two case of PARAFAC2. The authors are obliged to Richard Harshman for stimulating this research, and to the Associate Editor and reviewers for suggesting major improvements in the presentation.     

Uniqueness of N-way N-mode hierarchical classes models

This paper presents two uniqueness theorems for the family of hierarchical classes models, a collection of order preserving Boolean decomposition models for binary N-way N-mode data. The theorems are compared with uniqueness results for the closely related family of N-way N-mode principal component models. It is concluded that the two-way two-mode PCA and N-way N-mode TuckerN models suffer more from a lack of identifiability than their hierarchical classes analogues, whereas the uniqueness conditions for N-way N-mode PARAFAC/CANDECOMP models are less restrictive than the ones derived for their N-way N-mode hierarchical classes counterparts.     

Hierarchical classes models for three-way three-mode binary data: interrelations and model selection

Several hierarchical classes models can be considered for the modeling of three-way three-mode binary data, including the INDCLAS model (Leenen, Van Mechelen, De Boeck, and Rosenberg, 1999), the Tucker3-HICLAS model (Ceulemans, Van Mechelen, and Leenen, 2003), the Tucker2-HICLAS model (Ceulemans and Van Mechelen, 2004), and the Tucker1-HICLAS model that is introduced in this paper. Two questions then may be raised: (1) how are these models interrelated, and (2) given a specific data set, which of these models should be selected, and in which rank? In the present paper, we deal with these questions by (1) showing that the distinct hierarchical classes models for three-way three-mode binary data can be organized into a partially ordered hierarchy, and (2) by presenting model selection strategies based on extensions of the well-known scree test and on the Akaike information criterion. The latter strategies are evaluated by means of an extensive simulation study and are illustrated with an application to interpersonal emotion data. Finally, the presented hierarchy and model selection strategies are related to corresponding work by Kiers (1991) for principal component models for three-way three-mode real-valued data.     

Population models and simulation methods: The case of the Spearman rank correlation

The purpose of this paper is to highlight the importance of a population model in guiding the design and interpretation of simulation studies used to investigate the Spearman rank correlation. The Spearman rank correlation has been known for over a hundred years to applied researchers and methodologists alike and is one of the most widely used non‐parametric statistics. Still, certain misconceptions can be found, either explicitly or implicitly, in the published literature because a population definition for this statistic is rarely discussed within the social and behavioural sciences. By relying on copula distribution theory, a population model is presented for the Spearman rank correlation, and its properties are explored both theoretically and in a simulation study. Through the use of the Iman–Conover algorithm (which allows the user to specify the rank correlation as a population parameter), simulation studies from previously published articles are explored, and it is found that many of the conclusions purported in them regarding the nature of the Spearman correlation would change if the data‐generation mechanism better matched the simulation design. More specifically, issues such as small sample bias and lack of power of the t‐test and r‐to‐z Fisher transformation disappear when the rank correlation is calculated from data sampled where the rank correlation is the population parameter. A proof for the consistency of the sample estimate of the rank correlation is shown as well as the flexibility of the copula model to encompass results previously published in the mathematical literature.     

A numerical approach to the approximate and the exact minimum rank of a covariance matrix

A concept of approximate minimum rank for a covariance matrix is defined, which contains the (exact) minimum rank as a special case. A computational procedure to evaluate the approximate minimum rank is offered. The procedure yields those proper communalities for which the unexplained common variance, ignored in low-rank factor analysis, is minimized. The procedure also permits a numerical determination of the exact minimum rank of a covariance matrix, within limits of computational accuracy. A set of 180 covariance matrices with known or bounded minimum rank was analyzed. The procedure was successful throughout in recovering the desired rank.The authors are obliged to Paul Bekker for stimulating and helpful comments.     

Minimum rank and minimum trace of covariance matrices

This paper considers some mathematical aspects of minimum trace factor analysis (MTFA). The uniqueness of an optimal point of MTFA is proved and necessary and sufficient conditions for a point x to be optimal are established. Finally, some results about the connection between MTFA and the classical minimum rank factor analysis will be presented.     

Identification with deficient rank loading matrices in confirmatory factor analysis: Multitrait-multimethod models

This paper presents some results on identification in multitrait-multimethod (MTMM) confirmatory factor analysis (CFA) models. Some MTMM models are not identified when the (factorial-patterned) loadings matrix is of deficient column rank. For at least one other MTMM model, identification does exist despite such deficiency. It is also shown that for some MTMM CFA models, Howe's (1955) conditions sufficient for rotational uniqueness can fail, yet the model may well be identified and rotationally unique. Implications of these results for CFA models in general are discussed.     

A nonparametric method to analyze interactions: The adjusted rank transform test

Experimental social psychologists routinely rely on ANOVA to study interactions between factors even when the assumptions underlying the use of parametric tests are not met. Alternative nonparametric methods are often relatively difficult to conduct, have seldom been presented into detail in regular curriculum and have the reputation - sometimes incorrectly - of being less powerful than parametric tests. This article presents the adjusted rank transform test (ART); a nonparametric test, easy to conduct, having the advantage of being much more powerful than parametric tests when certain assumptions underlying the use of these tests are violated. To specify the conditions under which the adjusted rank transform test is superior to the usual parametric tests, results of a Monte Carlo simulation are presented.     

Properties of and Algorithms for Fitting Three-Way Component Models with Offset Terms

Prior to a three-way component analysis of a three-way data set, it is customary to preprocess the data by centering and/or rescaling them. Harshman and Lundy (1984) considered that three-way data actually consist of a three-way model part, which in fact pertains to ratio scale measurements, as well as additive “offset” terms that turn the ratio scale measurements into interval scale measurements. They mentioned that such offset terms might be estimated by incorporating additional components in the model, but discarded this idea in favor of an approach to remove such terms from the model by means of centering. Then estimates for the three-way component model parameters are obtained by analyzing the centered data. In the present paper, the possibility of actually estimating the offset terms is taken up again. First, it is mentioned in which cases such offset terms can be estimated uniquely. Next, procedures are offered for estimating model parameters and offset parameters simultaneously, as well as successively (i.e., providing offset term estimates after the three-way model parameters have been estimated in the traditional way on the basis of the centered data). These procedures are provided for both the CANDECOMP/PARAFAC model and the Tucker3 model extended with offset terms. The successive and the simultaneous approaches for estimating model and offset parameters have been compared on the basis of simulated data. It was found that both procedures perform well when the fitted model captures at least all offset terms actually underlying the data. The simultaneous procedures performed slightly better than the successive procedures. If fewer offset terms are fitted than there are underlying the model, the results are considerably poorer, but in these cases the successive procedures performed better than the simultaneous ones. All in all, it can be concluded that the traditional approach for estimating model parameters can hardly be improved upon, and that offset terms can sufficiently well be estimated by the proposed successive approach, which is a simple extension of the traditional approach. The author is obliged to Jos M.F. ten Berge and Marieke Timmerman for helpful comments on an earlier version of this paper. The author is obliged to Iven van Mechelen for making available the data set used in Section 6.     

More factors than subjects,tests and treatments: An indeterminacy theorem for canonical decomposition and individual differences scaling

Some methods that analyze three-way arrays of data (including INDSCAL and CANDECOMP/PARAFAC) provide solutions that are not subject to arbitrary rotation. This property is studied in this paper by means of the triple product [A, B, C] of three matrices. The question is how well the triple product determines the three factors. The answer: up to permutation of columns and multiplication of columns by scalars—under certain conditions. In this paper we greatly expand the conditions under which the result is known to hold. A surprising fact is that the nonrotatability characteristic can hold even when the number of factors extracted is greater thanevery dimension of the three-way array, namely, the number of subjects, the number of tests, and the number of treatments.This paper is being published in place of Dr. Kruskal's presidential address to the Psychometric Society, April, 1975. Further results like those in this paper, as well as a surprising connection with an area of mathematics called arithmetic complexity theory, will be found in a more recent paper [Kruskal, in press].     

The role of personality in defeat: a revised social rank model

This study sought to test the role of personality within the social rank theory of depression. Specifically, self‐criticism was hypothesised to be a risk factor for mechanisms underlying involuntary subordination, while self‐efficacy was hypothesised to have a protective function. Involuntary subordination has been implicated as an underlying cause of depression and it was therefore important to determine the personality variables and other intrapsychic mechanisms that lead to this condition. The sample consisted of 115 participants (average age of 20.2 years) who were involved in athletic competition. Participants were evaluated at baseline for personality and social rank variables and for mood immediately before and after a competitive match. Two models were tested: the first model showed that self‐criticism and neuroticism predicted a heightened perception of defeat following a loss. Self‐criticism also predicted an inability to accept defeat which was associated with a latent variable interpreted as involuntary subordination. The second model demonstrated that self‐efficacy was associated with a more adaptive response to defeat, being negatively related to the perception of defeat. Both models proved to be viable and suggest that different personality styles confer specific vulnerabilities to involuntary subordination in the context of defeating events. Copyright © 2007 John Wiley & Sons, Ltd.