Dmitrienko Alex, Tamhane Ajit C, Liu Lingyun, Wiens Brian L
Eli Lilly and Company, Indianapolis, IN 46285, USA.
Stat Med. 2008 Jul 30;27(17):3446-51. doi: 10.1002/sim.3307.
Dmitrienko et al. (Statist. Med. 2007; 26:2465-2478) proposed a tree gatekeeping procedure for testing logically related hypotheses in hierarchically ordered families, which uses weighted Bonferroni tests for all intersection hypotheses in a closure method by Marcus et al. (Biometrika 1976; 63:655-660). An algorithm was given to assign weights to the hypotheses for every intersection. The purpose of this note is to show that any weight assignment algorithm that satisfies a set of sufficient conditions can be used in this procedure to guarantee gatekeeping and independence properties. The algorithm used in Dmitrienko et al. (Statist. Med. 2007; 26:2465-2478) may fail to meet one of the conditions, namely monotonicity of weights, which may cause it to violate the gatekeeping property. An example is given to illustrate this phenomenon. A modification of the algorithm is shown to rectify this problem.
德米特里延科等人（《统计医学》，2007年；26卷：2465 - 2478页）提出了一种树状把关程序，用于检验分层有序族中逻辑相关的假设，该程序在马库斯等人（《生物统计学》，1976年；63卷：655 - 660页）的封闭方法中，对所有交集假设使用加权邦费罗尼检验。给出了一种算法，为每个交集的假设分配权重。本注释的目的是表明，任何满足一组充分条件的权重分配算法都可用于此程序，以保证把关和独立性属性。德米特里延科等人（《统计医学》，2007年；26卷：2465 - 2478页）使用的算法可能不满足其中一个条件，即权重的单调性，这可能导致它违反把关属性。给出一个例子来说明这种现象。展示了对该算法的一种修改以纠正此问题。
