arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0906.3215stat.CO
收藏

二元区间删失数据分布函数的NPMLE约简算法

Reduction algorithm for the NPMLE for the distribution function of bivariate interval censored data

Marloes H. Maathuis

摘要:

研究了二元区间删失数据分布函数的非参数极大似然估计的计算问题。NPMLE的计算由两个步骤组成:参数缩减步骤和优化步骤。在本文中,我们专注于减少步骤。我们介绍了两个新的约简算法:树算法和HeightMap算法。树算法只是简单地提到。文中详细讨论了HeightMap算法,并给出了伪代码。这是一个非常快速和简单的算法,时间复杂度为O(n^2)。这是一个比迄今为止最著名的算法,Bogaerts和Lesaffre(2003)的O(n^3)算法快一个数量级。我们比较我们的算法与绅士和Vandal(2001),宋(2001)和Bogaerts和Lesaffre(2003)的算法,使用模拟数据。我们表明,我们的算法,特别是HeightMap算法,是显着更快。最后,我们指出,HeightMap算法可以很容易地推广到d维数据与d>2。时间复杂度为O(n^d)。

英文摘要:

We study computational aspects of the nonparametric maximum likelihood estimator (NPMLE) for the distribution function of bivariate interval censored data. The computation of the NPMLE consists of two steps: a parameter reduction step and an optimization step. In this paper we focus on the reduction step. We introduce two new reduction algorithms: the Tree algorithm and the HeightMap algorithm. The Tree algorithm is only mentioned briefly. The HeightMap algorithm is discussed in detail and also given in pseudo code. It is a very fast and simple algorithm of time complexity O(n^2). This is an order faster than the best known algorithm thus far, the O(n^3) algorithm of Bogaerts and Lesaffre (2003). We compare our algorithms with the algorithms of Gentleman and Vandal (2001), Song (2001) and Bogaerts and Lesaffre (2003), using simulated data. We show that our algorithms, and especially the HeightMap algorithm, are significantly faster. Finally, we point out that the HeightMap algorithm can be easily generalized to d-dimensional data with d>2. Such a multivariate version of the HeightMap algorithm has time complexity O(n^d).

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

↑