首页> 外文学位 >Parameter estimate of a hidden Markov chain.
【24h】

Parameter estimate of a hidden Markov chain.

机译:隐马尔可夫链的参数估计。

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

摘要

Hidden Markov Models (HMM) are of considerable interest for science and for various applications. They consist of a Markov chain with "hidden" states and emissions which are statistically dependent on the states but can be observed. The model is parameterized by two conditional probability matrices, the transition and emission matrices.; Among the algorithms used for the parameter estimate of HMM, Baum-Welch (B-W) algorithm is by far the most popular algorithm. However, it has some well-known shortcomings. For example, it is only guaranteed to find a local maximum, with a strong dependency on the initial parameters chosen. The literature notes an "overfitting" problem, in which the B-W estimate gives high likelihood to a given observation sequence, but low likelihood to other observation sequences of the same hidden Markov chain. As a consequence of these this researcher has shown that usually the B-W estimator is inconsistent for the simplest possible case of two hidden states and two emission states, and with a generic choice of parameters and generic observation sequences.; The dissertation also provides an algorithm for computation of the least square error (LSE) estimate of the hidden Markov chain. The LSE estimate is consistent by definition, needs only one time computation, and again with the simplest possible case of HMM described above this researcher has demonstrated the estimates are remarkably closer to the actual parameters, with much better results than what could typically be obtained using the B-W algorithm. A possible reason for the LSE estimation not being very popular regarding HMM, in spite of its much superior quality of its estimates, could be the computational complexity it requires. Although a straightforward computation could require the complexity that increases exponentially with respect to the sequence length, this researcher has shown that a polynomial complexity (with still exponential complexity in the state size) can be achieved using an algorithm proposed in this dissertation, making the LSE estimation quite feasible in some applications such as the ones related to precipitation, heart rate monitoring, and so on.
机译:隐马尔可夫模型(HMM)对于科学和各种应用具有相当大的兴趣。它们由具有“隐藏”状态和排放的马尔可夫链组成,这些状态和排放在统计上取决于状态,但可以观察到。该模型由两个条件概率矩阵参数化,即转移矩阵和发射矩阵。在用于HMM参数估计的算法中,Baum-Welch(B-W)算法是迄今为止最受欢迎的算法。但是,它有一些众所周知的缺点。例如,只能保证找到一个局部最大值,该最大值与所选的初始参数有很大关系。文献指出了“过度拟合”问题,其中B-W估计给定给定观测序列的可能性很高,而给同一隐藏马尔可夫链的其他观测序列的可能性很小。由于这些结果,研究人员表明通常对于两个隐藏状态和两个发射状态的最简单情况,以及参数和观察序列的一般选择,B-W估计器是不一致的。论文还提供了一种计算隐马尔可夫链的最小二乘估计值的算法。根据定义,LSE估计值是一致的,只需要一次计算,并且在上述最简单的HMM情况下,该研究人员证明了估计值非常接近实际参数,其结果要比通常使用HMM可获得的结果好得多。 BW算法。尽管LSE估计的质量要好得多,但LSE估计在HMM方面不受欢迎的可能原因可能是它要求的计算复杂性。尽管简单的计算可​​能会要求复杂度相对于序列长度呈指数增长,但研究人员表明,使用本文提出的算法可以实现多项式复杂度(状态大小仍为指数复杂度),这使得LSE在某些应用中,例如与降水,心率监测等相关的应用,估算非常可行。

著录项

  • 作者

    Murakami, Junko.;

  • 作者单位

    Arizona State University.;

  • 授予单位 Arizona State University.;
  • 学科 Mathematics.
  • 学位 Ph.D.
  • 年度 2005
  • 页码 117 p.
  • 总页数 117
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 数学 ;
  • 关键词

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号