Optimizing hidden Markov models with a genetic algorithm

被引:0
作者
Slimane, M
Venturini, G
Brouard, T
deBeauville, JPA
Brandeau, A
机构
来源
ARTIFICIAL EVOLUTION | 1996年 / 1063卷
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper is presented the application of genetic algorithms (GAs) to the learning of hidden Markov models (HMMs). The Baum-Welch algorithm (BW): which optimizes the coefficients of a HMM, is improved by the use of a GA. The GA is able to find rapidly a good initial model compared to random generation, and this initial model is optimized further with BW. A representation and adapted genetic operators have been introduced in order to evolve matrix of probabilities. Several tests on artificial data show the interest in using a GA with BW.
引用
收藏
页码:384 / 396
页数:13
相关论文
共 18 条
[1]  
ANIGBOGU J, 1992, THESIS U NANCY 1
[2]  
BACK T., 1991, P 4 INT C GEN ALG, P2
[3]  
Baum L.E., 1972, Inequalities III: Proceedings of the Third Symposium on Inequalities, page, V3, P1
[4]   A MAXIMIZATION TECHNIQUE OCCURRING IN STATISTICAL ANALYSIS OF PROBABILISTIC FUNCTIONS OF MARKOV CHAINS [J].
BAUM, LE ;
PETRIE, T ;
SOULES, G ;
WEISS, N .
ANNALS OF MATHEMATICAL STATISTICS, 1970, 41 (01) :164-&
[5]  
Bersini H., 1991, PROC 4 INT C GENETIC, P520
[6]  
De Jong K., 1988, Machine Learning, V3, P121, DOI 10.1023/A:1022606120092
[7]   A GENERALIZED HIDDEN MARKOV MODEL WITH STATE-CONDITIONED TREND FUNCTIONS OF TIME FOR THE SPEECH SIGNAL [J].
DENG, L .
SIGNAL PROCESSING, 1992, 27 (01) :65-78
[8]  
GAUVAIN JL, 1994, LIMSKI CONTINUOUS SP, P1557
[9]  
Holland JH., 1992, ADAPTATION NATURAL A, DOI DOI 10.7551/MITPRESS/1090.001.0001
[10]  
KRIOUILE A, 1990, THESIS U NANCY 1