4.2 Article

Subgroup identification in individual participant data meta-analysis using model-based recursive partitioning

期刊

出版社

SPRINGER HEIDELBERG
DOI: 10.1007/s11634-021-00458-3

关键词

Model-based recursive partitioning; Subgroup identification; Meta-analysis; Individual participant data; IPD; Treatment-by subgroup interaction; Personalized medicine

资金

  1. BfArM
  2. University Medical Center Gottingen

向作者/读者索取更多资源

The article introduces a procedure called metaMOB for subgroup identification in IPD meta-analysis using the GLMM tree algorithm. The study found that metaMOB outperformed GLMM trees and MOB in terms of false discovery rates, accuracy of identified subgroups, and accuracy of estimated treatment effect.
Model-based recursive partitioning (MOB) can be used to identify subgroups with differing treatment effects. The detection rate of treatment-by-covariate interactions and the accuracy of identified subgroups using MOB depend strongly on the sample size. Using data from multiple randomized controlled clinical trials can overcome the problem of too small samples. However, naively pooling data from multiple trials may result in the identification of spurious subgroups as differences in study design, subject selection and other sources of between-trial heterogeneity are ignored. In order to account for between-trial heterogeneity in individual participant data (IPD) meta-analysis random-effect models are frequently used. Commonly, heterogeneity in the treatment effect is modelled using random effects whereas heterogeneity in the baseline risks is modelled by either fixed effects or random effects. In this article, we propose metaMOB, a procedure using the generalized mixed-effects model tree (GLMM tree) algorithm for subgroup identification in IPD meta-analysis. Although the application of metaMOB is potentially wider, e.g. randomized experiments with participants in social sciences or preclinical experiments in life sciences, we focus on randomized controlled clinical trials. In a simulation study, metaMOB outperformed GLMM trees assuming a random intercept only and model-based recursive partitioning (MOB), whose algorithm is the basis for GLMM trees, with respect to the false discovery rates, accuracy of identified subgroups and accuracy of estimated treatment effect. The most robust and therefore most promising method is metaMOB with fixed effects for modelling the between-trial heterogeneity in the baseline risks.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.2
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据