Algorithm 434: exact probabilities for R×C contingency tables [G2]
Communications of the ACM
Remark on algorithm 434: exact probabilities for R×C contingency tables
Communications of the ACM
SPSS-X User's Guide
Exact correlation between actual and estimated errors in discrete classification
Pattern Recognition Letters
Multivariate hypergeometric similarity measure
Proceedings of the ACM Conference on Bioinformatics, Computational Biology and Biomedicine
Multivariate Hypergeometric Similarity Measure
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Hi-index | 0.03 |
Testing of independence in an r x c tables is generally carried out by using a continuous limiting distribution of the test statistic, rather than the discrete distribution itself. This paper surveys algorithms for the computation of the latter. The central idea is the efficient enumeration of all tables with the same margins, or of a suitable subset thereof. The simplest case is Fisher's exact test for a 2 x 2 table and a one-side alternative hypothesis. Fisher's method is easily extended to r x c tables and to arbitrary statistics.