首页 | 本学科首页   官方微博 | 高级检索  
     


A Shift Algorithm for Exact Computation in Sequential Tests with Binary Outcome
Authors:Josef Hö  gel
Abstract:A simple shift algorithm is described enabling the exact determination of power functions and sample size distributions for a large variety of closed sequential two‐sample designs with a binary outcome variable. The test statistics are assumed to be based on relative frequencies of successes or failures, but the number of interim analyses, the monitoring times, and the continuation regions may be specified as desired. To give examples, exact properties of designs proposed by the program package EaSt (Cytel , 1992) are determined, and plans with interim analyses are considered where decisions are based on the conditional power given the observations obtained so far.
Keywords:Binary outcome variable  Exact computation  Group sequential plans  Sequential Tests  Shift Algorithm  Two‐sample comparison
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号