The hierarchical hidden Markov model: Analysis and applications

Machine Learning

Volumn 32, Issue 1, 1998, Pages 41-62

  Fine, Shai ^a   Singer, Yoram ^b   Tishby, Naftali ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

Cursive handwriting; Hidden variable models; Statistical models; Temporal pattern recognition

Indexed keywords

CURSIVE HANDWRITING; HIDDEN VARIABLE MODELS; STATISTICAL MODELS; TEMPORAL PATTERN RECOGNITION;

ALGORITHMS; CODES (SYMBOLS); DATA REDUCTION; MARKOV PROCESSES; MATHEMATICAL MODELS; NATURAL LANGUAGE PROCESSING SYSTEMS; PARAMETER ESTIMATION; RANDOM PROCESSES; STATISTICAL METHODS;

HIERARCHICAL SYSTEMS; CHARACTER RECOGNITION;

CURSIVE HANDWRITING; HIERARCHICAL HIDDEN MARKOV MODELS (HHMM);

EID: 0032119668     PISSN: 08856125     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1007469218079     Document Type: Article

References (23)

1. Abe, N. & Warmuth, M. (1992). On the computational complexity of approximating distributions by probabilistic automata. Machine Learning, 9:205-260.
2. Baldi, P., Chauvin, Y., Hunkapiller, T. & McClure, M. (1994). Hidden Markov models of biological primary sequence information. Proc. Nat. Acd. Sci. (USA), 91(3): 1059-1063.
3. Baum, L.E. & Petrie, T. (1966). Statistical inference for probabilistic functions of finite state Markov chains. Annals of Mathematical Statistics, Vol. 37.
4. Bengio, Y. & Frasconi, P. (1995). An input-output HMM architecture. In G. Tesauro, D.S. Touretzky, and T.K. Leen, editors, Advances in Neural Information Processing Systems 7, pages 427-434. MIT Press, Cambridge, MA.
5. Cover, T. & Thomas, J. (1991). Elements of Information Theory. Wiley.
6. Dempster, A.P., Laird, N.M. & Rubin, D.B. (1977). Maximum-likelihood from incomplete data via the EM algorithm. Journal of Royal Statistical Society, Series B, 39:1-38.
7. Gat, I., Tishby, N. & Abeles, M. (1997). Hidden Markov modeling of simultaneously recorded cells in the associative cortex of behaving monkeys. Network: Computation in neural systems, 8:3, pages 297-322.
8. Ghahramani Z. & Jordan, M.I. (1997). Factorial hidden Markov models. Machine Learning, 29: 245-273.
9. Gillman, D. & Sipser, M. (1994). Inference and minimization of hidden Markov chains. Proceedings of the Seventh Annual Workshop on Computational Learning Theory, pages 147-158.
10. Jelinek, F. (1985). Robust part-of-speech tagging using a hidden Markov model. IBM T.J. Watson Research Technical Report.
11. Jelinek, F. (1983). Markov source modeling of text generation. Technical report, IBM T.J. Watson Research Center Technical Report.
12. Jelinek, F. (1985). Self-organized language modeling for speech recognition. IBM T.J. Watson Research Center Technical Report.
13. Krogh, A., Mian, S.I. & Haussler, D. (1994). A hidden Markov model that finds genes in E.coli DNA. NAR, 22"4768-4778.
14. Lari, K. & Young, S.J. (1990). The estimation of stochastic context free grammars using the Inside-Outside algorithm. Computers Speech and Language, 4.
15. Nag, R., Wong, K.H. & Fallside, F. (1985). Script recognition using hidden Markov models. Proceedings of International Conference on Acoustics Speech and Signal Processing, pages 2071-2074.
16. Rabiner, L.R. & Juang, B.H. (1986). An introduction to hidden Markov models. IEEE ASSP Magazine, No. 3.
17. Rabiner, L.R. (1989). A tutorial on hidden Markov models and selected applications in speech recognition. Proceedings of the IEEE.
18. Rissanen, J. (1986). Complexity of strings in the class of Markov sources. IEEE Transactions on Information Theory, 32(4):526-532.
19. Ron, D., Singer, Y. & Tishby, N. (1996). The power of amnesia: learning probabilistic automata with variable memory length. Machine Learning, 25:117-149.
20. Singer, Y. & Tishby, N., (1994). Dynamical encoding of cursive handwriting. Biological Cybernetics, 71(3):227-237.
21. Singer, Y. & Warmuth, M.K. (1997). Training algorithms for hidden Markov models using entropy based distance functions. In M.C. Mozer, M.I. Jordan, and T. Petsche, editors, Advances in Neural Information Processing Systems 9, pages 641-647. MIT Press, Cambridge, MA.
22. Stolcke A. & Omohundro, S.M. (1994). Best-first model merging for hidden Markov model induction. Technical Report ICSI TR-94-003.
23. Viterbi, A.J. (1967). Error bounds for convulutional codes and an asymptotically optimal decoding algorithm. IEEE Transactions on Information Theory, 13:260-269.