Premium
A Minimum‐Cost Strategy for Cluster Recruitment
Author(s) -
Chan Wenyaw,
Peng Nan Fu
Publication year - 2000
Publication title -
biometrical journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.108
H-Index - 63
eISSN - 1521-4036
pISSN - 0323-3847
DOI - 10.1002/1521-4036(200011)42:7<877::aid-bimj877>3.0.co;2-c
Subject(s) - cluster (spacecraft) , markov chain , computer science , duration (music) , mathematical optimization , point (geometry) , observational study , statistics , operations research , mathematics , operations management , engineering , art , geometry , literature , programming language
It is becoming increasingly common for the design of a clinical study to involve cluster samples. Very few researches investigated the appropriate number of clusters. None of them treat cluster size and the number of clusters as random variables. In reality, the recruitment of clusters can not be reached at one time and the cluster sizes are usually random. The longer the recruitment takes the more expensive the total study costs will be. This paper provides a strategy for sequential recruitment of clusters, which can minimize the total study cost. By treating the number of additional observational subjects required at each time point as a Markov Chain, we derive an iterative procedure for optimal strategy and study the property of this strategy, especially the duration of the cluster recruitment. This strategy is also extended to search for an optimal number of centers in a multi‐center clinical trial.