Visualising contingency table data Dongwen Luo, G. R. Wood, G. Jones.

Slides:



Advertisements
Similar presentations
B ETTI NUMBERS OF RANDOM SIMPLICIAL COMPLEXES MATTHEW KAHLE & ELIZABETH MECKE Presented by Ariel Szapiro.
Advertisements

8.1 Prisms, Area and Volume Prism – 2 congruent polygons lie in parallel planes corresponding sides are parallel. corresponding vertices are connected.
Chapter 6 Linear Programming: The Simplex Method
Copyright (c) 2003 Brooks/Cole, a division of Thomson Learning, Inc
OR Simplex method (algebraic interpretation) Add slack variables( 여유변수 ) to each constraint to convert them to equations. (We may refer it as.
Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.
CmpE 104 SOFTWARE STATISTICAL TOOLS & METHODS MEASURING & ESTIMATING SOFTWARE SIZE AND RESOURCE & SCHEDULE ESTIMATING.
Computational Methods for Management and Economics Carla Gomes Module 8b The transportation simplex method.
Easy Optimization Problems, Relaxation, Local Processing for a small subset of variables.
Chapter 11 Contingency Table Analysis. Nonparametric Systems Another method of examining the relationship between independent (X) and dependant (Y) variables.
Concept Quiz Ch. 1-3 True/False
Mixture Designs Simplex Lattice Simplex Centroid
CS232.
Three-Dimensional Figure A three-dimensional figure is a shape whose points do not all lie in the same plane.
Graphing Linear Inequalities
1 Copyright © 2005 Brooks/Cole, a division of Thomson Learning, Inc. Analysis of Categorical Data Test of Independence.
Cross Tabulation and Chi-Square Testing. Cross-Tabulation While a frequency distribution describes one variable at a time, a cross-tabulation describes.
AP Statistics Section 14.2 A. The two-sample z procedures of chapter 13 allowed us to compare the proportions of successes in two groups (either two populations.
Linear Programming independent research project Nick Yates 30 th April 2008.
Learning Objectives for Section 6.2
Presentation by: H. Sarper
Simplex Linear Programming I. Concept II. Model Template III. Class Example IV. Procedure V. Interpretation MAXIMIZATION METHOD Applied Management Science.
Prisms Fun with by D. Fisher
Simplex method (algebraic interpretation)
ECE 556 Linear Programming Ting-Yuan Wang Electrical and Computer Engineering University of Wisconsin-Madison March
Chapter 9: Non-parametric Tests n Parametric vs Non-parametric n Chi-Square –1 way –2 way.
Introduction to 3-Dimensional Figures. A three dimensional figure that has three dimensions: length, width, and height. cube cylinder cone Rectangular.
A. Polyhedrons 1. Vocabulary of Polyhedrons 2. Building Polyhedrons a. Create a net from the Polyhedron b. Create the Polyhedron from the net B. Prisms.
PROJECTIONS OF SOLIDS & SECTIONS OF SOLIDS
OR Chapter 2. Simplex method (2,0) (2,2/3) (1,2)(0,2)
4  The Simplex Method: Standard Maximization Problems  The Simplex Method: Standard Minimization Problems  The Simplex Method: Nonstandard Problems.
The Simplex Algorithm 虞台文 大同大學資工所 智慧型多媒體研究室. Content Basic Feasible Solutions The Geometry of Linear Programs Moving From Bfs to Bfs Organization of a.
3-D SHAPES.
Slide Copyright © 2008 Pearson Education, Inc. Chapter 6 The Normal Distribution.
Geometry. Triangles Triangle angle sum theorem: the sum of the angles in any triangle is 180° Triangle inequality theorem: the sum of the lengths of any.
Three- Dimensional Figures #37. A polyhedron is a three-dimensional object with flat surfaces, called faces, that are polygons. When two faces of a three-dimensional.
University of Colorado at Boulder Yicheng Wang, Phone: , Optimization Techniques for Civil and Environmental Engineering.
OR Simplex method (algebraic interpretation) Add slack variables( 여유변수 ) to each constraint to convert them to equations. (We may refer it as.
The Simplex Algorithm 虞台文 大同大學資工所 智慧型多媒體研究室. Content Basic Feasible Solutions The Geometry of Linear Programs Moving From Bfs to Bfs Organization of a.
Section 12.2: Tests for Homogeneity and Independence in a Two-Way Table.
Chapter 3: Descriptive Study of Bivariate Data. Univariate Data: data involving a single variable. Multivariate Data: data involving more than one variable.
Chapter 11 Chi-Square Procedures 11.2 Contingency Tables; Association.
Making Comparisons All hypothesis testing follows a common logic of comparison Null hypothesis and alternative hypothesis – mutually exclusive – exhaustive.
Linear Programming: Formulations, Geometry and Simplex Method Yi Zhang January 21 th, 2010.
OR  Now, we look for other basic feasible solutions which gives better objective values than the current solution. Such solutions can be examined.
Linear Programming Chap 2. The Geometry of LP  In the text, polyhedron is defined as P = { x  R n : Ax  b }. So some of our earlier results should.
(iii) Simplex method - I D Nagesh Kumar, IISc Water Resources Planning and Management: M3L3 Linear Programming and Applications.
Maths for Signals and Systems Linear Algebra for Engineering Applications Lectures 1-2, Tuesday 13 th October 2014 DR TANIA STATHAKI READER (ASSOCIATE.
Copyright © Cengage Learning. All rights reserved. 8 PROBABILITY DISTRIBUTIONS AND STATISTICS.
1 Chapter 4 Geometry of Linear Programming  There are strong relationships between the geometrical and algebraic features of LP problems  Convenient.
CHAPTER 6: SAMPLING, SAMPLING DISTRIBUTIONS, AND ESTIMATION Leon-Guerrero and Frankfort-Nachmias, Essentials of Statistics for a Diverse Society.
Linear Programming Many problems take the form of maximizing or minimizing an objective, given limited resources and competing constraints. specify the.
3.1 Clustering Finding a good clustering of the points is a fundamental issue in computing a representative simplicial complex. Mapper does not place any.
Chapter 9: Non-parametric Tests
Stat 261 Two phase method.
Making Comparisons All hypothesis testing follows a common logic of comparison Null hypothesis and alternative hypothesis mutually exclusive exhaustive.
Association between two categorical variables
3.1 Clustering Finding a good clustering of the points is a fundamental issue in computing a representative simplicial complex. Mapper does not place any.
Elements of Combinatorial Topology
Linear Programming.
Polyhedron Here, we derive a representation of polyhedron and see the properties of the generators. We also see how to identify the generators. The results.
Linear Programming CISC4080, Computer Algorithms CIS, Fordham Univ.
Polyhedron Here, we derive a representation of polyhedron and see the properties of the generators. We also see how to identify the generators. The results.
Relations in Categorical Data
Solving Linear Programming Problems: Asst. Prof. Dr. Nergiz Kasımbeyli
Inference on Categorical Data
Simplex method (algebraic interpretation)
Solid Geometry.
Geometry: Three Dimensional Solids
Chapter 2. Simplex method
Presentation transcript:

Visualising contingency table data Dongwen Luo, G. R. Wood, G. Jones

Introduction: A contingency table is a cross-tabulation of categorical variables. When faced with contingency table data, it is useful to have a quick method for visualising the associated distributions. A geometric object and simplex method is useful for picturing the distributions within a contingency table. Based on a two-by-two contingency table as simple.

Objective: The primary aim of this article is to show how the distributions of a contingency table can be presented geometrically using the concept of Simplex.

Three distributions: Joint distribution Conditional distribution Marginal distribution This article pictures these three types in a simplex.

Simplex A popular method in linear algebra. Used in optimization problem. Starts by picking a vertex first. Then we look at the neighbors of this vertex. If there is a neighbor that gives a better solution with respect to the objective function (max/min), we pivot to that new vertex. We follow this procedure until we reach a vertex that none of its neighboring vertices will give a better solution. Therefore we reach the optimal solution.

How to present in a simplex? For a given contingency table, the joint distribution can be represented by weights on all vertices of the simplex. A conditional distribution by weights on vertices of a face of the simplex. A marginal distribution by weights on the faces containing the conditional distributions.

Attitude IncomeForAgainst Low High Example: Income level vs acceptance of genetic engineering of food (Australia-wide survey)

12Total Notations for three distributions:

Geometry of the three distributions:

Tetrahedron: In geometry, it is a polyhedron composed of four triangular faces, three of which meet at each corner or vertex. It is the three-dimensional case of the more general concept of a Euclidean simplex. For any tetrahedron there exists a sphere (called the circumsphere) on which all four vertices lie.

points A, B, C and D Figure (a)

Figure 1

joint distribution Income and Attitude point J in the tetrahedron Table 3 Relative frequency and the conditional distribution of X2|X1 for the Australian survey data. Attitude IncomeForAgainstTotal Low (0.5375)(0.4625) High (0.6353)(0.3647) Total Figure 1

Conditional distribution: Figure 1

Marginal distribution: Since, J = C C2, the marginal distribution of Income, (0.5369, ), can be specialized now as weights and on C1 and C2 having resultant J. (For our example) Figure 1

Presentation of distributions by simplex: Joint Distribution Conditional Distribution Marginal Distribution by weights on all vertices of the simplex weights on vertices of a face of the simplex weights on the faces containing the conditional distributions.

Fienberg and Gilbert (1970) showed that the loci of all points corresponding to independence of rows and columns in a 2×2 table is a portion of a hyperbolic paraboloid in the tetrahedron, For a given sample size the further J is from the independence surface, the greater the dependence between X1 and X2.

For higher dimensions: The three distribution can be presented in a higher dimensional simplex. This simplex has as many vertices as cells of the table. For conditional distribution partitions all vertices of the simplex. The each partition set forms a face of the simplex. A distribution conditional on levels of the chosen variables appears as weights on vertices of the associated face. Marginal distribution is obtained by the weights of the faces of each partition.

Example: A 4x4 table with variables X1 and X2 The joint distribution is the weights on the sixteen vertices (4x4) of the simplex S15. For conditional, X2|X1, the vertices of S15 are partitioned into four sets of four using the levels of X1. Four faces of S15 are then constructed as convex hulls of each set of vertices. The distribution of X2 conditional upon a given level of X1 is weights on the vertices of the associated face. The marginal distribution of X1 is weights on the four faces.

Geometry of 4x4 table: A conditional distribution is a weighting of the vertices of a partition set. For example, a weighting on the vertices of the upper shaded simplex. The associated marginal distribution of the subset of variables is the weighting of the facial simplexes formed by the partition, shown here using shading. Figure 3

Conclusions: These ideas can be generalized to multi-way tables. Using geometrical concept and simplex, we can present the multi-way tables in a sphere form. This spherize form gives us very clear cut idea about the form of the distributions associated with tables. We can easily compare this approach to compare different types of models as well as for drawing inferences about the data.

Thank you