DOCSLIB.ORG

Multivariate Statistics Chapter 6: Cluster Analysis

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Multivariate Statistics Chapter 6: Cluster Analysis Multivariate Statistics Chapter 6: Cluster Analysis Pedro Galeano Departamento de Estad´ıstica Universidad Carlos III de Madrid [email protected] Course 2017/2018 Master in Mathematical Engineering Pedro Galeano (Course 2017/2018) Multivariate Statistics - Chapter 6 Master in Mathematical Engineering 1 / 70 1 Introduction 2 The clustering problem 3 Hierarchical clustering 4 Partition clustering 5 Model-based clustering Pedro Galeano (Course 2017/2018) Multivariate Statistics - Chapter 6 Master in Mathematical Engineering 2 / 70 Introduction The purpose of cluster analysis is to group objects in a multivariate data set into different homogeneous groups. This is done by grouping individuals that are somehow similar according to some appropriate criterion. Once the clusters are obtained, it is generally useful to describe each group using some descriptive tools to create a better understanding of the differences that exists among the formulated groups. Cluster methods are also known as unsupervised classification methods. These are different than the supervised classification methods, or Classification Analysis, that will be presented in Chapter 7. Pedro Galeano (Course 2017/2018) Multivariate Statistics - Chapter 6 Master in Mathematical Engineering 3 / 70 Introduction Clustering techniques are applicable whenever a data set needs to be grouped into meaningful groups. In some situations we know that the data naturally fall into a certain number of groups, but usually the number of clusters is unknown. Some clustering methods requires the user to specify the number of clusters a priori. Thus, unless additional information exists about the number of clusters, it is reasonable to explore different values and looks at potential interpretation of the clustering results. Pedro Galeano (Course 2017/2018) Multivariate Statistics - Chapter 6 Master in Mathematical Engineering 4 / 70 Introduction Central to some clustering approaches is the notion of proximity of two random vectors. We usually measure the degree of proximity of two multivariate observations by a distance measure. The Euclidean distance is typically the first and also the most common distance one applies in Cluster Analysis. Other distances such as those presented in Chapter 5 can be considered. Pedro Galeano (Course 2017/2018) Multivariate Statistics - Chapter 6 Master in Mathematical Engineering 5 / 70 Introduction Some cluster procedures are based on using mixtures of distributions. The underlying assumptions of these mixtures, i.e., that the data in the different parts are from a certain distribution, are not easy to verify and may not hold. However, these methods have been shown to be powerful under general circum- stances. Pedro Galeano (Course 2017/2018) Multivariate Statistics - Chapter 6 Master in Mathematical Engineering 6 / 70 Introduction Cluster Analysis can be seen as an exploratory tool. Different cluster solutions will appear if one considers different number of clus- ters, distance measures or mixture distribution. These solutions might provide new understanding of the structure of the data set. Therefore, if possible, the interpretation of cluster solutions should involve sub- ject experts. Pedro Galeano (Course 2017/2018) Multivariate Statistics - Chapter 6 Master in Mathematical Engineering 7 / 70 Introduction There are a large vast amount of cluster procedures. Here, we will focus on: I Hierarchical clustering: start with single clusters (individual observations) and merges clusters or start with a single cluster (the whole data set) and split clusters. I Partition clustering: starts from a given group definition and proceed by exchang- ing elements between groups until a certain criterion is optimized. I Model-based clustering: the random vectors are modeled by mixtures of distri- butions leading to posterior probabilities of the observation memberships. Before presenting these methods, we define the problem. Pedro Galeano (Course 2017/2018) Multivariate Statistics - Chapter 6 Master in Mathematical Engineering 8 / 70 The clustering problem Given a data matrix X of dimension n × p, we want to obtain a partition of the data set, C1;:::; CK , where Ck , for k = 1;:::; K, are sets containing the indices of the observations in each cluster. Therefore, i 2 Ck means that the observation xi· belongs to cluster k. Any partition C1;:::; CK verifies the following two properties: I Each observation belongs to at least one of the K clusters, i.e., C1 [···[ CK = f1;:::; ng. 0 I No observation belongs to more than one cluster, i.e., Ck \ Ck0 = ;, for k 6= k . The problem is to find an appropriate partition, C1;:::; CK , for our data set. Pedro Galeano (Course 2017/2018) Multivariate Statistics - Chapter 6 Master in Mathematical Engineering 9 / 70 Clustering problem The key interpretative point of hierarchical and partition methods is that ele- ments within a Ck are much more similar to each other than to any element from a different Ck0 . This interpretation does not necessarily hold in model-based clustering, where similar observations can belong to different clusters. Pedro Galeano (Course 2017/2018) Multivariate Statistics - Chapter 6 Master in Mathematical Engineering 10 / 70 Hierarchical clustering There are two types of hierarchical clustering methods: 1 In agglomerative clustering, one starts with n single clusters and merges them into larger clusters. 2 In divisive clustering, one starts with a single cluster and divides it into smaller clusters. Most attention has been paid on agglomerative methods. However, arguments have been made that divisive methods can provide more sophisticated and robust clusterings. Pedro Galeano (Course 2017/2018) Multivariate Statistics - Chapter 6 Master in Mathematical Engineering 11 / 70 Hierarchical clustering The end result of all hierarchical clustering methods is a graphical output called dendogram, where the k-th cluster solution is obtained by merging some of the clusters from the (k + 1)-th cluster solution. The result of hierarchical algorithms depend on the distance considered. In particular, when the variables are in different units of measurement and the distance used do not take into account this fact, it is better to standardize the variables. Pedro Galeano (Course 2017/2018) Multivariate Statistics - Chapter 6 Master in Mathematical Engineering 12 / 70 Hierarchical clustering The algorithm for agglomerative hierarchical clustering (agglomerative nesting or agnes) is given next: 1 Initially, each observation xi·, for i = 1;:::; n, is a cluster. 0 2 Compute D = fdii0 ; i; i = 1;:::; ng, the matrix that contains the distances be- tween the n observations (clusters). 0 3 Find the smallest distance in D, say, dII 0 and merge clusters I and I to form a new cluster II 0. 0 4 Compute the distances, dII 0;I 00 , between the new cluster II and all other clusters I 00 6= II 0 (detailed in the next slide). 0 5 Form a new distance matrix, D, by deleting rows and columns I and I and adding a new row and column II 0 with the distances computed from step 4. 6 Repeat steps 3, 4 and 5 a total of n − 1 times until all observations are merged together into a single cluster. Pedro Galeano (Course 2017/2018) Multivariate Statistics - Chapter 6 Master in Mathematical Engineering 13 / 70 Hierarchical clustering 0 Computation of the distances dII 0;I 00 , between the new cluster II and all other clusters I 00 6= II 0 can be done using one of the following linkage methods: I Single linkage: dII 0;I 00 = min fdI ;I 00 ; dI 0;I 00 g. I Complete linkage: dII 0;I 00 = max fdI ;I 00 ; dI 0;I 00 g. P P I Average linkage: dII 0;I 00 = i2II 0 i002II 00 di;i00 = (nii0 ni00 ), where nii0 and ni00 are the number of items in clusters II 0 and I 00, respectively. I Ward linkage: dII 0;I 00 is the squared Euclidean distance between the sample mean vector of the elements in both clusters. Pedro Galeano (Course 2017/2018) Multivariate Statistics - Chapter 6 Master in Mathematical Engineering 14 / 70 Hierarchical clustering The dendogram is a graphical representation of the cluster solutions. Particularly, the dendogram shows the distances at which clusters are combined together to form new clusters. Similar clusters are combined at low distances, whereas dissimilar clusters are combined at high distances. Consequently, the difference in distances defines how close clusters are of each other. Pedro Galeano (Course 2017/2018) Multivariate Statistics - Chapter 6 Master in Mathematical Engineering 15 / 70 Hierarchical clustering To obtain a partition of the data into a specified number of groups, we can cut the dendogram at an appropriate distance. The number of vertical lines, K, cut by a horizontal line on the dendogram at a given distance identifies a K-cluster solution. The items located at the end of all branches below the horizontal line constitute the members of the cluster. Pedro Galeano (Course 2017/2018) Multivariate Statistics - Chapter 6 Master in Mathematical Engineering 16 / 70 Hierarchical clustering To know whether or not the cluster solution is appropriate, we can use the Silhouette. Let: I a (xi·) be the average distance of xi· with respect all other points in its cluster. I b (xi·) be the lowest average distance of xi· to any other cluster of which xi· is not a member. I s (xi·) be the silhouette of xi·: a (xi·) − b (xi·) s (xi·) = max fa (xi·) ; b (xi·)g The silhouette s (xi·) ranges from −1 to 1, such that a positive value means that the object is well matched to its own cluster and a negative value means that the object is bad matched to its own cluster. The average silhouette gives a global measure of the assignment, such that the more positive, the better the configuration. Pedro Galeano (Course 2017/2018) Multivariate Statistics - Chapter 6 Master in Mathematical Engineering 17 / 70 Illustrative example (I) We are going to apply the agnes algorithm to the states data set. For that, we make use of the Euclidean distance after take logarithms of the first, third and eighth variables and after standardize all the variables.
Load more

Recommended publications
  • Arxiv:1910.08883V3 [Stat.ML] 2 Apr 2021 in Real Data [8,9]
    Nonpar MANOVA via Independence Testing Sambit Panda1;2, Cencheng Shen3, Ronan Perry1, Jelle Zorn4, Antoine Lutz4, Carey E. Priebe5 and Joshua T. Vogelstein1;2;6∗ Abstract. The k-sample testing problem tests whether or not k groups of data points are sampled from the same distri- bution. Multivariate analysis of variance (Manova) is currently the gold standard for k-sample testing but makes strong, often inappropriate, parametric assumptions. Moreover, independence testing and k-sample testing are tightly related, and there are many nonparametric multivariate independence tests with strong theoretical and em- pirical properties, including distance correlation (Dcorr) and Hilbert-Schmidt-Independence-Criterion (Hsic). We prove that universally consistent independence tests achieve universally consistent k-sample testing, and that k- sample statistics like Energy and Maximum Mean Discrepancy (MMD) are exactly equivalent to Dcorr. Empirically evaluating these tests for k-sample-scenarios demonstrates that these nonparametric independence tests typically outperform Manova, even for Gaussian distributed settings. Finally, we extend these non-parametric k-sample- testing procedures to perform multiway and multilevel tests. Thus, we illustrate the existence of many theoretically motivated and empirically performant k-sample-tests. A Python package with all independence and k-sample tests called hyppo is available from https://hyppo.neurodata.io/. 1 Introduction A fundamental problem in statistics is the k-sample testing problem. Consider the p p two-sample problem: we obtain two datasets ui 2 R for i = 1; : : : ; n and vj 2 R for j = 1; : : : ; m. Assume each ui is sampled independently and identically (i.i.d.) from FU and that each vj is sampled i.i.d.
    [Show full text]
  • On the Meaning and Use of Kurtosis
    Psychological Methods Copyright 1997 by the American Psychological Association, Inc. 1997, Vol. 2, No. 3,292-307 1082-989X/97/$3.00 On the Meaning and Use of Kurtosis Lawrence T. DeCarlo Fordham University For symmetric unimodal distributions, positive kurtosis indicates heavy tails and peakedness relative to the normal distribution, whereas negative kurtosis indicates light tails and flatness. Many textbooks, however, describe or illustrate kurtosis incompletely or incorrectly. In this article, kurtosis is illustrated with well-known distributions, and aspects of its interpretation and misinterpretation are discussed. The role of kurtosis in testing univariate and multivariate normality; as a measure of departures from normality; in issues of robustness, outliers, and bimodality; in generalized tests and estimators, as well as limitations of and alternatives to the kurtosis measure [32, are discussed. It is typically noted in introductory statistics standard deviation. The normal distribution has a kur- courses that distributions can be characterized in tosis of 3, and 132 - 3 is often used so that the refer- terms of central tendency, variability, and shape. With ence normal distribution has a kurtosis of zero (132 - respect to shape, virtually every textbook defines and 3 is sometimes denoted as Y2)- A sample counterpart illustrates skewness. On the other hand, another as- to 132 can be obtained by replacing the population pect of shape, which is kurtosis, is either not discussed moments with the sample moments, which gives or, worse yet, is often described or illustrated incor- rectly. Kurtosis is also frequently not reported in re- ~(X i -- S)4/n search articles, in spite of the fact that virtually every b2 (•(X i - ~')2/n)2' statistical package provides a measure of kurtosis.
    [Show full text]
  • Univariate and Multivariate Skewness and Kurtosis 1
    Running head: UNIVARIATE AND MULTIVARIATE SKEWNESS AND KURTOSIS 1 Univariate and Multivariate Skewness and Kurtosis for Measuring Nonnormality: Prevalence, Influence and Estimation Meghan K. Cain, Zhiyong Zhang, and Ke-Hai Yuan University of Notre Dame Author Note This research is supported by a grant from the U.S. Department of Education (R305D140037). However, the contents of the paper do not necessarily represent the policy of the Department of Education, and you should not assume endorsement by the Federal Government. Correspondence concerning this article can be addressed to Meghan Cain ([email protected]), Ke-Hai Yuan ([email protected]), or Zhiyong Zhang ([email protected]), Department of Psychology, University of Notre Dame, 118 Haggar Hall, Notre Dame, IN 46556. UNIVARIATE AND MULTIVARIATE SKEWNESS AND KURTOSIS 2 Abstract Nonnormality of univariate data has been extensively examined previously (Blanca et al., 2013; Micceri, 1989). However, less is known of the potential nonnormality of multivariate data although multivariate analysis is commonly used in psychological and educational research. Using univariate and multivariate skewness and kurtosis as measures of nonnormality, this study examined 1,567 univariate distriubtions and 254 multivariate distributions collected from authors of articles published in Psychological Science and the American Education Research Journal. We found that 74% of univariate distributions and 68% multivariate distributions deviated from normal distributions. In a simulation study using typical values of skewness and kurtosis that we collected, we found that the resulting type I error rates were 17% in a t-test and 30% in a factor analysis under some conditions. Hence, we argue that it is time to routinely report skewness and kurtosis along with other summary statistics such as means and variances.
    [Show full text]
  • Multivariate Chemometrics As a Strategy to Predict the Allergenic Nature of Food Proteins
    S S symmetry Article Multivariate Chemometrics as a Strategy to Predict the Allergenic Nature of Food Proteins Miroslava Nedyalkova 1 and Vasil Simeonov 2,* 1 Department of Inorganic Chemistry, Faculty of Chemistry and Pharmacy, University of Sofia, 1 James Bourchier Blvd., 1164 Sofia, Bulgaria; [email protected]fia.bg 2 Department of Analytical Chemistry, Faculty of Chemistry and Pharmacy, University of Sofia, 1 James Bourchier Blvd., 1164 Sofia, Bulgaria * Correspondence: [email protected]fia.bg Received: 3 September 2020; Accepted: 21 September 2020; Published: 29 September 2020 Abstract: The purpose of the present study is to develop a simple method for the classification of food proteins with respect to their allerginicity. The methods applied to solve the problem are well-known multivariate statistical approaches (hierarchical and non-hierarchical cluster analysis, two-way clustering, principal components and factor analysis) being a substantial part of modern exploratory data analysis (chemometrics). The methods were applied to a data set consisting of 18 food proteins (allergenic and non-allergenic). The results obtained convincingly showed that a successful separation of the two types of food proteins could be easily achieved with the selection of simple and accessible physicochemical and structural descriptors. The results from the present study could be of significant importance for distinguishing allergenic from non-allergenic food proteins without engaging complicated software methods and resources. The present study corresponds entirely to the concept of the journal and of the Special issue for searching of advanced chemometric strategies in solving structural problems of biomolecules. Keywords: food proteins; allergenicity; multivariate statistics; structural and physicochemical descriptors; classification 1.
    [Show full text]
  • In the Term Multivariate Analysis Has Been Defined Variously by Different Authors and Has No Single Definition
    Newsom Psy 522/622 Multiple Regression and Multivariate Quantitative Methods, Winter 2021 1 Multivariate Analyses The term "multivariate" in the term multivariate analysis has been defined variously by different authors and has no single definition. Most statistics books on multivariate statistics define multivariate statistics as tests that involve multiple dependent (or response) variables together (Pituch & Stevens, 2105; Tabachnick & Fidell, 2013; Tatsuoka, 1988). But common usage by some researchers and authors also include analysis with multiple independent variables, such as multiple regression, in their definition of multivariate statistics (e.g., Huberty, 1994). Some analyses, such as principal components analysis or canonical correlation, really have no independent or dependent variable as such, but could be conceived of as analyses of multiple responses. A more strict statistical definition would define multivariate analysis in terms of two or more random variables and their multivariate distributions (e.g., Timm, 2002), in which joint distributions must be considered to understand the statistical tests. I suspect the statistical definition is what underlies the selection of analyses that are included in most multivariate statistics books. Multivariate statistics texts nearly always focus on continuous dependent variables, but continuous variables would not be required to consider an analysis multivariate. Huberty (1994) describes the goals of multivariate statistical tests as including prediction (of continuous outcomes or
    [Show full text]
  • Nonparametric Multivariate Kurtosis and Tailweight Measures
    Nonparametric Multivariate Kurtosis and Tailweight Measures Jin Wang1 Northern Arizona University and Robert Serfling2 University of Texas at Dallas November 2004 – final preprint version, to appear in Journal of Nonparametric Statistics, 2005 1Department of Mathematics and Statistics, Northern Arizona University, Flagstaff, Arizona 86011-5717, USA. Email: [email protected]. 2Department of Mathematical Sciences, University of Texas at Dallas, Richardson, Texas 75083- 0688, USA. Email: [email protected]. Website: www.utdallas.edu/∼serfling. Support by NSF Grant DMS-0103698 is gratefully acknowledged. Abstract For nonparametric exploration or description of a distribution, the treatment of location, spread, symmetry and skewness is followed by characterization of kurtosis. Classical moment- based kurtosis measures the dispersion of a distribution about its “shoulders”. Here we con- sider quantile-based kurtosis measures. These are robust, are defined more widely, and dis- criminate better among shapes. A univariate quantile-based kurtosis measure of Groeneveld and Meeden (1984) is extended to the multivariate case by representing it as a transform of a dispersion functional. A family of such kurtosis measures defined for a given distribution and taken together comprises a real-valued “kurtosis functional”, which has intuitive appeal as a convenient two-dimensional curve for description of the kurtosis of the distribution. Several multivariate distributions in any dimension may thus be compared with respect to their kurtosis in a single two-dimensional plot. Important properties of the new multivariate kurtosis measures are established. For example, for elliptically symmetric distributions, this measure determines the distribution within affine equivalence. Related tailweight measures, influence curves, and asymptotic behavior of sample versions are also discussed.
    [Show full text]
  • BASIC MULTIVARIATE THEMES and METHODS Lisa L. Harlow University of Rhode Island, United States [email protected] Much of Science I
    ICOTS-7, 2006: Harlow (Refereed) BASIC MULTIVARIATE THEMES AND METHODS Lisa L. Harlow University of Rhode Island, United States [email protected] Much of science is concerned with finding latent order in a seemingly complex array of variables. Multivariate methods help uncover this order, revealing a meaningful pattern of relationships. To help illuminate several multivariate methods, a number of questions and themes are presented, asking: How is it similar to other methods? When to use? How much multiplicity is encompassed? What is the model? How are variance, covariance, ratios and linear combinations involved? How to assess at a macro- and micro-level? and How to consider an application? Multivariate methods are described as an extension of univariate methods. Three basic models are presented: Correlational (e.g., canonical correlation, factor analysis, structural equation modeling), Prediction (e.g., multiple regression, discriminant function analysis, logistic regression), and Group Difference (e.g., ANCOVA, MANOVA, with brief applications. INTRODUCTION Multivariate statistics is a useful set of methods for analyzing a large amount of information in an integrated framework, focusing on the simplicity (e.g., Simon, 1969) and latent order (Wheatley, 1994) in a seemingly complex array of variables. Benefits to using multivariate statistics include: Expanding your sense of knowing, allowing rich and realistic research designs, and having flexibility built on similar univariate methods. Several potential drawbacks include: needing large samples, a belief that multivariate methods are challenging to learn, and results that may seem more complex to interpret than those from univariate methods. Given these considerations, students may initially view the various multivariate methods (e.g., multiple regression, multivariate analysis of variance) as a set of complex and very different procedures.
    [Show full text]
  • Pthe Key to Multivariate Statistics Is Understanding
    Multivariate Statistics Summary and Comparison of Techniques P The key to multivariate statistics is understanding conceptually the relationship among techniques with regards to: < The kinds of problems each technique is suited for < The objective(s) of each technique < The data structure required for each technique < Sampling considerations for each technique < Underlying mathematical model, or lack thereof, of each technique < Potential for complementary use of techniques 1 Multivariate Techniques Model Techniques y1 + y2 + ... + yi Unconstrained Ordination Cluster Analysis y1 + y2 + ... + yi = x Multivariate ANOVA Multi-Response Permutation Analysis of Similarities Mantel Test Discriminant Analysis Logistic Regression Classification Trees Indicator Species Analysis y1 + y2 + ... + yi = x1 + x2 + ... + xj Constrained Ordination Canonical Correlation Multivariate Regression Trees 2 Multivariate Techniques Technique Objective Unconstrained Ordination Extract gradients of maximum (PCA, MDS, CA, DCA, NMDS) variation Cluster Analysis Establish groups of similar (Family of techinques) entities Discrimination Test for & describe differences (MANOVA, MRPP, ANOSIM, among groups of entities or Mantel, DA, LR, CART, ISA) predict group membership Constrained Ordination Extract gradients of variation in (RDA, CCA, CAP) dependent variables explainable by independent variables 3 Multivariate Techniques Technique Variance Emphasis Unconstrained Ordination Emphasizes variation among (PCA, MDS, CA, DCA, NMDS) individual sampling entities Cluster Analysis
    [Show full text]
  • SASEG 5 - Exercise – Hypothesis Testing
    SASEG 5 - Exercise – Hypothesis Testing (Fall 2015) Sources (adapted with permission)- T. P. Cronan, Jeff Mullins, Ron Freeze, and David E. Douglas Course and Classroom Notes Enterprise Systems, Sam M. Walton College of Business, University of Arkansas, Fayetteville Microsoft Enterprise Consortium IBM Academic Initiative SAS® Multivariate Statistics Course Notes & Workshop, 2010 SAS® Advanced Business Analytics Course Notes & Workshop, 2010 Microsoft® Notes Teradata® University Network Copyright © 2013 ISYS 5503 Decision Support and Analytics, Information Systems; Timothy Paul Cronan. For educational uses only - adapted from sources with permission. No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means, electronic, mechanical, photocopying, or otherwise, without the prior written permission from the author/presenter. 2 Hypothesis Testing Judicial Analogy 71 In a criminal court, you put defendants on trial because you suspect they are guilty of a crime. But how does the trial proceed? Determine the null and alternative hypotheses. The alternative hypothesis is your initial research hypothesis (the defendant is guilty). The null is the logical opposite of the alternative hypothesis (the defendant is not guilty). You generally start with the assumption that the null hypothesis is true. Select a significance level as the amount of evidence needed to convict. In a criminal court of law, the evidence must prove guilt “beyond a reasonable doubt”. In a civil court, the plaintiff must prove his or her case by “preponderance of the evidence.” The burden of proof is decided on before the trial. Collect evidence. Use a decision rule to make a judgment.
    [Show full text]
  • Generalized P-Values and Generalized Confidence Regions for The
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector ARTICLE IN PRESS Journal of Multivariate Analysis 88 (2004) 177–189 Generalized p-values and generalized confidence regions for the multivariate Behrens–Fisher problem and MANOVA Jinadasa Gamage,a Thomas Mathew,b,Ã and Samaradasa Weerahandic a Illinois State University, IL, USA b Department of Mathematics and Statistics, University of Maryland, 1000 Hilltop Circle, Baltimore, MD 21250, USA c Telcordia Technologies, Morristown, NJ, USA Received 29 March 2001 Abstract For two multivariate normal populations with unequal covariance matrices, a procedure is developed for testing the equality of the mean vectors based on the concept of generalized p- values. The generalized p-values we have developed are functions of the sufficient statistics. The computation of the generalized p-values is discussed and illustrated with an example. Numerical results show that one of our generalized p-value test has a type I error probability not exceeding the nominal level. A formula involving only a finite number of chi-square random variables is provided for computing this generalized p-value. The formula is useful in a Bayesian solution as well. The problem of constructing a confidence region for the difference between the mean vectors is also addressed using the concept of generalized confidence regions. Finally, using the generalized p-value approach, a solution is developed for the heteroscedastic MANOVA problem. r 2003 Elsevier Inc. All rights reserved. AMS 1991 subject classifications: 62H15; 62F25 Keywords: Generalized confidence region; Generalized p-value; Generalized test variable; Heteroscedas- ticity; MANOVA; Type I error ÃCorresponding author.
    [Show full text]
  • Multivariate Analysis Concepts 1
    Chapter Multivariate Analysis Concepts 1 1.1 Introduction 1 1.2 Random Vectors, Means, Variances, and Covariances 2 1.3 Multivariate Normal Distribution 5 1.4 Sampling from Multivariate Normal Populations 6 1.5 Some Important Sample Statistics and Their Distributions 8 1.6 Tests for Multivariate Normality 9 1.7 Random Vector and Matrix Generation 17 1.1 Introduction The subject of multivariate analysis deals with the statistical analysis of the data collected on more than one (response) variable. These variables may be correlated with each other, and their statistical dependence is often taken into account when analyzing such data. In fact, this consideration of statistical dependence makes multivariate analysis somewhat different in approach and considerably more complex than the corresponding univariate analysis, when there is only one response variable under consideration. Response variables under consideration are often described as random variables and since their dependence is one of the things to be accounted for in the analyses, these re- sponse variables are often described by their joint probability distribution. This considera- tion makes the modeling issue relatively manageable and provides a convenient framework for scientific analysis of the data. Multivariate normal distribution is one of the most fre- quently made distributional assumptions for the analysis of multivariate data. However, if possible, any such consideration should ideally be dictated by the particular context. Also, in many cases, such as when the data are collected on a nominal or ordinal scales, multivariate normality may not be an appropriate or even viable assumption. In the real world, most data collection schemes or designed experiments will result in multivariate data.
    [Show full text]
  • Exact Multivariate Tests – a New Effective Principle of Controlled Model Choice
    Exact Multivariate Tests – A New Effective Principle of Controlled Model Choice Jürgen Läuter1,2, Maciej Rosołowski1, and Ekkehard Glimm3 1Institute of Medical Informatics, Statistics and Epidemiology (IMISE), Medical Faculty, University of Leipzig, Härtelstr. 16-18, 04107 Leipzig, Germany 2Otto von Guericke University Magdeburg, Mittelstr. 2/151, 39114 Magdeburg, Germany 3Statistical Methodology, Novartis Pharma AG, Basel, Switzerland Address for correspondence: Jürgen Läuter, Mittelstr. 2/151, 39114 Magdeburg, Germany E-mail: [email protected] Key words: Multivariate analysis; Selection of variables; Model choice; High-dimensional tests; Gene expression analysis. Funding: This work was supported by the German BMBF network HaematoSys (BMBF Nr. 0315452A). Abstract High-dimensional tests are applied to find relevant sets of variables and relevant models. If variables are selected by analyzing the sums of products matrices and a corresponding mean- value test is performed, there is the danger that the nominal error of first kind is exceeded. In the paper, well-known multivariate tests receive a new mathematical interpretation such that the error of first kind of the combined testing and selecting procedure can more easily be kept. The null hypotheses on mean values are replaced by hypotheses on distributional sphericity of the individual score responses. Thus, model choice is possible without too strong restrictions. The method is presented for all linear multivariate designs. It is illustrated by an example from bioinformatics: The selection of gene sets for the comparison of groups of patients suf- fering from B-cell lymphomas. 1 Introduction In many applications, the aim of multivariate analysis is to recognize the structure and the system of given individuals.
    [Show full text]