A new constant memory recursion for hidden markov models

Journal of Computational Biology

Volumn 21, Issue 2, 2014, Pages 99-117

  Bartolucci, Francesco ^a   Pandolfi, Silvia ^a  

^a UNIVERSITY OF PERUGIA   (Italy)

Author keywords

expectation maximization algorithm; forward backward recursions; global decoding; latent Markov models; Viterbi algorithm

Indexed keywords

ALGORITHM; ARTICLE; PROBABILITY; STATISTICAL MODEL;

ALGORITHMS; LINEAR MODELS; MARKOV CHAINS; MODELS, STATISTICAL;

EID: 84893108296     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.2013.0096     Document Type: Article

References (35)

1. Askar, M., and Derin, H. 1981. A recursive algorithm for the Bayes solution of the smoothing problem. IEEE Tran. Automat. Contr. 26, 558-561
2. Bartolucci, F., and Besag, J 2002. A recursive algorithm for Markov random fields. Biometrika 89, 724-730
3. Bartolucci, F., and De Luca, G. 2001. Maximum likelihood estimation of a latent variable time-series model. Appl. Stochastic Models Business Ind. 17, 5-17
4. Bartolucci, F., and Solis-Trapala, I. 2010. Multidimensional latent Markov models in a developmental study of inhibitory control and attentional flexibility in early childhood. Psychometrika 75, 725-743
5. Bartolucci, F., Farcomeni, A., and Pennoni, F. 2013. Latent Markov Models for Longitudinal Data. Chapman and Hall/CRC Press, Boca Raton, F.L.
6. Bartolucci, F., and Pandolfi, S. 2013. Comment on the paper ''On the memory complexity of the forward-backward algorithm.'' Pattern Recognition Letters, in press
7. Baum, L.E., Petrie, T., Soules, G., and Weiss, N. 1970. A maximization technique occurring in the statistical analysis of probabilistic functions of Markov chains. Ann. Math. Stat. 41, 164-171
8. Bishop, M.J., and Thompson, E.A. 1986. Maximum likelihood alignment of DNA sequences. J. Mol. Biol. 190, 159-165
9. Churbanov, A., and Winters-Hilt, S. 2008. Implementing EM and Viterbi algorithms for hidden Markov model in linear memory. BMC Bioinformatics 9, 224
10. Churchill, G.A. 1989. Stochastic models for heterogeneous DNA sequences. Bull. Math. Biol. 51, 79-94
11. Churchill, G.A. 1992. Hidden Markov chains and the analysis of genome structure. Comput. Chem. 16, 107-115
12. De Fonzo, V., Aluffi-Pentini, F., and Parisi, V. 2007. Hidden Markov models in bioinformatics. Curr. Bioinform. 2, 49-61
13. Dempster, A.P., Laird, N.M., and Rubin, D.B. 1977. Maximum likelihood from incomplete data via the EM algorithm (with discussion). J. R. Stat. Soc. Series B Stat. Methodol. 39, 1-38
14. Durbin, R., Eddy, S.R., Krogh, A., and Mitchison, G. 1998. Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids. Cambridge University Press, Cambridge, U.K.
15. Grice, J.A., Hughey, R., and Speck, D. 1997. Reduced space sequence alignment. Comput. Appl. Biosci. 13, 45-53
16. Juang, B.H., and Rabiner, L.R. 1991. Hidden Markov models for speech recognition. Technometrics 33, 251-272
17. Khreich, W., Granger, E., Miri, A., and Sabourin, R. 2010. On the memory complexity of the forward-backward algorithm. Pattern Recognit. Lett. 31, 91-99
18. Khreich, W., Granger, E., Miri, A., and Sabourin, R 2012. A surveyeof techniques for incremental learning of HMM parameters Inf. Sci. 197,e105-130
19. Krogh, A., Brown, M., Mian, I.S., et al 1994. Hidden Merkov models in computational biology: Applications to protein modeling J. Mol. Biol. e35, 1501-1531
20. Langley, P. 1995. Order effects in incremental learning. In Reimann, P., and Spada, H., ed. Learning in Humans and Machines: Towards an Interdisciplinary Learning Science. Elsevier, Oxford, U.K.
21. Langrock, R., MacDonald, I.L., and Zucchini, W. 2012. Some nonstandard stochastic volatility models and their estimation using structured hidden Markov models. J. Empir. Finance 19, 147-161
22. Lindgren, G. 1978. Markov regime models for mixed distributions and switching regressions. Scand. J. Stat. 5, 81-91
23. Lystig, T.C., and Hughes, J.P. 2002. Exact computation of the observed information matrix for hidden Markov models. J. Comput. Graph. Stat. 11, 678-689
24. McLachlan, G., and Peel, D. 2000. Finite Mixture Models. Wiley, Hoboken, NJ
25. Mikló s, I., and Meyer, I.M. 2005. A linear memory algorithm for Baum-Welch training. BMC Bioinformatics 6, 231
26. Ott, G. 1967. Compact encoding of stationary markov sources. IEEE Trans. Inf. Theory 13, 82-86
27. Polikar, R., Udpa, L., Udpa, S.S., and Honavar, V. 2001. Learn + +: An incremental learning algorithm for supervised neural networks. IEEE Trans. Syst. Man Cybern. C Appl. Rev. 31, 497-508
28. Raviv, J. 1967. Decision making in Markov chains applied to the problem of pattern recognition. IEEE Trans. Inf. Theory 13, 536-551
29. Scott, S.L. 2002. Bayesian methods for hidden Markov models: Recursive computing in the 21st century. J. Am. Stat. Assoc. 97, 337-351
30. Tarnas, C., and Hughey, R. 1998. Reduced space hidden Markov model training. Bioinformatics 14, 401-406
31. Taylor, S.J. 2005. Asset Price Dynamics, Volatility, and Prediction. Princeton University Press, Princeton, NJ.
32. Viterbi, A.J. 1967. Error bounds for convolutional codes and an asymptotically optimal decoding algorithm. IEEETrans. Inf. Theory 13, 260-269
33. Welch, L.R. 2003. Hidden Markov models and the Baum-Welch algorithm. IEEE Inf. Theory Soc. Newsl. 53, 1-14
34. Wheeler, R., and Hughey, R. 2000. Optimizing reduced-space sequence analysis. Bioinformatics 16, 1082-1090
35. Zucchini, W., and MacDonald, I.L. 2009. Hidden Markov and Other Models for Time Series: An Introduction Using R. Chapman and Hall/CRC Press, Boca Raton, FL.