.png){kind=icon}
.png){kind=icon}
Return
A generalized interval probability-based optimization method for training generalized hidden Markov model
.png){kind=icon}
PRE
AI
DOI：10.1016/j.sigpro.2013.06.009.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Recently a generalized hidden Markov model (GHMM) was proposed for solving the information fusion problems under aleatory and epistemic uncertainties in engineering application. In GHMM, aleatory uncertainty is captured by the probability measure whereas epistemic uncertainty is modeled by generalized interval. In this paper, the problem of how to train the GHMM with a small amount of observation data is studied. An optimization method as a generalization of the Baum-Welch algorithm is proposed. With a generalized Baum-Welch's auxiliary function and the Jensen inequality based on generalized interval, the GHMM parameters are estimated and updated by the lower and upper bounds of observation sequences. A set of training and re-estimation formulas are developed. With a multiple observation expectation maximization (EM) algorithm, the training method guarantees the local maxima of the lower and the upper bounds. Two case studies of recognizing the tool wear and cutting states in manufacturing is described to demonstrate the proposed method. The results show that the optimized GHMM has a good recognition performance. (C) 2013 Elsevier B.V. All rights reserved.
Keywords:
Generalized hidden Markov model
Generalized Jensen inequality
Generalized Baum-Welch algorithm
Generalized interval probability
State recognition