Optimized Hidden Markov Model based on Constrained Particle Swarm Optimization
Machine Learning
2018-11-09 v1 Machine Learning
Abstract
As one of Bayesian analysis tools, Hidden Markov Model (HMM) has been used to in extensive applications. Most HMMs are solved by Baum-Welch algorithm (BWHMM) to predict the model parameters, which is difficult to find global optimal solutions. This paper proposes an optimized Hidden Markov Model with Particle Swarm Optimization (PSO) algorithm and so is called PSOHMM. In order to overcome the statistical constraints in HMM, the paper develops re-normalization and re-mapping mechanisms to ensure the constraints in HMM. The experiments have shown that PSOHMM can search better solution than BWHMM, and has faster convergence speed.
Cite
@article{arxiv.1811.03450,
title = {Optimized Hidden Markov Model based on Constrained Particle Swarm Optimization},
author = {L. Chang and Yacine Ouzrout and Antoine Nongaillard and Abdelaziz Bouras},
journal= {arXiv preprint arXiv:1811.03450},
year = {2018}
}