Evolving the topology of hidden markov models using evolutionary algorithms

19Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Hidden Markov models (HMM) are widely used for speech recognition and have recently gained a lot of attention in the bioinformatics community, because of their ability to capture the information buried in biological sequences. Usually, heuristic algorithms such as Baum-Welch are used to estimate the model parameters. However, Baum-Welch has a tendency to stagnate on local optima. Furthermore, designing an optimal HMM topology usually requires a priori knowledge from a field expert and is usually found by trial-and-error. In this study, we present an evolutionary algorithm capable of evolving both the topology and the model parameters of HMMs. The applicability of the method is exemplified on a secondary structure prediction problem.

Cite

CITATION STYLE

APA

Thomsen, R. (2002). Evolving the topology of hidden markov models using evolutionary algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2439, pp. 861–870). Springer Verlag. https://doi.org/10.1007/3-540-45712-7_83

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free