对经典隐马尔可夫模型学习算法的改进

改进经典隐马尔可夫模型(HMM)的状态转移和输出观测值的假设条件,并在经典隐马尔可夫模型的基础上导出新模型的学习算法.新算法避免了经典隐马尔可夫模型中状态转移概率和输出观测值概率计算时只考虑当前状态而不考虑历史的简单做法.     

基于EM算法隐Markov模型参数估计

描述最大似然参数估计问题,介绍如何用EM算法求解最大似然参数估计.首先给出EM算法的抽象形式,然后介绍EM算法的一个应用:求隐Markov模型中的参数估计.用EM算法推导出隐Markov模型中参数的迭代公式.     

隐Markov模型的强马氏性

引入隐Markov模型强马氏性的概念,并进一步研究了隐Markov模型在强马氏性方面的一些性质.     

有限状态隐Markov模型的熵率存在定理

引入了隐Markov模型的定义和绝对平均收敛的概念,研究了信息论中的编码问题,得到了有限状态下隐非齐次Markov模型的熵率存在性定理.     

可列非齐次隐Markov模型的强大数定律

隐马尔科夫模型被广泛的应用于弱相依随机变量的建模,是研究神经生理学、发音过程和生物遗传等问题的有力工具。研究了可列非齐次隐 Markov 模型的若干性质,得到了这类模型的强大数定律,推广了有限非齐次马氏链的一类强大数定律。     

带严格时间限制的大宗物资运输模型及算法

阐述了带严格时间限制的大宗物资运输问题的特性，应用目标规划建立了单个发点多收点问题的数学模型，根据模型约束条件多的特点，给出了求解算法，并编制了相应的计算机程序。     

剖面隐马氏模型训练算法的改进

利用剖面隐马氏模型获得多序列联配，一般需要经过初始化、训练、联配三个过程．然而，目前广泛采用的Baum—welch训练算法假设各条可观察序列互相独立，这与实际情况有所不符．本文对剖面隐马氏模型，给出可观察序列在互相不独立情况下的改进Baum—wlelch算法，在可观察序列两种特殊情况下（互相独立和一致依赖），得到了改进算法的具体表达式，讨论了一般情况下权重的选取方法．最后通过一个具体的蛋白质家族的多序列联配来说明改进算法的效果．     

基于状态驻留时间下由转移弧产生输出的HMM模型中的参数估计

本讨论了用状态驻留时间来模型化传统的HMM模型。HMM的一个基本假设是它认为语音信号是准平稳的。然而由状态输出yt的HMM模型，并不能很好地表征语音信号中平稳段或平稳段之间的具体特征；由转移弧产生输出的自左向右HMM系统,则对语音特征作更为细致的描述。本主要讨论在[2]的基础上,对新建模型进行参数估计。     

部分状态可见的隐马尔可夫模型的Viterbi算法

本文研究了隐马尔可夫模型的Viterbi算法,在已知隐马尔可夫模型的部分状态、初始概率分布、状态转移概率矩阵和观测概率矩阵的条件下,由此Viterbi算法给出最优状态序列的估计.相对于已有的算法,本文的算法考虑了部分可见状态对初始条件和递推公式的影响,并且本文的算法能保证预测的状态序列是整体最优的.最后,我们将本文的算法应用于故障识别,从而验证所设计算法的可行性.     

基于T2FCM-FE-HMMs的隐马氏模型参数估计算法

把2型模糊集的思想引入到了基于模糊聚类的离散HMM参数训练中,提出了改进的T 2FCM-FE-HMM s算法。     

Optimal filters for a hidden Markov random field model

A Markov random field (MRF) is a useful technical tool for modeling dynamics systems exhibiting some type of spatio-temporal variability. In this paper, we propose optimal filters for the states of a partially observed temporal Markov random field. We also discuss parameters estimation. This generalizes an earlier work by Elliott and Aggoun [1].     

Selecting hidden Markov model state number with cross-validated likelihood

The problem of estimating the number of hidden states in a hidden Markov model is considered. Emphasis is placed on cross-validated likelihood criteria. Using cross-validation to assess the number of hidden states allows to circumvent the well-documented technical difficulties of the order identification problem in mixture models. Moreover, in a predictive perspective, it does not require that the sampling distribution belongs to one of the models in competition. However, computing cross-validated likelihood for hidden Markov models for which only one training sample is available, involves difficulties since the data are not independent. Two approaches are proposed to compute cross-validated likelihood for a hidden Markov model. The first one consists of using a deterministic half-sampling procedure, and the second one consists of an adaptation of the EM algorithm for hidden Markov models, to take into account randomly missing values induced by cross-validation. Numerical experiments on both simulated and real data sets compare different versions of cross-validated likelihood criterion and penalised likelihood criteria, including BIC and a penalised marginal likelihood criterion. Those numerical experiments highlight a promising behaviour of the deterministic half-sampling criterion.     

On approximation of smoothing probabilities for hidden Markov models

We consider the smoothing probabilities of hidden Markov model (HMM). We show that under fairly general conditions for HMM, the exponential forgetting still holds, and the smoothing probabilities can be well approximated with the ones of double-sided HMM. This makes it possible to use ergodic theorems. As an application we consider the pointwise maximum a posteriori segmentation, and show that the corresponding risks converge.     

A correction on approximation of smoothing probabilities for hidden Markov models

In this note, we correct a mistake concerning Theorem 2.1 in Lember (2011a).     

Bayesian Monte Carlo estimation for profile hidden Markov models

Hidden Markov models are used as tools for pattern recognition in a number of areas, ranging from speech processing to biological sequence analysis. Profile hidden Markov models represent a class of so-called “left–right” models that have an architecture that is specifically relevant to classification of proteins into structural families based on their amino acid sequences. Standard learning methods for such models employ a variety of heuristics applied to the expectation-maximization implementation of the maximum likelihood estimation procedure in order to find the global maximum of the likelihood function. Here, we compare maximum likelihood estimation to fully Bayesian estimation of parameters for profile hidden Markov models with a small number of parameters. We find that, relative to maximum likelihood methods, Bayesian methods assign higher scores to data sequences that are distantly related to the pattern consensus, show better performance in classifying these sequences correctly, and continue to perform robustly with regard to misspecification of the number of model parameters. Though our study is limited in scope, we expect our results to remain relevant for models with a large number of parameters and other types of left–right hidden Markov models.     

Risk-sensitive and risk-neutral control for continuous-time hidden Markov models

In this paper the optimal control of a continuous-time hidden Markov model is discussed. The risk-sensitive problem involves a cost function which has an exponential form and a risk parameter, and is solved by defining an appropriate information state and dynamic programming. As the risk parameter tends to zero, the classical risk-neutral optimal control problem is recovered. The limits are proved using viscosity solution methods.The first author wishes to acknowledge the funding of the activities of the Cooperative Research Centre for Robust and Adaptive Systems by the Australian Commonwealth Government under the Cooperative Research Centers Program. The support of NSERC Grant A7964 is acknowledged by the second author, as is the hospitality of the Department of Systems Engineering and the Cooperative Research Centre for Robust and Adaptive Systems, Australian National University, in July 1993.     

Leroux's method for general hidden Markov models

The method introduced by Leroux [Maximum likelihood estimation for hidden Markov models, Stochastic Process Appl. 40 (1992) 127–143] to study the exact likelihood of hidden Markov models is extended to the case where the state variable evolves in an open interval of the real line. Under rather minimal assumptions, we obtain the convergence of the normalized log-likelihood function to a limit that we identify at the true value of the parameter. The method is illustrated in full details on the Kalman filter model.     

基于动态规划的高阶隐马氏模型推广的Viterbi算法

首先通过Hadar等价变换方法将高阶隐马氏模型转换为与之等价的一阶向量值隐马氏模型,然后利用动态规划原理建立了一阶向量值隐马氏模型的Viterbi算法,最后通过高阶隐马氏模型和一阶向量值隐马氏模型之间的等价关系建立了高阶隐马氏模型基于动态规划推广的Viterbi算法．研究结果在一定程度上推广了几乎所有隐马氏模型文献中所涉及到的解码问题的Viterbi算法,从而进一步丰富和发展了高阶隐马氏模型的算法理论．     

A model for real-time failure prognosis based on hidden Markov model and belief rule base

As one of most important aspects of condition-based maintenance (CBM), failure prognosis has attracted an increasing attention with the growing demand for higher operational efficiency and safety in industrial systems. Currently there are no effective methods which can predict a hidden failure of a system real-time when there exist influences from the changes of environmental factors and there is no such an accurate mathematical model for the system prognosis due to its intrinsic complexity and operating in potentially uncertain environment. Therefore, this paper focuses on developing a new hidden Markov model (HMM) based method which can deal with the problem. Although an accurate model between environmental factors and a failure process is difficult to obtain, some expert knowledge can be collected and represented by a belief rule base (BRB) which is an expert system in fact. As such, combining the HMM with the BRB, a new prognosis model is proposed to predict the hidden failure real-time even when there are influences from the changes of environmental factors. In the proposed model, the HMM is used to capture the relationships between the hidden failure and monitored observations of a system. The BRB is used to model the relationships between the environmental factors and the transition probabilities among the hidden states of the system including the hidden failure, which is the main contribution of this paper. Moreover, a recursive algorithm for online updating the prognosis model is developed. An experimental case study is examined to demonstrate the implementation and potential applications of the proposed real-time failure prognosis method.     

Kalman filtering of a space-time Markov random field

In this paper, finite-dimensional recursive filters for space-time Markov random fields are derived. These filters can be used with the expectation maximization (EM) algorithm to yield maximum likelihood estimates of the parameters of the model.