检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Jun Shao
机构地区:[1]KLATASDS-MOE,School of Statistics,East China Normal University,Shanghai,People’s Republic of China [2]Department of Statistics,University ofWisconsin-Madison,Madison,WI,USA
出 处:《Statistical Theory and Related Fields》2021年第3期172-186,共15页统计理论及其应用(英文)
基 金:supported by the National Natural Science Foundation of China(11831008);the U.S.National Science Foundation(DMS-1914411).
摘 要:Covariate-adaptive randomisation has a more than 45 years of history of applications in clinical trials,in order to balance treatment assignments across prognostic factors that may have influence on the outcomes of interest.However,almost no theory had been developed for covariate-adaptive randomisation until a paper on the theory of testing hypotheses published in 2010.In this article,we review aspects of methodology and theory developed in the last decade for statistical inference under covariate-adaptive randomisation.Wefocus on issues such as whether a conventional procedure valid under the assumption that treatments are assigned completely at random is still valid or conservative when the actual randomisation is covariateadaptive,how a valid inference procedure can be obtained by modifying a conventional method or directly constructed by stratifying the covariates used in randomisation,whether inference procedures have different properties when covariate-adaptive randomisation schemes have different degrees of balancing assignments,and how to further adjust covariates in the inference procedures to gain more efficiency.Recommendations are made during the review and further research problems are discussed.
关 键 词:balancedness of assignments efficiency model-assisted approach model free inference stratification survival analysis
分 类 号:O21[理学—概率论与数理统计]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.171