A Bayesian approach for structural learning with hidden Markov models

Scientific Programming

Volumn 10, Issue 3, 2002, Pages 201-219

  Li, Cen ^a   Biswas, Gautam ^b  

^a MIDDLE TENNESSEE STATE UNIVERSITY   (United States)

^b VANDERBILT UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MARKOV PROCESSES; MATHEMATICAL MODELS; PARAMETER ESTIMATION; SPEECH RECOGNITION;

HIDDEN MARKOV MODELS (HMM);

LEARNING SYSTEMS;

EID: 0036455515     PISSN: 10589244     EISSN: None     Source Type: Journal    
DOI: 10.1155/2002/604791     Document Type: Article

References (33)

1. D. Jurafsky and J.H. Martin, Speech and Language Processing, Prentice Hall, 2000.
2. S. Rogic, A.K. Mackworth and F.B.F. Ouellette, Evaluation of gene-finding programs on mammalian sequences, Genomic Research 11 (2001), 817-832.
3. L.R. Rabiner, A tutorial on hidden markov models and selected applications in speech recognition, Proceedings of the IEEE 77(2) (Feb. 1989), 257-285.
4. W.J. Stewart, Introduction to the Numerical Solution of Markov Chains, Princeton University Press, 1994.
5. C. Li and G. Biswas, Bayesian temporal data clustering using hidden markov model representation, in: Proceedings of the 17th International conference on Machine Learning. P. Langley, ed., Morgan Kaufmann Publishers, 2000, pp. 543-550.
6. L.R. Bahl, P.F. Brown, P.V. De Souza and R.L. Mercer, Maximum mutual information estimation of hidden markov model parameters, in: Proceedings of the IEEE-IECEJ-AS International Conference on Acoustics, Speech, and Signal Processing, (Vol. 1), 1986, pp. 49-52.
7. Y. Singer and M. Warmuth, Training algorithms for hidden markov models using entropy based distance functions, Advances in Neural Information Processing Systems 9 (1996), 641-647.
8. S. Kwong, Q.H. He and K.F. Man, Training approaches for hidden markov models, Electronics Letters 32(17) (1996), 1554-1555.
9. L.E. Baum, T. Petrie, G. Soules and N. Weiss, A maximization technique occurring in the statistical analysis of probabilistic functions of markov chains, The Annuals of Mathematical Statistics 4(1) (1970), 164-171.
10. A.P. Dempster, N.M. Laird and D.B. Rubin, Maximum likelihood from incomplete data via the em algorithm, Journal of Royal Statistical Society Series B(methodological) 39 (1977), 1-38.
11. Z. Ghahramani and M.I. Jordan, Factorial hidden markov models, Machine Leaning 29 (1997), 245-273.
12. A. Stolcke and S.M. Omohundro, Best-first model merging for hidden markov model induction, Tech. Rep. TR-94-003, International Computer Science Institute, 1947 Center St., Suite 600, Berkeley, CA 94704-1198, Jan. 1994.
13. F. Casacuberta, E. Vidal and B. Mas, Learning the structure of hmm's through grammatical inference techniques, in: Proceedings of the International Conference on Acoustic, Speech, and Signal Processing, 1990, pp. 717-720.
14. M. Brand, Structure learning in conditional probability models via an entropic prior and parameter extinction, Neural Computation 11 (1999), 1155-1182.
15. J. Takami and S. Sagayama, A successive state splitting algorithm for efficient allophone modeling, in: Proceedings of the International Conference on Acoustics, Speech, and Signal Processing 1, 1992, pp. 573-576.
16. M. Ostendorf and H. Singer, Hmm topology design using maximum likelihood successive state splitting, Computer Speech and Language 11 (1997), 17-41.
17. Z. Ghahramani and M.J. Beal, Graphical models and variational methods, in: Advanced Mean Field Methods - Theory and Practice, D. Saad and M. Opper, eds, MIT press, 1999.
18. Z. Ghahramani and M.J. Beal, Variational inference for bayesian mixtures of factor analysers, in: Advances in Neural Information Processing Systems, (Vol. 12), S.A. Solla, T.K. Leen and K.R. Muller, eds, MIT press, Cambridge, MA, 1999.
19. H. Attias, A variational bayesian framework for graphical models, in: Advances in Neural Information Processing Systems, T. et al. Leen, ed., MIT press, Cambridge, MA, 2000.
20. S. Chib, Marginal likelihood from the gibbs sampling, Journal of the American Statistical Association (Dec. 1995), 1313-1321.
21. G.F. Cooper and E. Herskovits, A bayesian method for the induction of probabilistic network from data, Machine Learning 9 (1992), 309-347.
22. D. Heckerman, D. Geiger and D.M. Chickering, A tutorial on learning with bayesian networks, Machine Learning 20 (1995), 197-243.
23. R.E. Kass and A.E. Raftery, Bayes factor, Journal of the American Statistical Association (June 1995), 773-795.
24. G. Casella and E.I. George, Explaining the gibbs sampler, The American Statistician 46(3) (Aug. 1992), 167-174.
25. G. Schwarz, Estimating the dimension of a model, Annuals of Statistics 6 (1978), 461-464.
26. P. Cheeseman and J. Stutz, Bayesian classification(autoclass): Theory and results, in: Advances in Knowledge Discovery and Data Mining, (Chapter 6), U.M. Fayyad, G. Piatetsky-Shapiro, P. Smyth and R. Uthurusamy, eds, AAAI-MIT press, 1996, pp. 153-180.
27. J. Rissanen, A universal prior for integers and estimation by minimum description length, Annual of Statistics 11 (1983), 416-431.
28. S. Manganaris, Supervised Classification with Temporal Data, Phd dissertation, Vanderbilt University, Dec. 1997.
29. D.M. Chickering and D. Heckerman, Efficient approximations for the marginal likelihood of bayesian networks with hidden variables, Machine Learning 29 (1997), 181-212.
30. A. Gelman, J.B. Carlin and D.B. Rubin, Bayesian Data Analysis, Chapman & Hall/CRC, Boca Raton, 1995.
31. T. Allen and R. Greiner, Model selection criteria for learning belif nets: An empirical comparison, in: Proceedings of the Seventeenth International Conference on Machine Learning, Pat Langley, ed., 2000.
32. A.N. Jain and B. Chandrasekaran, Dimensionality and sample size considerations in pattern recognition practice, in: Handbook of statistics, P.R. Krishnaiah and L.N. Kanal, eds, North-Holland Publishing Company, Amsterdam, 1982, pp. 835-855.
33. A.K. Jain and D.C. Dubes, Algorithms for clustering data, Prentice Hall, 1988.