A novel algorithm for parameter estimation of Hidden Markov Model inspired by Ant Colony Optimization
Akram Emdadi, Fatemeh Ahmadi Moughari, Fatemeh Yassaee Meybodi and 1 more
Heliyon · 2019
doi:10.1016/j.heliyon.2019.e01299 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
HMM is a powerful method to model data in various fields. Estimation of Hidden Markov Model parameters is an NP-Hard problem. We propose a heuristic algorithm called “AntMarkov” to improve the efficiency of estimating HMM parameters. We compared our method with four algorithms. The comparison was conducted on 5 different simulated datasets with different features. For further evaluation, we analyzed the performance of algorithms on the prediction of protein secondary structures problem. The results demonstrate that our algorithm obtains better results with respect to the results of the other algorithms in terms of time efficiency and the amount of similarity of estimated parameters to the original parameters and log-likelihood.The source code of our algorithm is available in https://github.com/emdadi/HMMPE.
Abstract licence: CC BY-NC
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.