首页> 外文期刊>International journal of computational and applied mathematics >Algorithm of Intersection Graph for Bivariate Censored Data
【24h】

Algorithm of Intersection Graph for Bivariate Censored Data

机译:算法二元的相交图审查数据

获取原文
获取原文并翻译 | 示例
           

摘要

Univariate or bivariate Censored data, left, right or interval censored data can be represented by its intersection graph. Determination of nonparametric maximum likelihood estimator for bivariate interval censored data consists of two parts. The first, involves the determination of the regions of possible support and the second the maximization of the likelihood. As first step in the estimation of the nonparametric maximum likelihood estimation (NPMLE), for bivariate interval censored data, the regions of possible support, i.e. the rectangles with nonzero mass, are calculated. In this paper we discuss a method for finding an intersection graph. As the results, an algorithm of intersection graph is obtained and its time complexity is quadratic. This algorithm is an alternative way to calculate the regions of possible support for bivariate interval censored data.
机译:一元或二元审查数据,左,右或区间数据可以表示为其交叉图。非参数极大似然估计量二元数据包含两个区间部分。可能的支持和第二的地区可能的最大化。估计的非参数最大值似然估计(NPMLE)、二元讨论区间数据,可能的地区支持,即非零质量的矩形,计算。寻找一个十字路口图。结果,交会图的一种算法二次获得和它的时间复杂度。这个算法是一个替代方法来计算可能的地区支持二元讨论区间数据。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号