Boost-R: Gradient boosted trees for recurrence data
Boost-R: Gradient boosted trees for recurrence data
复制标题
Boost-R:用于重复数据的梯度提升树
DOI:
10.1080/00224065.2021.1948373
复制
发表时间:
2021
影响因子:
2.5
通讯作者:
Pan, Rong
中科院分区:
文献类型:
--
作者:
Liu, Xiao;Pan, Rong
Recurrence data arise from multi-disciplinary domains spanning reliability, cyber security, healthcare, online retailing, etc. This paper investigates an additive-tree-based approach, known as Boost-R (Boosting for Recurrence Data), for recurrent event data with both static and dynamic features. Boost-R constructs an ensemble of gradient boosted additive trees to estimate the cumulative intensity function of the recurrent event process, where a new tree is added to the ensemble by minimizing the regularizedL2distance between the observed and predicted cumulative intensity. Unlike conventional regression trees, a time-dependent function is constructed by Boost-R on each tree leaf. The sum of these functions, from multiple trees, yields the ensemble estimator of the cumulative intensity. The divide-and-conquer nature of tree-based methods is appealing when hidden sub-populations exist within a heterogeneous population. The non-parametric nature of regression trees helps to avoid parametric assumptions on the complex interactions between event processes and features. Critical insights and advantages of Boost-R are investigated through comprehensive numerical examples. Datasets and computer code of Boost-R are made available on GitHub. To our best knowledge, Boost-R is the first gradient boosted additive-tree-based approach for modeling large-scale recurrent event data with both static and dynamic feature information.
DOI:
10.1007/978-3-030-10997-4_10
发表时间:
2018-07
期刊:
--
影响因子:
--
作者:
Georg L. Grob;Ângelo Cardoso;C. H. B. Liu;Duncan A. Little;B. Chamberlain
通讯作者:
Georg L. Grob;Ângelo Cardoso;C. H. B. Liu;Duncan A. Little;B. Chamberlain
影响因子:
2.5
作者:
K. Paynabar;Judy Jin;M. Reed
通讯作者:
M. Reed
影响因子:
2.1
作者:
X. Huo;Seoung Bum Kim;K. Tsui;Shuchun Wang
通讯作者:
Shuchun Wang