首页   按字顺浏览 期刊浏览 卷期浏览 A network algorithm for the exact treatment of the 2×k contingency table
A network algorithm for the exact treatment of the 2×k contingency table

 

作者: Cyrus R. Mehta,   Nitin R. Patel,  

 

期刊: Communications in Statistics - Simulation and Computation  (Taylor Available online 1980)
卷期: Volume 9, issue 6  

页码: 649-664

 

ISSN:0361-0918

 

年代: 1980

 

DOI:10.1080/03610918008812182

 

出版商: Marcel Dekker, Inc.

 

关键词: contingency tables;Fisher's exact test of significance;binary data analysis;network algorithm;implicit enumeration;dynamic programming

 

数据来源: Taylor

 

摘要:

A common statistical problem encountered in biomedical research is to test the hypothesis that the parameters of k binomial populations are all equal. An exact test of significance of this hypothesis is possible in principle, the appropriate null distribution being a normalized product of k binomial coefficients. However, the problem of computing the tail area of this distribution can be formidable since it requires the enumeration of all sets of k binomial coefficients whose product is less than a given constant. Existing algorithms, all of which rely on explicit enumeration to generate feasible binomial coefficients

 

点击下载:  PDF (363KB)



返 回