Hidden Markov Models Training Using Population-based Metaheuristics

DOI10.1007/978-3-540-72960-0_20MaRDI QIDQ3509450zbMATH OpenOpenAlexFDO

Authors Sébastien Aupetit, Nicolas Monmarché, Mohamed Slimane

Publication date 1 July 2008

Published in Natural Computing Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72960-0_20

zbMATH Keywords

genetic algorithmhidden Markov modelparticle swarm optimizationsearch spacetabu search

Mathematics Subject Classification ID

Markov and semi-Markov decision processes (90C40) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Hidden Markov models training by a particle swarm optimization algorithm
• A low complexity simulated annealing approach for training hidden Markov models
• Multiple sequence alignment using the hidden Markov model trained by an improved quantum-behaved particle swarm optimization
• Optimisation of HMM topology and its model parameters by genetic algorithms
• scientific article; zbMATH DE number 5979097

Cites work

• A low complexity simulated annealing approach for training hidden Markov models
• An inequality with applications to statistical estimation for probabilistic functions of Markov processes and to a model for ecology
• Arbres de Markov triplet et fusion de Dempster-Shafer. (Triplet Markov trees and Dempster-Shafer fusion)
• Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
• Future paths for integer programming and links to artificial intelligence
• scientific article; zbMATH DE number 3497315 (Why is no real title available?)
• scientific article; zbMATH DE number 1062113 (Why is no real title available?)
• scientific article; zbMATH DE number 1750456 (Why is no real title available?)
• scientific article; zbMATH DE number 2161998 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• Optimization by simulated annealing
• Recursive computation of smoothed functionals of hidden Markovian processes using a particle approximation
• Tabu Search—Part I
• Tabu Search—Part II
• The double chain markov model
• The hierarchical hidden Markov model: Analysis and applications
• The segmental K-means algorithm for estimating parameters of hidden Markov models

Cited in

(5)

• Hidden Markov models training by a particle swarm optimization algorithm
• scientific article; zbMATH DE number 5198952 (Why is no real title available?)
• Evolutionary Computation in Combinatorial Optimization
• A low complexity simulated annealing approach for training hidden Markov models
• Multiple sequence alignment using the hidden Markov model trained by an improved quantum-behaved particle swarm optimization

This page was built for publication: Hidden Markov Models Training Using Population-based Metaheuristics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3509450)