Evidence map›Paper›PMID 30923763›Full record

ArticleHeliyon2019

A novel algorithm for parameter estimation of Hidden Markov Model inspired by Ant Colony Optimization.

Akram Emdadi, Fatemeh Ahmadi Moughari, Fatemeh Yassaee Meybodi, Changiz Eslahchi

Abstract read
In one paragraph

Article in Heliyon, 2019. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

1 citing paper in PubMed.

  1. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors.

Akram EmdadiDepartment of Mathematics, Shahid-Beheshti University, Tehran, Iran.
Fatemeh Ahmadi MoughariDepartment of Mathematics, Shahid-Beheshti University, Tehran, Iran.
Fatemeh Yassaee MeybodiDepartment of Mathematics, Shahid-Beheshti University, Tehran, Iran.
Changiz EslahchiDepartment of Mathematics, Shahid-Beheshti University, Tehran, Iran.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

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.

Indexed as

Computer science

Identifiers

PMID30923763
PMCPMC6422281

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC-ND
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.