confint.Wald_lmm: Confidence Intervals for Multivariate Wald Tests

In LMMstar: Repeated Measurement Models for Discrete Times

Confidence Intervals for Multivariate Wald Tests

Description

Compute confidence intervals for linear hypothesis tests, possibly with adjustment for multiple comparisons.

Usage

## S3 method for class 'Wald_lmm'
confint(
  object,
  parm,
  level = 0.95,
  method = NULL,
  columns = NULL,
  backtransform = NULL,
  ...
)

Arguments

object	a Wald_lmm object
parm	Not used. For compatibility with the generic method.
level	[numeric, 0-1] nominal coverage of the confidence intervals.
method	[character] type of adjustment for multiple comparisons, one of "none", "bonferroni", ..., "fdr", "single-step", "single-step2". Alternatively, a method for combining the estimates, one of "average", "pool.se", "pool.gls", "pool.gls1", "pool.rubin".
columns	[character vector] Columns to be output. Can be any of "estimate", "se", "statistic", "df", "null", "lower", "upper", "p.value".
backtransform	[logical] should the estimates, standard errors, and confidence intervals be backtransformed?
...	Not used. For compatibility with the generic method.

Details

Adjustment for multiple comparisons: available methods are:

• "none", "bonferroni", "single-step2"

• "holm", "hochberg", "hommel", "BH", "BY", "fdr": adjustment performed by [stats::p.adjust()], no confidence interval is computed.

• "single-step", "free", "Westfall", "Shaffer": adjustment performed by [multcomp::glht()], for all but the first method no confidence interval is computed.

Note: method "single-step" adjust for multiple comparisons using equicoordinate quantiles of the multivariate Student's t-distribution over all tests, instead of the univariate quantiles. It assumes equal degrees of freedom in the marginal and is described in section 7.1 of Dmitrienko et al. (2013) under the name single-step Dunnett procedure. The name "single-step" is borrowed from the multcomp package. In the book Bretz et al. (2010) written by the authors of the package, the procedure is refered to as max-t tests which is the terminology adopted in the LMMstar package.
When degrees of freedom differs between individual hypotheses, method "single-step2" is recommended. It simulates data using copula whose marginal distributions are Student's t-distribution (with possibly different degrees of freedom) and elliptical copula with parameters the estimated correlation between the test statistics (via the copula package). It then computes the frequency at which the simulated maximum exceed the observed maximum and appropriate quantile of simulated maximum for the confidence interval.

Pooling estimates: available methods are:

• "average": average estimates

• "pool.fixse": weighted average of the estimates, with weights being the inverse of the squared standard error. The uncertainty about the weights is neglected.

• "pool.se": weighted average of the estimates, with weights being the inverse of the squared standard error. The uncertainty about the weights is computed under independence of the variance parameters between models.

• "pool.gls": weighted average of the estimates, with weights being based on the variance-covariance matrix of the estimates. When this matrix is singular, its spectral decomposition is truncated when the correspodning eigenvalues are below 10^{-12}. The uncertainty about the weights is neglected.

• "pool.gls1": similar to "pool.gls" but ensure that the weights are at most 1 in absolute value by shrinking toward the average.

• "pool.rubin": average of the estimates and compute the uncertainty according to Rubin's rule (Barnard et al. 1999).

References

Barnard and Rubin, Small-sample degrees of freedom with multiple imputation. Biometrika (1999), 86(4):948-955.
Dmitrienko, A. and D'Agostino, R., Sr (2013), Traditional multiplicity adjustment methods in clinical trials. Statist. Med., 32: 5172-5218. Frank Bretz, Torsten Hothorn and Peter Westfall (2010), Multiple Comparisons Using R, CRC Press, Boca Raton.

LMMstar documentation built on Nov. 9, 2023, 1:06 a.m.