跳到正文
← 返回论文列表与筛选
阅读说明

本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。

DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。

引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。

关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。

分类依据与纠错

AI 根据所提供的论文材料归类:摘要聚焦生存研究的随访设计,组间风险率比较本身不足以支持因果推断分类。

反馈分类问题

正在核对关联版本…

代码、数据与补充材料

正在核对对应版本的资源…

关注这篇论文的作者
Lurdes Y T Inoue

随访时间的最优设计

研究问题
当事件时间研究的随访必须相隔较久时,如何安排序贯或非序贯随访时点,以提升风险率估计或组间比较的设计效率?
方法与思路
作者在风险率不随时间变化的指数模型中采用贝叶斯决策方法,推导后验与预测分布,并用近似计算和动态规划安排随访。
材料陈述的贡献
摘要称,研究给出单次随访的最优时间解和实用近似,并展示两阶段序贯设计;所考察例子中的效率收益超过标准方法三倍。
阅读关注点
应核对效率和损失函数的定义、先验超参数的影响、随访的信息结构,以及序贯优化约束和恒定风险率设定的合理性。
阅读边界
依据 OpenAlex 索引摘要,稿件版本未注明;三倍以上收益仅属所考察例子,摘要未说明一般收益界,结果不能直接推广到时变风险率。

原文摘要

Studies of time-to-event are often conducted using follow-up sessions with subjects at risk. When these sessions must be widely spaced, their timing can significantly affect the efficiency of a study design. In this article we analyze the optimal timing of follow-up from a Bayesian decision theoretic standpoint. The article has two goals: (1) to develop the necessary distributional theory and computational approaches to determine optimal sequential and nonsequential follow-up schedules in the exponential case and (2) to demonstrate that unusually large gains in efficiency (more than threefold over the standard approach in the examples considered) can be achieved using our group sequential timing of follow-up. We hope that this striking illustration will encourage more systematic consideration of followup times in study designs. Specifically, we consider time-independent hazard rates. We derive posterior and predictive distributions in three scenarios: single follow-up time for the estimation of a single hazard rate, group-specific follow-up time for the comparison of hazard rates in two treatment groups or cohorts, and multiple follow-up times for a single hazard rate. We encounter a novel family of mixtures of gamma functions and characterize its moments, which play a critical role in the determination of optima. We then provide a solution to the optimal follow-up time in the single follow-up problem. We develop a practical and accurate approximation to the optimal solution as a function of prior hyperparameters that can be used to implement real time calculations and more complex sequential strategies. Finally, we consider the sequential choice of follow-up times. We discuss the general dynamic programming solution and illustrate it in the setting of a two-stage design.

笔记与分组
相关领域论文