The LMPCA program: A graphical user interface for fitting the linked-mode PARAFAC-PCA model to coupled real-valued data

In behavioral research, PARAFAC analysis, a three-mode generalization of standard principal component analysis (PCA), is often used to disclose the structure of three-way three-mode data. To get insight into the underlying mechanisms, one often wants to relate the component matrices resulting from such a PARAFAC analysis to external (two-way two-mode) information, regarding one of the modes of the three-way data. To this end, linked-mode PARAFAC-PCA analysis can be used, in which the three-way and the two-way data set, which have one mode in common, are simultaneously analyzed. More specifically, a PARAFAC and a PCA model are fitted to the three-way and the two-way data, respectively, restricting the component matrix for the common mode to be equal in both models. Until now, however, no software program has been publicly available to perform such an analysis. Therefore, in this article, the LMPCA program, a free and easy-to-use MATLAB graphical user interface, is presented to perform a linked-mode PARAFAC-PCA analysis. The LMPCA software can be obtained from the authors at http://ppw.kuleuven.be/okp/software/LMPCA. For users who do not have access to MATLAB, a stand-alone version is provided.     

Bootstrap confidence intervals in multi‐level simultaneous component analysis

Multi‐level simultaneous component analysis (MLSCA) was designed for the exploratory analysis of hierarchically ordered data. MLSCA specifies a component model for each level in the data, where appropriate constraints express possible similarities between groups of objects at a certain level, yielding four MLSCA variants. The present paper discusses different bootstrap strategies for estimating confidence intervals (CIs) on the individual parameters. In selecting a proper strategy, the main issues to address are the resampling scheme and the non‐uniqueness of the parameters. The resampling scheme depends on which level(s) in the hierarchy are considered random, and which fixed. The degree of non‐uniqueness depends on the MLSCA variant, and, in two variants, the extent to which the user exploits the transformational freedom. A comparative simulation study examines the quality of bootstrap CIs of different MLSCA parameters. Generally, the quality of bootstrap CIs appears to be good, provided the sample sizes are sufficient at each level that is considered to be random. The latter implies that if more than a single level is considered random, the total number of observations necessary to obtain reliable inferential information increases dramatically. An empirical example illustrates the use of bootstrap CIs in MLSCA.     

Oblique rotation in correspondence analysis: A step forward in the search for the simplest interpretation

Correspondence analysis (CA) is a popular method that can be used to analyse relationships between categorical variables. It is closely related to several popular multivariate analysis methods such as canonical correlation analysis and principal component analysis. Like principal component analysis, CA solutions can be rotated orthogonally as well as obliquely into a simple structure without affecting the total amount of explained inertia. However, some specific aspects of CA prevent standard rotation procedures from being applied in a straightforward fashion. In particular, the role played by weights assigned to points and dimensions and the duality of CA solutions are unique to CA. For orthogonal simple structure rotation, procedures recently have been proposed. In this paper, we construct oblique rotation methods for CA that take into account these specific difficulties. We illustrate the benefits of our oblique rotation procedure by means of two illustrative examples.     

王岱舆的“天命有三品”论与儒家的天命观

王岱舆作为明末清初四教（儒、释、道、回）皆通的伊斯兰著名学者,他提出的“天命有三品”论,既适应了当时以儒家为主流文化的背景,也保持了其独特的伊斯兰性,在巧妙地处理与儒家天命观分歧的同时,又开放地拿儒家文化为己所用,从而为两种文明都赢得了宽松的环境,使得两种文明能够共存、共荣、共同发展。本文从王岱舆天命观与儒家天命观的介绍入手,分析其与儒家天命观的契合与分歧。     

Uniqueness of three-mode factor models with sparse cores: The 3 × 3 × 3 case

Three-Mode Factor Analysis (3MFA) and PARAFAC are methods to describe three-way data. Both methods employ models with components for the three modes of a three-way array; the 3MFA model also uses a three-way core array for linking all components to each other. The use of the core array makes the 3MFA model more general than the PARAFAC model (thus allowing a better fit), but also more complicated. Moreover, in the 3MFA model the components are not uniquely determined, and it seems hard to choose among all possible solutions. A particularly interesting feature of the PARAFAC model is that it does give unique components. The present paper introduces a class of 3MFA models in between 3MFA and PARAFAC that share the good properties of the 3MFA model and the PARAFAC model: They fit (almost) as well as the 3MFA model, they are relatively simple and they have the same uniqueness properties as the PARAFAC model.This research has been made possible by a fellowship from the Royal Netherlands Academy of Arts and Sciences to the first author. Part of this research has been presented at the first conference on ThRee-way methods In Chemistry (TRIC), a meeting of Psychometrics and Chemometrics, Epe, The Netherlands, August 1993. The authors are obliged to Age Smilde for stimulating this research, and two anonymous reviewers for many helpful 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.     

A monotonically convergent algorithm for orthogonal congruence rotation

Brokken has proposed a method for orthogonal rotation of one matrix such that its columns have a maximal sum of congruences with the columns of a target matrix. This method employs an algorithm for which convergence from every starting point is not guaranteed. In the present paper, an iterative majorization algorithm is proposed which is guaranteed to converge from every starting point. Specifically, it is proven that the function value converges monotonically, and that the difference between subsequent iterates converges to zero. In addition to the better convergence properties, another advantage of the present algorithm over Brokken's one is that it is easier to program. The algorithms are compared on 80 simulated data sets, and it turned out that the new algorithm performed well in all cases, whereas Brokken's algorithm failed in almost half the cases. The derivation of the algorithm is given in full detail because it involves a series of inequalities that can be of use to derive similar algorithms in different contexts.This research has been made possible by a fellowship from the Royal Netherlands Academy of Arts and Sciences to the first author. The authors are obliged to Willem J. Heiser and Jos M. F. ten Berge for useful comments on an earlier version of this paper.     

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.     

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.