A low complexity simulated annealing approach for training hidden Markov models

Tarik Al-Ani and Yskandar Hamam

International Journal of Operational Research, 2010, vol. 8, issue 4, 483-510

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.

Keywords: hidden Markov models; HMM; operational research; simulated annealing; finite coding; solution space; optimal trajectory. (search for similar items in EconPapers)
Date: 2010
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=34070 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:8:y:2010:i:4:p:483-510

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().