CONSTRUCTING MORE POWERFUL EXACT TESTS OF EQUIVALENCE FROM BINARY MATCHED PAIRS
- Author(s)
- Lloyd, CJ; Moldovan, MV;
- Details
- Publication Year 2011-03,Volume 53,Issue #1,Page 27-42
- Journal Title
- AUSTRALIAN & NEW ZEALAND JOURNAL OF STATISTICS
- Publication Type
- Journal Article
- Abstract
- P>In randomized clinical trials, it is often necessary to demonstrate that a new medical treatment does not substantially differ from a standard reference treatment. Formal testing of such 'equivalence hypotheses' is typically done by combining two one-sided tests (TOST). A quite different strand of research has demonstrated that replacing nuisance parameters with a null estimate produces P-values that are close to exact (<link rid="b12">Lloyd 2008a) and that maximizing over the residual dependence on the nuisance parameter produces P-values that are exact and optimal within a class (<link rid="b19">Rohmel & Mansmann 1999; <link rid="b12">Lloyd 2008a). The three procedures - TOST, estimation and maximization of a nuisance parameter - can each be expressed as a transformation of an approximate P-value. In this paper, we point out that TOST-based P-values will generally be conservative, even if based on exact and optimal one-sided tests. This conservatism is avoided by applying the three transforms in a certain order - estimation followed by TOST followed by maximization. We compare this procedure with existing alternatives through a numerical study of binary matched pairs where the two treatments are compared by the difference of response rates. The resulting tests are uniformly more powerful than the considered competitors, although the difference in power can range from very small to moderate.
- Publisher
- WILEY-BLACKWELL
- Keywords
- EXACT UNCONDITIONAL TESTS; NON-INFERIORITY; SAMPLE-SIZE; P-VALUES; DESIGN; PROPORTIONS; TRIALS; NONINFERIORITY; DIFFERENCE
- Publisher's Version
- https://doi.org/10.1111/j.1467-842X.2011.00597.x
- Terms of Use/Rights Notice
- Refer to copyright notice on published article.
Creation Date: 2011-03-01 12:00:00