National Changhua University of Education Institutional Repository : Item 987654321/14053
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 6507/11669
造访人次 : 30657905      在线人数 : 656
RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 进阶搜寻

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.ncue.edu.tw/ir/handle/987654321/14053

题名: A Jackknife-based Versatile Test for Two-sample Problems with Right-censored Data
作者: Chang, Yu-Mei;Chen, Chun-Shu;Shen, Pao-Sheng
贡献者: 統計資訊研究所
关键词: Data driven;Linear combination test;Right-censored data;Weighted Kaplan-Meier test;Weighted logrank test
日期: 2012-02
上传时间: 2012-09-10T04:39:27Z
出版者: Taylor&Francis
摘要: For testing the equality of two survival functions, the weighted logrank test and the weighted Kaplan–Meier test are the two most widely used methods. Actually, each of these tests has advantages and defects against various alternatives, while we cannot specify in advance the possible types of the survival differences. Hence, how to choose a single test or combine a number of competitive tests for indicating the diversities of two survival functions without suffering a substantial loss in power is an important issue. Instead of directly using a particular test which generally performs well in some situations and poorly in others, we further consider a class of tests indexed by a weighted parameter for testing the equality of two survival functions in this paper. A delete-1 jackknife method is implemented for selecting weights such that the variance of the test is minimized. Some numerical experiments are performed under various alternatives for illustrating the superiority of the proposed method. Finally, the proposed testing procedure is applied to two real-data examples as well.
關聯: Journal of Applied Statistics, 39(2): 267-277
显示于类别:[統計資訊研究所] 期刊論文

文件中的档案:

档案 大小格式浏览次数
2020800310007.pdf25KbAdobe PDF553检视/开启


在NCUEIR中所有的数据项都受到原著作权保护.

 


DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回馈