Find the minimal exact match factors that will be feasible for a given maximum problem size.
exactMatch function creates a smaller matching problem by
stratifying observations into smaller groups. For a problem that is larger
than maximum allowed size,
minExactMatch provides a way to find the
smallest exact matching problem that will allow for matching.
The object for dispatching.
Optional vector of scores that will be checked against a caliper width.
Optional width of a caliper to place on the scores.
The maximum problem size to attempt to fit.
Additional arguments for methods.
x is a formula of the form
Z ~ X1 + X2, where
Z is indicates treatment or control status, and
X2 are variables
can be converted to factors. Any additional arguments are passed to
data argument containing
The the arguments
width must be passed together.
The function will apply the caliper implied by the scores and the width while
also adding in blocking factors.
A factor grouping units, suitable for
Want to suggest features or report bugs for rdrr.io? Use the GitHub issue tracker.