arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2210.04869stat.MEstat.ML
收藏

基于Copula的定时截尾Boosting预测模型

A copula-based boosting model for time-to-event prediction with dependent censoring

Alise Danielle Midtfjord, Riccardo De Bin, Arne Bang Huseby

摘要:

事件发生时间数据分析的一个典型特征是可能对事件时间进行删失。大多数处理删失数据的统计学习方法都受到独立删失假设的限制,即使当假设不成立时,这可能导致有偏的预测。本文介绍了Clayton-boost,一种基于加速失效时间模型的boosting方法,它使用Clayton copula来处理事件分布和删失分布之间的依赖关系。利用Copula函数,不再需要独立截尾假设。在与常用方法的比较中,Clayton-boost在依赖删失存在时显示出很强的去除预测偏差的能力,并且在依赖强度或百分比删失相当大的情况下优于比较方法。Clayton-boost令人鼓舞的表现表明,确实有理由对独立审查假设提出批评,并且真实世界的数据可以从潜在依赖性建模中获益匪浅。

英文摘要:

A characteristic feature of time-to-event data analysis is possible censoring of the event time. Most of the statistical learning methods for handling censored data are limited by the assumption of independent censoring, even if this can lead to biased predictions when the assumption does not hold. This paper introduces Clayton-boost, a boosting approach built upon the accelerated failure time model, which uses a Clayton copula to handle the dependency between the event and censoring distributions. By taking advantage of a copula, the independent censoring assumption is not needed any more. During comparisons with commonly used methods, Clayton-boost shows a strong ability to remove prediction bias at the presence of dependent censoring and outperforms the comparing methods either if the dependency strength or percentage censoring are considerable. The encouraging performance of Clayton-boost shows that there is indeed reasons to be critical about the independent censoring assumption, and that real-world data could highly benefit from modelling the potential dependency.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑