Markov bases and subbases for bounded contingency tables

In this paper we study the computation of Markov bases for contingency tables whose cell entries have an upper bound. It is known that in this case one has to compute universal Gröbner bases, and this is often infeasible also in small- and medium-sized problems. Here we focus on bounded two-way contingency tables under independence model. We show that when these bounds on cells are positive the set of basic moves of all 2 × 2 minors connects all tables with given margins. We also give some results about bounded incomplete table and we conclude with an open problem on the necessary and sufficient condition on the set of structural zeros so that the set of basic moves of all 2 × 2 minors connects all incomplete contingency tables with given positive margins.     

Computing p-values in conditional independence models for a contingency table

We present a Markov chain Monte Carlo (MCMC) method for generating Markov chains using Markov bases for conditional independence models for a four-way contingency table. We then describe a Markov basis characterized by Markov properties associated with a given conditional independence model and show how to use the Markov basis to generate random tables of a Markov chain. The estimates of exact p-values can be obtained from random tables generated by the MCMC method. Numerical experiments examine the performance of the proposed MCMC method in comparison with the χ ² approximation using large sparse contingency tables.     

A VIEW OF THE CHI-SQUARE STATISTIC

Statistical analysis of contingency tables is essentially a discrete multivariate problem. To test independence in a two-way contingency table, one can use different principles such as general class of distance or Mahalanobis distance to derive test statistic. Most of them result in the chi-square statistic, which is a simple test statistic. The disadvantage of the chi-square test is discussed from a multivariate point of view. A new test statistic is proposed for testing independence. This statistic is more sensitive to dependence than the chi-square statistic.     

A structure theorem on bivariate positive quadrant dependent distributions and tests for independence in two-way contingency tables

In this paper, the set of all bivariate positive quadrant dependent distributions with fixed marginals is shown to be compact and convex. Extreme points of this convex set are enumerated in some specific examples. Applications are given in testing the hypothesis of independence against strict positive quadrant dependence in the context of ordinal contingency tables. The performance of two tests, one of which is based on eigenvalues of a random matrix, is compared. Various procedures based upon certain functions of the eigenvalues of a random matrix are also proposed for testing for independence in a two-way contingency table when the marginals are random.     

Residual-Based Shadings for Visualizing (Conditional) Independence

Residual-based shadings for enhancing mosaic and association plots to visualize independence models for contingency tables are extended in two directions: (a) perceptually uniform Hue-Chroma-Luminance (HCL) colors are used and (b) the result of an associated significance test is coded by the appearance of color in the visualization. For obtaining (a), a general strategy for deriving diverging palettes in the perceptually based HCL space is suggested. As for (b), cutoffs that control the appearance of color are computed in a data-driven way based on the conditional permutation distribution of maximum-type test statistics. The shadings are first established for the case of independence in two-way tables and then extended to more general independence models for multiway tables, including in particular conditional independence models.     

Critical points for certain statistical measures of agreement

This paper further explores the analytic connections between three commonly used statistical measures of agreement for 2?×?2 contingency tables: sensitivity, specificity, and the kappa coefficient, which are often employed in evaluating diagnostic tests. In particular, for a given fixed kappa the corresponding locus of minimum values of sensitivity and specificity is rigorously derived.     

On tests of independence forr×c Markovian contingency tables

Summary This paper deals with testing the hypothesis of independence of two attributes inr×c Markovian Contingency tables. Likelihood ratio test and χ²-test of the form used in contingency tables are proposed. It is observed that both likelihood ratio criterion and χ²-test lead to the same test statistic in the sense that −2 log λ and χ²-test have asymptotically the same distribution.     

Confidence Circles For Correspondence Analysis Using Orthogonal Polynomials

An alternative approach to classical correspondence analysis was developed in [3] and involves decomposing the matrix of Pearson contingencies of a contingency table using orthogonal polynomials rather than via singular value decomposition. It is especially useful in analysing contingency tables which are of an ordinal nature. This short paper demonstrates that the confidence circles of Lebart, Morineau and Warwick (1984) for the classical approach can be applied to ordinal correspondence analysis. The advantage of the circles in analysing a contingency table is that the researcher can graphically identify the row and column categories that contribute or not to the hypothesis of independence.     

分层关联表中伞形序对无约束问题的检验

概率分布间的随机序是应用概率论与统计推断中的一个重要概念. 基于交叉分类数据的趋势检验问题已被广泛地研究, 并且分层关联表广泛存在于实践中. 似然比检验方法常用于涉及随机序约束问题的检验. 对带序约束的分层关联表, 该文介绍了一种不基于模型假定的似然比检验方法, 并且给出了检验统计量的极限分布.     

Probability matrices, non-negative rank, and parameterization of mixture models

In this paper, we parameterize non-negative matrices of sum one and rank at most two using the least possible number of parameters. We also show how this parameterization relates to a class of statistical models, known in Probability and Statistics as mixture models for contingency tables. In particular, we show how to use this parameterization to make some optimization problems computationally easier.     

Few statistical tests for proportions comparison

This article reviews a number of statistical tests for comparing proportions. These statistical tests are presented in a comprehensive way, so that OR practitioners can easily understand them and correctly use them. A test for 2 × 2 contingency tables is developed and shown to be more powerful than other classical tests of the literature such as Fisher’s exact test. Tables with critical values for small samples are provided, so that the test can be conducted without any computations.     

A Non-Iterative Alternative to Ordinal Log-Linear Models

Log-linear modeling is a popular statistical tool for analysing a contingency table. This presentation focuses on an alternative approach to modeling ordinal categorical data. The technique, based on orthogonal polynomials, provides a much simpler method of model fitting than the conventional approach of maximum likelihood estimation, as it does not require iterative calculations nor the fitting and refitting to search for the best model. Another advantage is that quadratic and higher order effects can readily be included, in contrast to conventional log-linear models which incorporate linear terms only.

The focus of the discussion is the application of the new parameter estimation technique to multi-way contingency tables with at least one ordered variable. This will also be done by considering singly and doubly ordered two-way contingency tables. It will be shown by example that the resulting parameter estimates are numerically similar to corresponding maximum likelihood estimates for ordinal log-linear models.     

Exact Conditional P Value Calculation for the Quasi-Symmetry Model

Earlier literature introduced a network algorithm for computing an exact test of independence in a two-way contingency table. This article adapts that algorithm to tests of quasi-symmetry in square tables. The algorithm is generally faster than competing Monte Carlo methods, and essentially eliminates the need for asymptotic approximation of P values for assessing goodness-of-fit of the quasi-symmetry model. A macro written for the R computing package is available for implementing the method.     

多应答数据下列联表的检验

本文讨论多应答数据(Multiple Column Responses)下列联表的独立性检验问题, 针对对立假设为序假设的情形, 提出一个近似$F$检验. 模拟表明, 该检验的名义水平与真实水平接近, 并有较高的功效.     

Partitioning a non-symmetric measure of association for three-way contingency tables

The Goodman-Kruskal tau index is a popular measure of asymmetry for two-way contingency tables where there is a one-way relationship between the variables. Numerous extensions of this index for multi-way tables have been considered in the statistical literature. These include the Gray-Williams measures, Simonetti's delta index and the Marcotorchino index.This paper looks at the partition of the Marcotorchino index for a three-way contingency table with one, two and three ordered categorical variables. Such a partition makes use of orthogonal polynomials and identifies two-way measures of asymmetry (akin to the Goodman-Kruskal tau index) and three-way measures generalisation. These partitions provide information about the structure of the asymmetric relationship between the categories in terms of location, dispersion and higher order moments.     

Exact Inference for Kendall's S and Spearman's ρ with Extension to Fisher's Exact Test in r × c Contingency Tables

Abstract

We formulate the problem of exact inference for Kendall's S and Spearman's D algebraically, using a general recursion formula developed by Smid for the score S with ties in both rankings. Analogous recursion formulas are shown to hold for the score D as well as for a log transform, F, of the score used in Fisher's exact test of independence in contingency tables. A new implementation of Mehta and Patel's network algorithm is then applied to obtain exact significance levels of either S or D for observations from both continuous and discrete distributions. A simple extension is made to obtain Fisher's exact test in r x c contingency tables. Observed CPU times for contingency table problems four to six of Mehta and Patel and problems four and five of Clarkson, Fan, and Joe are roughly 2/3 of those obtained using Clarkson's et al. implementation of the network algorithm. It is shown that a hierarchy, with F > S > D, holds regarding the rate of aggregation. An algorithm for rapid lexicographic enumeration of entries in a frequency table is also given.     

混合狄雷克利分布和高维表的贝叶斯估计

本文讨论多项分布情况下的高维列联表使用混合狄雷克利分布为先验分布时，贝叶斯估计的表达，以及独立性条件的表述．将文献［４］和［５］的结论推广到高维列联表中．     

S-PLUS code for simple and multiple correspondence analysis

An exploration of the application of S-PLUS code designed to perform classical correspondence analysis is made in this paper. This code allows for the “classical” analysis to be performed on categorical data consisting of two or more variables. For multi-way contingency tables, correspondence analysis can be performed by considering either the indicator matrix or the Burt matrix. The code also allows the user to incorporate into the analysis confidence circles (to identify categorical responses that deviate from the hypothesis of independence) and for an asymmetrical analysis to be performed. The function includes various warnings and stoppages to help the user properly analyse their data.     

贝叶斯对数线性估计

用Logits变换方法来讨论列联表的贝叶期估计，这时的估计称为贝叶斯对数线性估计，最早是由Lconard（1973，1975）提出的．Leonard讨论了二维表的对数线性贝叶斯估计；其后，Nazerat（1987）给出了三维表的贝叶斯对数线性估计．该文采用矩阵求微商方法，立足于高维表贝叶斯线性估计的较一般的表达形式；具体对四维表讨论员叶斯对数线性估计的表达和计算．