首页> 外文会议>International Conference on Soft Methods in Probability and Statistics >Maximum Likelihood from Evidential Data:An Extension of the EM Algorithm
【24h】

Maximum Likelihood from Evidential Data:An Extension of the EM Algorithm

机译:证据数据的最大可能性:EM算法的扩展

获取原文

摘要

We consider the problem of statistical parameter estimation when the data are uncertain and described by belief functions. An extension of the Expectation-Maximization (EM) algorithm, called the Evidential EM (E~2M) algorithm, is described and shown to maximize a generalized likelihood function. This general procedure provides a simple mechanism for estimating the parameters in statistical models when observed data are uncertain. The method is illustrated using the problem of univariate normal mean and variance estimation from uncertain data.
机译:当数据不确定和通过信仰功能描述时,我们考虑统计参数估计问题。描述并示出了称为Adiential EM(E〜2M)算法的预期最大化(EM)算法的延伸,以最大化广义似然函数。该一般过程提供了一种简单的机制,用于在观察到的数据不确定时估计统计模型中的参数。使用来自不确定数据的单变量正常均值和方差估计的问题来说明该方法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号