A low complexity simulated annealing approach for training hidden Markov models
by Tarik Al-Ani, Yskandar Hamam
International Journal of Operational Research (IJOR), Vol. 8, No. 4, 2010

Abstract: An algorithm for the training of Hidden Markov Models (HMMs) by simulated annealing is presented. This algorithm is based on a finite coding of the solution space based on the optimal trajectory of the state. It is applied to both discrete and continuous Gaussian observations. The algorithm needs no specific initialisation of the initial HMM by the user, the cooling schedule being general and applicable to any specific model. The parameters of the algorithm (initial and final temperatures) are derived automatically from theoretical considerations. The objective function evaluations of the algorithm are made independent of the problem size in order to minimise the computation time. A comparative study between the conventional Baum–Welch algorithm, Viterbi based algorithm and our simulated annealing algorithm shows that our algorithm gives better results and overcome the problem of HMM initialisation needed by the others.

Online publication date: Wed, 07-Jul-2010

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com