Conditional inference given partial information in contingency tables using Markov bases
Article first published online: 19 APR 2013
Copyright © 2013 Wiley Periodicals, Inc.
Wiley Interdisciplinary Reviews: Computational Statistics
Volume 5, Issue 3, pages 207–218, May/June 2013
How to Cite
Karwa, V. and Slavkovic, A. (2013), Conditional inference given partial information in contingency tables using Markov bases. WIREs Comp Stat, 5: 207–218. doi: 10.1002/wics.1256
- Issue published online: 19 APR 2013
- Article first published online: 19 APR 2013
- conditional inference;
- contingency tables;
- exact tests;
- Markov bases
In this article, we review a Markov chain Monte Carlo (MCMC) algorithm for performing conditional inference in contingency tables in the presence of partial information using Markov bases, a key tool arising from the area known as algebraic statistics. We review applications of this algorithm to the problems of conditional exact tests, ecological inference, and disclosure limitation and illustrate how these problems fall naturally in the setting of inference with partial information. We also discuss some issues associated with computing Markov bases which are needed as an input to the algorithm. WIREs Comput Stat 2013, 5:207–218. doi: 10.1002/wics.1256
Conflict of interest: The authors have declared no conflicts of interest for this article.