## Abstract

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.

Original language | English (US) |
---|---|

Pages (from-to) | 3446-3451 |

Number of pages | 6 |

Journal | Statistics in Medicine |

Volume | 27 |

Issue number | 17 |

DOIs | |

State | Published - Jul 30 2008 |

## Keywords

- Clinical trials
- Multiple endpoints
- Multiple tests

## ASJC Scopus subject areas

- Epidemiology
- Statistics and Probability