Conditional method agreement trees (COAT) employ unbiased
recursive partitioning in order to detect and model dependency on covariates
in the classic Bland-Altman analysis. One of two recursive partitioning techniques
can be used to find subgroups defined by splits in covariates to a pair
of measurements, either nonparametric conditional inference trees (CTree)
or parametric model-based trees (MOB). In both cases, each subgroup is associated
with two parameter estimates: the mean of the measurement difference (“Bias”)
and the corresponding sample standard deviation (“SD”) which can be
used to construct the limits of agreement (i.e., the corresponding confidence intervals).
The minimum number of observations in a subgroup defaults to 10,
so that the mean and variance of the measurement differences can be estimated
reasonably for the Bland-Altman analysis. The default can be changed with
with the argument minsize
or, equivalently, minbucket
.
(The different names stem from slightly different conventions in the underlying
tree functions.) Consequently, the minimum number of observations to consider
splitting (minsplit
) must be, at the very least, twice the minimum number
of observations per subgroup (which would allow only one possible split, though).
By default, minsplit
is 2.5 times minsize
.
Users are encouraged to consider whether for their application it is sensible
to increase or decrease these defaults. Finally, further control parameters
can be specified through the ...
argument, see
ctree_control
and mob_control
,
respectively, for details.
In addition to the standard specification of the two response measurements in the
formula via y1 + y2 ~ ...
, it is also possible to use y1 - y2 ~ ...
.
The latter may be more intuitive for users that think of it as a model for the
difference of two measurements. Finally cbind(y1, y2) ~ ...
also works.
Internally, all of these are processed in the same way, namely as a bivariate
dependent variable that can then be modeled and plotted appropriately.
To add the means of the measurement pair as a potential splitting variable,
there are also different equivalent strategies. The standard specification would
be via the means
argument: y1 + y2 ~ x1 + ..., means = TRUE
.
Alternatively, the user can also extend the formula argument via
y1 + y2 ~ x1 + ... + means(y1, y2)
.
The SD is estimated by the usual sample standard deviation in each subgroup,
i.e., divided by the sample size \(n - 1\). Note that the inference in the
MOB algorithm internally uses the maximum likelihood estimate (divided by \(n\))
instead so the the fluctuation tests for parameter instability can be applied.