Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 240

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Recursive Combination Tests

Brannath, Werner, Posch, Martin, Bauer, Peter·2002·Journal of the American Statistical Association

Abstract

We present a method that extends the flexibility of adaptive designs to the number of interim analyses and to the choice of decision boundaries. At each stage of the trial, the design of the next stage can be determined using all of the information gathered so far. Additionally, one can specify the next stage as the final stage or can plan a further interim analysis. The method is based on a recursive application of the two-stage combination tests for p values. The crucial point is the appropriate definition of a p value function that combines p values from two separate stages to a single p value. Formally, we start with a two-stage combination test. However, the p value of the second stage can be replaced by the p value of a further combination test. This applies if the experimenter decides in the first interim analysis to perform another interim analysis, thereby extending the design to at least three stages. Obviously, this can be also done in a recursive way in the following interim analyses. The test decision is based on an overall p value, which can be easily calculated by concatenation of the p value functions for the combination tests used. Under very general conditions, this procedure controls the level α. Recursive combination tests cover the classical group sequential and adaptive two-stage tests as special cases. By construction, they also allow for simple computation of confidence intervals and median unbiased point estimates.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1198/016214502753479374

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

See all 240

Metadata

Authors
Brannath, W., Posch, M., & Bauer, P.
Venue
Journal of the American Statistical Association
Published
2002-03
Volume
97
Issue
457
Pages
236-244
ISSN
  • 0162-1459 (ISSN-L)
  • 1537-274X
OpenAlex
W1966541918
Cited by
240
References
1
FWCI
11.52
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Recursive Combination Tests. https://app.cochat.ai/papers/10.1198/016214502753479374
The paper
Brannath, W., Posch, M., & Bauer, P. (2002). Recursive Combination Tests. Journal of the American Statistical Association. https://doi.org/10.1198/016214502753479374

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.