Tucker2 hierarchical classes analysis

This paper presents a new hierarchical classes model, called Tucker2-HICLAS, for binary three-way three-mode data. As any three-way hierarchical classes model, the Tucker2-HICLAS model includes a representation of the association relation among the three modes and a hierarchical classification of the elements of each mode. A distinctive feature of the Tucker2-HICLAS model, being closely related to the Tucker3-HICLAS model (Ceulemans, Van Mechelen & Leenen, 2003), is that one of the three modes is minimally reduced and, hence, that the differences among the association patterns of the elements of this mode are maximally retained in the model. Moreover, as compared to Tucker3-HICLAS, Tucker2-HICLAS implies three rather than four different types of parameters and as such is simpler to interpret. Two types of Tucker2-HICLAS models are distinguished: a disjunctive and a conjunctive type. An algorithm for fitting the Tucker2-HICLAS model is described and evaluated in a simulation study. The model is illustrated with longitudinal data on interpersonal emotions. The first author is a Researcher 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). The authors are grateful to Iwin Leenen for the fruitful discussions.     

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.     

Indclas: A three-way hierarchical classes model

A three-way three-mode extension of De Boeck and Rosenberg's (1988) two-way two-mode hierarchical classes model is presented for the analysis of individual differences in binary object × attribute arrays. In line with the two-way hierarchical classes model, the three-way extension represents both the association relation among the three modes and the set-theoretical relations among the elements of each model. An algorithm for fitting the model is presented and evaluated in a simulation study. The model is illustrated with data on psychiatric diagnosis. Finally, the relation between the model and extant models for three-way data is discussed.The research reported in this paper was partially supported by NATO (Grant CRG.921321 to Iven Van Mechelen and Seymour Rosenberg).     

The conjunctive model of hierarchical classes

This paper describes the conjunctive counterpart of De Boeck and Rosenberg's hierarchical classes model. Both the original model and its conjunctive counterpart represent the set-theoretical structure of a two-way two-mode binary matrix. However, unlike the original model, the new model represents the row-column association as a conjunctive function of a set of hypothetical binary variables. The conjunctive nature of the new model further implies that it may represent some conjunctive higher order dependencies among rows and columns. The substantive significance of the conjunctive model is illustrated with empirical applications. Finally, it is shown how conjunctive and disjunctive hierarchical classes models relate to Galois lattices, and how hierarchical classes analysis can be useful to construct lattice models of empirical data.The research reported in this paper was supported by NATO (Grant CRG.921321 to Iven Van Mechelen and Seymour Rosenberg) and by the Research Fund of Katholieke Universiteit Leuven (Grants PDM92/19 and POR93/3 to Iven Van Mechelen; Grants OT89/9 and F91/56 to Paul De Boeck).     

A taxonomy of latent structure assumptions for probability matrix decomposition models

A taxonomy of latent structure assumptions (LSAs) for probability matrix decomposition (PMD) models is proposed which includes the original PMD model (Maris, De Boeck, & Van Mechelen, 1996) as well as a three-way extension of the multiple classification latent class model (Maris, 1999). It is shown that PMD models involving different LSAs are actually restricted latent class models with latent variables that depend on some external variables. For parameter estimation a combined approach is proposed that uses both a mode-finding algorithm (EM) and a sampling-based approach (Gibbs sampling). A simulation study is conducted to investigate the extent to which information criteria, specific model checks, and checks for global goodness of fit may help to specify the basic assumptions of the different PMD models. Finally, an application is described with models involving different latent structure assumptions for data on hostile behavior in frustrating situations.Note: The research reported in this paper was partially supported by the Fund for Scientific Research-Flanders (Belgium) (project G.0207.97 awarded to Paul De Boeck and Iven Van Mechelen), and the Research Fund of K.U. Leuven (F/96/6 fellowship to Andrew Gelman, OT/96/10 project awarded to Iven Van Mechelen and GOA/2000/02 awarded to Paul De Boeck and Iven Van Mechelen). We thank Marcel Croon and Kristof Vansteelandt for commenting on an earlier draft of this paper.     

The Local Minima Problem in Hierarchical Classes Analysis: An Evaluation of a Simulated Annealing Algorithm and Various Multistart Procedures

Hierarchical classes models are quasi-order retaining Boolean decomposition models for N-way N-mode binary data. To fit these models to data, rationally started alternating least squares (or, equivalently, alternating least absolute deviations) algorithms have been proposed. Extensive simulation studies showed that these algorithms succeed quite well in recovering the underlying truth but frequently end in a local minimum. In this paper we evaluate whether or not this local minimum problem can be mitigated by means of two common strategies for avoiding local minima in combinatorial data analysis: simulated annealing (SA) and use of a multistart procedure. In particular, we propose a generic SA algorithm for hierarchical classes analysis and three different types of random starts. The effectiveness of the SA algorithm and the random starts is evaluated by reanalyzing data sets of previous simulation studies. The reported results support the use of the proposed SA algorithm in combination with a random multistart procedure, regardless of the properties of the data set under study. Eva Ceulemans is a post-doctoral fellow of the Fund for Scientific Research Flanders (Belgium). Iwin Leenen is a post-doctoral researcher of the Spanish Ministerio de Educación y Ciencia (programa Ramón y Cajal). The research reported in this paper was partially supported by the Research Council of K.U. Leuven (GOA/05/04).     

Bayesian Hierarchical Classes Analysis

Hierarchical classes models are models for N-way N-mode data that represent the association among the N modes and simultaneously yield, for each mode, a hierarchical classification of its elements. In this paper we present a stochastic extension of the hierarchical classes model for two-way two-mode binary data. In line with the original model, the new probabilistic extension still represents both the association among the two modes and the hierarchical classifications. A fully Bayesian method for fitting the new model is presented and evaluated in a simulation study. Furthermore, we propose tools for model selection and model checking based on Bayes factors and posterior predictive checks. We illustrate the advantages of the new approach with applications in the domain of the psychology of choice and psychiatric diagnosis. Iwin Leenen is now at the Instituto Mexicano de Investigación de Familia y Población (IMIFAP), Mexico. The research reported in this paper was partially supported by the Spanish Ministerio de Educación y Ciencia (programa Ramón y Cajal) and by the Research Council of K.U.Leuven (PDM/99/037, GOA/2000/02, and GOA/2005/04). The authors are grateful to Johannes Berkhof for fruitful discussions.     

Hierarchical Classes Modeling of Rating Data

Hierarchical classes (HICLAS) models constitute a distinct family of structural models for N-way N-mode data. All members of the family include N simultaneous and linked classifications of the elements of the N modes implied by the data; those classifications are organized in terms of hierarchical, if–then-type relations. Moreover, the models are accompanied by comprehensive, insightful graphical representations. Up to now, the hierarchical classes family has been limited to dichotomous or dichotomized data. In the present paper we propose a novel extension of the family to two-way two-mode rating data (HICLAS-R). The HICLAS-R model preserves the representation of simultaneous and linked classifications as well as of generalized if–then-type relations, and keeps being accompanied by a comprehensive graphical representation. It is shown to bear interesting relationships with classical real-valued two-way component analysis and with methods of optimal scaling. The research reported in this paper was supported by the Research Fund of the University of Leuven (GOA/00/02 and GOA/05/04) and by the Fund for Scientific Research-Flanders (project G.0146.06). Eva Ceulemans is a Post-doctoral Researcher supported by the Fund for Scientific Research, Flanders. The authors gratefully acknowledge the help of Gert Quintiens and Kaatje Bollaerts in collecting the data used in Section 4 and of Jan Schepers in additional analyses of these data.     

Models for ordinal hierarchical classes analysis

This paper proposes an ordinal generalization of the hierarchical classes model originally proposed by De Boeck and Rosenberg (1998). Any hierarchical classes model implies a decomposition of a two-way two-mode binary arrayM into two component matrices, called bundle matrices, which represent the association relation and the set-theoretical relations among the elements of both modes inM. Whereas the original model restricts the bundle matrices to be binary, the ordinal hierarchical classes model assumes that the bundles are ordinal variables with a prespecified number of values. This generalization results in a classification model with classes ordered along ordinal dimensions. The ordinal hierarchical classes model is shown to subsume Coombs and Kao's (1955) model for nonmetric factor analysis. An algorithm is described to fit the model to a given data set and is subsequently evaluated in an extensive simulation study. An application of the model to student housing data is discussed.     

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.     

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.     

The CHIC Model: A Global Model for Coupled Binary Data

Often problems result in the collection of coupled data, which consist of different N-way N-mode data blocks that have one or more modes in common. To reveal the structure underlying such data, an integrated modeling strategy, with a single set of parameters for the common mode(s), that is estimated based on the information in all data blocks, may be most appropriate. Such a strategy implies a global model, consisting of different N-way N-mode submodels, and a global loss function that is a (weighted) sum of the partial loss functions associated with the different submodels. In this paper, such a global model for an integrated analysis of a three-way three-mode binary data array and a two-way two-mode binary data matrix that have one mode in common is presented. A simulated annealing algorithm to estimate the model parameters is described and evaluated in a simulation study. An application of the model to real psychological data is discussed. T. Wilderjans 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/2005/04). We are grateful to Kristof Vansteelandt for providing us with an interesting data set. We also thank three anonymous reviewers for their useful comments.     

A Speeded Item Response Model with Gradual Process Change

An item response theory model for dealing with test speededness is proposed. The model consists of two random processes, a problem solving process and a random guessing process, with the random guessing gradually taking over from the problem solving process. The involved change point and change rate are considered random parameters in order to model examinee differences in both respects. The proposed model is evaluated on simulated data and in a case study. The research reported in this paper was supported by IAP P5/24 and GOA/2005/04, both awarded to Paul De Boeck and Iven Van Mechelen, and by IAP P6/03, awarded to Iven Van Mechelen. Yuri Goegebeur’s research was supported by a grant of the Danish Natural Science Research Council.     

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.     

The CLASSI-N Method for the Study of Sequential Processes

In many psychological research domains stimulus-response profiles are explained by conjecturing a sequential process in which some variables mediate between stimuli and responses. Charting sequential processes is often a complex task because (1) many possible mediating variables may exist, and (2) interindividual differences may occur in the relationship between these mediating variables and the response. Recently, Ceulemans and Van Mechelen (Psychometrika 73(1):107–124, 2008) addressed these challenges by developing the CLASSI model. A major drawback of CLASSI is that it requires information about the same set of stimuli for all participants (i.e., crossed data), whereas recently a number of data gathering techniques have been proposed in which the set of stimuli differs across participants, yielding nested data. Therefore we present the CLASSI-N model, which extends the CLASSI model to nested data. A simulated annealing algorithm is proposed. The results of a simulation study are discussed as well as an application to data concerning depression.     

Simultaneous Component Analysis by Means of Tucker3

A new model for simultaneous component analysis (SCA) is introduced that contains the existing SCA models with common loading matrix as special cases. The new SCA-T3 model is a multi-set generalization of the Tucker3 model for component analysis of three-way data. For each mode (observational units, variables, sets) a different number of components can be chosen and the obtained solution can be rotated without loss of fit to facilitate interpretation. SCA-T3 can be fitted on centered multi-set data and also on the corresponding covariance matrices. For this purpose, alternating least squares algorithms are derived. SCA-T3 is evaluated in a simulation study, and its practical merits are demonstrated for several benchmark datasets.     

Selecting among three‐mode principal component models of different types and complexities: A numerical convex hull based method

Several three‐mode principal component models can be considered for the modelling of three‐way, three‐mode data, including the Candecomp/Parafac, Tucker3, Tucker2, and Tucker1 models. The following question then may be raised: given a specific data set, which of these models should be selected, and at what complexity (i.e. with how many components)? We address this question by proposing a numerical model selection heuristic based on a convex hull. Simulation results show that this heuristic performs almost perfectly, except for Tucker3 data arrays with at least one small mode and a relatively large amount of error.     

Simplicity and Typical Rank Results for Three-Way Arrays

Matrices can be diagonalized by singular vectors or, when they are symmetric, by eigenvectors. Pairs of square matrices often admit simultaneous diagonalization, and always admit block wise simultaneous diagonalization. Generalizing these possibilities to more than two (non-square) matrices leads to methods of simplifying three-way arrays by nonsingular transformations. Such transformations have direct applications in Tucker PCA for three-way arrays, where transforming the core array to simplicity is allowed without loss of fit. Simplifying arrays also facilitates the study of array rank. The typical rank of a three-way array is the smallest number of rank-one arrays that have the array as their sum, when the array is generated by random sampling from a continuous distribution. In some applications, the core array of Tucker PCA is constrained to have a vast majority of zero elements. Both simplicity and typical rank results can be applied to distinguish constrained Tucker PCA models from tautologies. An update of typical rank results over the real number field is given in the form of two tables.     

An IRT Model with a Parameter-Driven Process for Change

An IRT model with a parameter-driven process for change is proposed. Quantitative differences between persons are taken into account by a continuous latent variable, as in common IRT models. In addition, qualitative interindividual differences and autodependencies are accounted for by assuming within-subject variability with respect to the parameters of the IRT model. In particular, the parameters of the IRT model are governed by an unobserved or “hidden'” homogeneous Markov process. The model includes the mixture linear logistic test model (Mislevy & Verhelst, 1990), the mixture Rasch model (Rost, 1990), and the Saltus model (Wilson, 1989) as specific instances. The model is applied to a longitudinal experiment on discontinuity in conservation acquisition (van der Maas, 1993). Frank Rijmen was supported by the Fund for Scientific Research Flanders (FWO), the GOA/2000/02 granted by the Katholieke Universiteit Leuven to Paul De Boeck and Iven Van Mechelen, and the PDM/02/067 granted by the Katholieke Universiteit Leuven to Paul De Boeck.     

Three-Mode Component Analysis with Crisp or Fuzzy Partition of Units

A new methodology is proposed for the simultaneous reduction of units, variables, and occasions of a three-mode data set. Units are partitioned into a reduced number of classes, while, simultaneously, components for variables and occasions accounting for the largest common information for the classification are identified. The model is a constrained three-mode factor analysis and it can be seen as a generalization of the REDKM model proposed by De Soete and Carroll for two-mode data. The least squares fitting problem is mathematically formalized as a constrained problem in continuous and discrete variables. An iterative alternating least squares algorithm is proposed to give an efficient solution to this minimization problem in the crisp and fuzzy classification context. The performances of the proposed methodology are investigated by a simulation study comparing our model with other competing methodologies. Different procedures for starting the proposed algorithm have also been tested. A discussion of some interesting differences in the results follows. Finally, an application to real data illustrates the ability of the proposed model to provide substantive insights into the data complexities.