A modified exact test is proposed for 2 x 2 contingency tables. This test, which is based on a lees connervative definition of the concept of significance (STONE, 106s) is compared with a modified form of Pearson's X\* test and with Tocher's randomized exact (UMPU) test. The sizes of the new test li
Efficient algorithms for exact inference in 2 × 2 contingency tables
✍ Scribed by V. Granville; E. Schifflers
- Publisher
- Springer US
- Year
- 1993
- Tongue
- English
- Weight
- 290 KB
- Volume
- 3
- Category
- Article
- ISSN
- 0960-3174
No coin nor oath required. For personal study only.
✦ Synopsis
We propose a simple and robust algorithm for exact inference in 2 x 2 contingency tables. It is based on recursive relations allowing efficient computation of odds-ratio estimates, confidence limits and p-values for Fisher's test. A factor of 3 10 is gained in terms of computer time compared with the classical algorithm of Thomas.
📜 SIMILAR VOLUMES
Analysis of 2 x 2 contingency tables is not as trivial as it appears. The choice of the statistical test can affect the inferences resulting from data analysis, especially at small sample sizes. Canned statistical programs do not necessarily lead to an appropriate test. These points are demonstrated
This paper presents the results of a Monte Carlo study comparing the performance, in terms of size and power, of six exact and six asymptotic tests for the homogeneity of odds ratios in several 2 x 2 contingency tables. With a small sample size or sparse data structure, the exact tests performed bet