A network algorithm for the exact treatment of the 2×k contingency table
作者： Cyrus R. Mehta , Nitin R. Patel
DOI: 10.1080/03610918008812182
关键词:
摘要: A common statistical problem encountered in biomedical research is to test the hypothesis that parameters of k binomial populations are all equal. An exact significance this possible principle, appropriate null distribution being a normalized product coefficients. However, computing tail area can be formidable since it requires enumeration sets coefficients whose less than given constant. Existing algorithms, which rely on explicit generate feasible
sci-hub.se 参考文章(6)
Sir Ronald Aylmer Fisher, Statistical Methods for Research Workers ,(1925)
David L. March, Exact probabilities for R x C contingency tables [G2] Communications of the ACM. ,vol. 15, pp. 991- 992 ,(1972) , 10.1145/355606.361890
Andrew P. Soms, An Algorithm for the Discrete Fisher's Permutation Test Journal of the American Statistical Association. ,vol. 72, pp. 662- 664 ,(1977) , 10.1080/01621459.1977.10480632
Patrick Rivett, Principles of Operations Research ,(1972)
G. H. Jowett, Ronald A. Fisher, Statistical Methods for Research Workers. Applied statistics. ,vol. 5, pp. 68- ,(1956) , 10.2307/2985747
R. J. Baker, Algorithm AS 112: Exact Distributions Derived from Two-Way Tables Applied Statistics. ,vol. 26, pp. 199- 206 ,(1977) , 10.2307/2347038