Hidden Markov models training by a particle swarm optimization algorithm
From MaRDI portal
Publication:2643715
DOI10.1007/s10852-005-9037-7zbMath1278.90459OpenAlexW2056519714MaRDI QIDQ2643715
Mohamed Slimane, Sébastien Aupetit, Nicolas Monmarché
Publication date: 27 August 2007
Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10852-005-9037-7
Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Cites Work
- Unnamed Item
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- The hierarchical hidden Markov model: Analysis and applications
- Recursive computation of smoothed functionals of hidden Markovian processes using a particle approximation
- Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem
- Design of a linguistic statistical decoder for the recognition of continuous speech
- A Maximization Technique Occurring in the Statistical Analysis of Probabilistic Functions of Markov Chains