Some developments in multivariate generalizability

This article is concerned with estimation of components of maximum generalizability in multifacet experimental designs involving multiple dependent measures. Within a Type II multivariate analysis of variance framework, components of maximum generalizability are defined as those composites of the dependent measures that maximize universe score variance for persons relative to observed score variance. The coefficient of maximum generalizability, expressed as a function of variance component matrices, is shown to equal the squared canonical correlation between true and observed scores. Emphasis is placed on estimation of variance component matrices, on the distinction between generalizability- and decision-studies, and on extension to multifacet designs involving crossed and nested facets. An example of a two-facet partially nested design is provided.Appreciation is expressed to the Office of Research in Medical Education, University of Texas Medical Branch, for permitting use of their data.     

Two-matrix orthogonal rotation procedures

Examples are presented in which it is either desirable or necessary to transform two sets of orthogonal axes to simple structure positions by means of the same transformation matrix. A solution is then outlined which represents a two-matrix extension of the general orthomax orthogonal rotation criterion. In certain circumstances, oblique two-matrix solutions are possible using the procedure outlined and the Harris-Kaiser [1964] logic. Finally, an illustrative example is presented in which the preceding technique is applied in the context of an inter-battery factor analysis.The work reported herein was supported by Grant S72-1886 from the Canada Council. The author acknowledges the helpful contributions of Nancy Reid and Lawrence Ward to parts of this paper.     

Probability matrix decomposition models

In this paper, we consider a class of models for two-way matrices with binary entries of 0 and 1. First, we considerBoolean matrix decomposition, conceptualize it as alatent response model (LRM) and, by making use of this conceptualization, generalize it to a larger class of matrix decomposition models. Second,probability matrix decomposition (PMD) models are introduced as a probabilistic version of this larger class of deterministic matrix decomposition models. Third, an algorithm for the computation of the maximum likelihood (ML) and the maximum a posteriori (MAP) estimates of the parameters of PMD models is presented. This algorithm is an EM-algorithm, and is a special case of a more general algorithm that can be used for the whole class of LRMs. And fourth, as an example, a PMD model is applied to data on decision making in psychiatric diagnosis. This paper is based on a chapter of the first author's doctoral dissertation, written at the University of Leuven and supervised by Paul De Boeck.     

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

The approximation of two-mode proximity matrices by sums of order-constrained matrices

A least-squares strategy is proposed for representing a two-mode proximity matrix as an approximate sum of a small number of matrices that satisfy certain simple order constraints on their entries. The primary class of constraints considered define Q-forms (or anti-Q-forms) for a two-mode matrix, where after suitable and separate row and column reorderings, the entries within each row and within each column are nondecreasing (or nonincreasing) to a maximum (or minimum) and thereafter nonincreasing (or nondecreasing). Several other types of order constraints are also mentioned to show how alternative structures can be considered using the same computational strategy.     

Enumeration and simulation methods for 0–1 matrices with given marginals

Data in the form of zero-one matrices where conditioning on the marginals is relevant arise in diverse fields such as social networks and ecology; directed graphs constitute an important special case. An algorithm is given for the complete enumeration of the family of all zero-one matrices with given marginals and with a prespecified set of cells with structural zero entries. Complete enumeration is computationally feasible only for relatively small matrices. Therefore, a more useable Monte Carlo simulation method for the uniform distribution over this family is given, based on unequal probability sampling and ratio estimation. This method is applied to testing reciprocity of choices in social networks.The author wishes to thank Cajo ter Braak and John Birks for pointing out the relevance of this subject for ecology; and also Albert Verbeek and Ivo Molenaar, a referee, the Editor, and the Associate Editor for their comments. An earlier version of this paper was presented at the Stockholm Conference on Random Graphs and Applications (April 25–27, 1989), organized with financial support from the Swedish Council of Research in the Humanities and the Social Sciences.     

On the validity of Raven’s matrices test: Does spatial ability contribute to performance?

The paper reports on an investigation of the convergent and discriminant validity of Raven’s matrices in considering reasoning and spatial abilities. Raven’s advanced progressive matrices (APM) and four scales representing reasoning, visualization, mental rotation and closure were applied to a sample of N = 280 university students. The data were investigated by means of structural equation modeling. The results demonstrated convergent validity of APM with respect to reasoning. In contrast, in investigating discriminant validity substantial correlations of moderate size between APM and the scales representing spatial abilities were observed. However, the investigation of the structure of the prediction of APM revealed that the scales representing spatial abilities did not improve the prediction based on the reasoning scale alone at the latent level. Consequently, it is suggested that Raven’s matrices show good convergent validity and slightly impaired discriminant validity.     

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.     

Two-Way Regularized Fuzzy Clustering of Multiple Correspondence Analysis

Multiple correspondence analysis (MCA) is a useful tool for investigating the interrelationships among dummy-coded categorical variables. MCA has been combined with clustering methods to examine whether there exist heterogeneous subclusters of a population, which exhibit cluster-level heterogeneity. These combined approaches aim to classify either observations only (one-way clustering of MCA) or both observations and variable categories (two-way clustering of MCA). The latter approach is favored because its solutions are easier to interpret by providing explicitly which subgroup of observations is associated with which subset of variable categories. Nonetheless, the two-way approach has been built on hard classification that assumes observations and/or variable categories to belong to only one cluster. To relax this assumption, we propose two-way fuzzy clustering of MCA. Specifically, we combine MCA with fuzzy k-means simultaneously to classify a subgroup of observations and a subset of variable categories into a common cluster, while allowing both observations and variable categories to belong partially to multiple clusters. Importantly, we adopt regularized fuzzy k-means, thereby enabling us to decide the degree of fuzziness in cluster memberships automatically. We evaluate the performance of the proposed approach through the analysis of simulated and real data, in comparison with existing two-way clustering approaches.