摘要
In this paper the amalgamation of (I+1)×J tables under consistent significance is considered and the sufficient condition is obtained. The sufficient and necessary conditions are given to avoid the famous paradoxes 'YAP' and 'YRP'. A practical algorithm is given to compute the critical value when pooling tables with odds ratio less than 1.
In this paper the amalgamation of (I+1)×J tables under consistent significance is considered and the sufficient condition is obtained. The sufficient and necessary conditions are given to avoid the famous paradoxes 'YAP' and 'YRP'. A practical algorithm is given to compute the critical value when pooling tables with odds ratio less than 1.
