LAUSR

Modern precision medicine requires drug development to account for patients' heterogeneity, as only a subgroup of the patient population is likely to benefit from the targeted therapy. In this paper, we propose a novel method for subgroup identification based on a genetic algorithm. The proposed method can detect promising subgroups defined by predictive biomarkers in which the treatment effects are much higher than the population average. The main idea is to search for the subgroup with the greatest predictive ability in the entire subgroup space via a genetic algorithm. We design a real-valued representation of subgroups that evolves according to a genetic algorithm and derive an objective function that properly evaluates the predictive ability of the subgroups. Compared with model- or tree-based subgroup identification methods, the distinctive search strategy of this new approach offers an improved capability to explore subgroups defined by multiple predictive biomarkers. By embedding a resampling scheme, the multiplicity and complexity issues inherent in subgroup identification methods can be addressed flexibly. We evaluate the performance of the proposed method in comparison with two other methods using simulation studies and a real-world example. The results show that the proposed method exhibits good properties in terms of multiplicity and complexity control, and the subgroups identified are much more accurate. Although we focus on the implementation of censored survival data, this method could easily be extended for the realization of continuous and categorical endpoints.