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.     

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.     

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).     

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.     

Discriminating between strong and weak structures in three‐mode principal component analysis

Recently, a number of model selection heuristics (i.e. DIFFIT, CORCONDIA, the numerical convex hull based heuristic) have been proposed for choosing among Parafac and/or Tucker3 solutions of different complexity for a given three‐way three‐mode data set. Such heuristics are often validated by means of extensive simulation studies. However, these simulation studies are unrealistic in that it is assumed that the variance in real three‐way data can be split into two parts: structural variance, due to a true underlying Parafac or Tucker3 model of low complexity, and random noise. In this paper, we start from the much more reasonable assumption that the variance in any real three‐way data set is due to three different sources: (1) a strong Parafac or Tucker3 structure of low complexity, accounting for a considerable amount of variance, (2) a weak Tucker3 structure, capturing less prominent data aspects, and (3) random noise. As such, Parafac and Tucker3 simulation studies are run in which the data are generated by adding a weak Tucker3 structure to a strong Parafac or Tucker3 one and perturbing the resulting data with random noise. The design of these studies is based on the reanalysis of real data sets. In these studies, the performance of the numerical convex hull based model selection method is evaluated with respect to its capability of discriminating strong from weak underlying structures. The results show that in about two‐thirds of the simulated cases, the hull heuristic yields a model of the same complexity as the strong underlying structure and thus succeeds in disentangling strong and weak underlying structures. In the vast majority of the remaining third, this heuristic selects a solution that combines the strong structure and (part of) the weak structure.     

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.     

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.     

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.     

Model based clustering of large data sets: Tracing the development of spelling ability

There are two main theories with respect to the development of spelling ability: the stage model and the model of overlapping waves. In this paper exploratory model based clustering will be used to analyze the responses of more than 3500 pupils to subsets of 245 items. To evaluate the two theories, the resulting clusters will be ordered along a developmental dimension using an external criterion. Solutions for three statistical problems will be given: (1) an algorithm that can handle large data sets and only renders non-degenerate clusters; (2) a goodness of fit test that is not affected by the fact that the number of possible response vectors by far out-weights the number of observed response vectors; and (3) a new technique,data expunction, that can be used to evaluate goodness-of-fit tests if the missing data mechanism is known. Research supported by a grant (NWO 411-21-006) of the Dutch Organization for Scientific Research.     

Points of view analysis revisited: Fitting multidimensional structures to optimal distance components with cluster restrictions on the variables

Points of view analysis (PVA), proposed by Tucker and Messick in 1963, was one of the first methods to deal explicitly with individual differences in multidimensional scaling, but at some point was apparently superceded by the weighted Euclidean model, well-known as the Carroll and Chang INDSCAL model. This paper argues that the idea behind points of view analysis deserves new attention, especially as a technique to analyze group differences. A procedure is proposed that can be viewed as a streamlined, integrated version of the Tucker and Messick Process, which consisted of a number of separate steps. At the same time, our procedure can be regarded as a particularly constrained weighted Euclidean model. While fitting the model, two types of nonlinear data transformations are feasible, either for given dissimilarities, or for variables from which the dissimilarities are derived. Various applications are discussed, where the two types of transformation can be mixed in the same analysis; a quadratic assignment framework is used to evaluate the results.The research of the first author was supported by the Royal Netherlands Academy of Arts and Sciences (KNAW); the research of the second author by the Netherlands Organization for Scientific Research (NWO Grant 560-267-029). An earlier version of this paper was presented at the European Meeting of the Psychometric Society, Leuven, 1989. We wish to thank Willem J. Heiser for his stimulating comments to earlier versions of this paper, and we are grateful to the Editor and anonymous referees for their helpful suggestions.     

A fast method for choosing the numbers of components in Tucker3 analysis

Recently, Timmerman and Kiers proposed an effective procedure for choosing the numbers of components in Tucker3 analysis, a kind of component analysis of three‐way data. The procedure, however, is rather time‐consuming, relying on very many complete Tucker3 analyses. Here, an alternative procedure is proposed, which basically relies on a single, quick analysis of the three‐way data set. In a simulation study it was found that the new procedure is comparable in its effect to the original procedure.     

Projection of a binary criterion into a model of hierarchical classes

A formal analysis is made of how to project an attribute criterion into the hierarchical classes model for object by attribute data proposed by De Boeck and Rosenberg. The projection is conceptualized as the prediction of the attribute criterion by means of a logical rule defined on the basis of attribute combinations from the model. Eliminative and constructive strategies are proposed to find logical rules with maximal predictive power and minimal formula complexity. Logical analyses of a real data set are reported and compared with a logistic regression to demonstrate the usefulness of the logical strategies, and to show the complementarity of logical and probabilistic approaches.The first suthor is Senior Research Assistant of the National Fund for Scientific Research (Belgium). We would like to thank the Editor, the reviewers, Seymour Rosenberg, and Luc Delbeke for their helpful comments on earlier drafts of this article.     

From Zero to Sixty: Calibrating Real-Time Responses

Recent advances in data recording technology have given researchers new ways of collecting on-line and continuous data for analyzing input-output systems. For example, continuous response digital interfaces are increasingly used in psychophysics. The statistical problem related to these input-output systems reduces to linking time-varying covariates to a continuous response variate. Using real-time data obtained from an experiment in psychoacoustics, we showcase new statistical tools that incorporate dynamical elements of an input-output system. We employ functional data analysis (FDA) methods and a simple differential equation to analyze and model the continuous responses. Furthermore, we outline the issues involved in analyzing input-output systems when the exact form of the underlying mathematical model is not known. Finally, we develop a calibration method to facilitate inter-subject and intra-subject comparisons. This work was supported by grants from the National Sciences and Engineering Research Council (NSERC) to J. O. Ramsay and to D. J. Levitin, and by a grant from the Social Sciences and Humanities Research Council (SSHRC) to D. J. Levitin. We would like to thank Bennett Smith for designing and implementing the software used to conduct the pitch tracking experiment. Also, we wish to thank the research assistants in the Levitin Laboratory involved in the data collection: Catherine Chapados, Andrew Schaaf and Carla Himmelman. We would also like to acknowledge Giles Hooker’s work on implementing the generalized profiling software used within this paper.     

Confidence interval-based sample size determination formulas and some mathematical properties for hierarchical data

The use of hierarchical data (also called multilevel data or clustered data) is common in behavioural and psychological research when data of lower-level units (e.g., students, clients, repeated measures) are nested within clusters or higher-level units (e.g., classes, hospitals, individuals). Over the past 25 years we have seen great advances in methods for computing the sample sizes needed to obtain the desired statistical properties for such data in experimental evaluations. The present research provides closed-form and iterative formulas for sample size determination that can be used to ensure the desired width of confidence intervals for hierarchical data. Formulas are provided for a four-level hierarchical linear model that assumes slope variances and inclusion of covariates under both balanced and unbalanced designs. In addition, we address several mathematical properties relating to sample size determination for hierarchical data via the standard errors of experimental effect estimates. These include the relative impact of several indices (e.g., random intercept or slope variance at each level) on standard errors, asymptotic standard errors, minimum required values at the highest level, and generalized expressions of standard errors for designs with any-level randomization under any number of levels. In particular, information on the minimum required values will help researchers to minimize the risk of conducting experiments that are statistically unlikely to show the presence of an experimental effect.     

How children perceive fractals: Hierarchical self-similarity and cognitive development

The ability to understand and generate hierarchical structures is a crucial component of human cognition, available in language, music, mathematics and problem solving. Recursion is a particularly useful mechanism for generating complex hierarchies by means of self-embedding rules. In the visual domain, fractals are recursive structures in which simple transformation rules generate hierarchies of infinite depth. Research on how children acquire these rules can provide valuable insight into the cognitive requirements and learning constraints of recursion.     

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).     

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.