A Comparison of Some Methods for Training Hidden Markov Models on Sequences with Missing Observations

被引:0
作者
Popov, Alexander [1 ]
Gultyaeva, Tatyana [1 ]
Uvarov, Vadim [1 ]
机构
[1] Novosibirsk State Tech Univ, Dept Appl Math & Comp Sci, Novosibirsk, Russia
来源
2016 11TH INTERNATIONAL FORUM ON STRATEGIC TECHNOLOGY (IFOST), PTS 1 AND 2 | 2016年
关键词
hidden Markov models; machine learning; sequence recognition; Baum-Welch algorithm; missing observations; incomplete data; PROBABILISTIC FUNCTIONS;
D O I
暂无
中图分类号
TE [石油、天然气工业]; TK [能源与动力工程];
学科分类号
0807 ; 0820 ;
摘要
The three approaches to the problem of hidden Markov models training on sequences with missing observations are discussed: marginalization of missing observations, gluing of available parts of the sequence and training on the multisequence formed from the available parts of the sequence. The training performance of the three approaches is evaluated for various numbers of gaps in training sequences. The results were compared to the standard imputation method based on the mode (the most frequent value) of nearest observations. The marginalization approach showed the best training accuracy. The multisequence approach demonstrated a very poor performance hence it is considered inapplicable. Both the marginalization method and the gluing method performed better than the mode imputation method. The dependence of training accuracy on the position of gaps in training sequence was investigated. It has been found that the biggest decrease in training accuracy is achieved when the gap is situated at the beginning or in the middle of the sequence while the lowest decrease is observed when it is situated at the end.
引用
收藏
页数:5
相关论文
共 10 条