Balance algorithm for cluster randomized trials

87Citations
Citations of this article
54Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Background. Within cluster randomized trials no algorithms exist to generate a full enumeration of a block randomization, balancing for covariates across treatment arms. Furthermore, often for practical reasons multiple blocks are required to fully randomize a study, which may not have been well balanced within blocks. Results. We present a convenient and easy to use randomization tool to undertake allocation concealed block randomization. Our algorithm highlights allocations that minimize imbalance between treatment groups across multiple baseline covariates. We demonstrate the algorithm using a cluster randomized trial in primary care (the PRE-EMPT Study) and show that the software incorporates a trade off between independent random allocations that were likely to be imbalanced, and predictable deterministic approaches that would minimise imbalance. We extend the methodology of single block randomization to allocate to multiple blocks conditioning on previous allocations. Conclusion. The algorithm is included as Additional file 1 and we advocate its use for robust randomization within cluster randomized trials. © 2008 Carter and Hood; licensee BioMed Central Ltd.

Cite

CITATION STYLE

APA

Carter, B. R., & Hood, K. (2008). Balance algorithm for cluster randomized trials. BMC Medical Research Methodology, 8. https://doi.org/10.1186/1471-2288-8-65

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free