Nonparametric hidden Markov models

Bayesian Time Series Models

Volumn 9780521196765, Issue , 2011, Pages 317-340

  Van Gael, Jurgen ^a   Ghahramani, Zoubin ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BAYESIAN NETWORKS; DYNAMIC PROGRAMMING; INFERENCE ENGINES; MARKOV PROCESSES; NATURAL LANGUAGE PROCESSING SYSTEMS; SPEECH RECOGNITION; TIME SERIES;

BAYESIAN INFERENCE; BAYESIAN METHODS; HIDDEN MARKOV MODELS (HMMS); HIERARCHICAL DIRICHLET PROCESS; INFERENCE ALGORITHM; NON-PARAMETRIC BAYESIAN; NONPARAMETRIC BAYESIAN MODELS; TIME SERIES MODELS;

HIDDEN MARKOV MODELS;

EID: 84861834504     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1017/CBO9780511984679.016     Document Type: Chapter

References (38)

1. H. Akaike. A new look at the statistical model identification. IEEE Transactions on Automatic Control, 19(6):716-723, 1974.
2. L. E. Baum, T. Petrie, G. Soules and N. Weiss. A maximization technique occurring in the statistical analysis of probabilistic functions of Markov chains. Annals of Mathematical Statistics, 41 (1):164-171, 1970.
3. M. J. Beal. Variational algorithms for approximate Bayesian inference. PhD thesis, University of London, 2003.
4. M. J. Beal, Z. Ghahramani and C. E. Rasmussen. The infinite hidden Markov model. In Advances in Neural Information Processing Systems, pages 577-584, 2002.
5. Y. Bengio and P. Frasconi. An input output HMM architecture. In Advances in Neural Information Processing Systems, pages 427-434, 1995.
6. S. Chiappa. A Bayesian approach to switching linear Gaussian state-space models for unsupervised time-series segmentation. In Proceedings ofthe International Conference on Machine Learning and Applications, pages 3-9, 2008.
7. A. P Dempster, N. M Laird and D. B Rubin. Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society. Series B (Methodological), 39(1):1-38, 1977.
8. L. E. Baum and T. Petrie. Statistical inference for probabilistic functions of finite state Markov chains. Annals ofMathematical Statistics, 37(6):1554-1563, 1966.
9. E. B. Fox, E. B. Sudderth, M. I. Jordan and A. S. Willsky. Nonparametric Bayesian learning of switching linear dynamical systems. In Advances in Neural Information Processing Systems, pages 457-464, 2009.
10. E. B. Fox, E. B. Sudderth, M. I. Jordan and A. S. Willsky. An HDP-HMM for systems with state persistence. In Proceedings ofthe International Conference on Machine learning, volume 25, Helsinki, 2008.
11. S. Fruhwirth-Schnatter. Estimating marginal likelihoods for mixture and Markov switching models using bridge sampling techniques. Econometrics Journal, 7(1):143-167, 2004.
12. J. Gao and Johnson. M. A comparison of Bayesian estimators for unsupervised hidden Markov model POS taggers. In Proceedings of the 2008 Conference on Empirical Methods in atural Language Processing, pages 344-352, 2008.
13. Z. Ghahramani and G. E. Hinton. Variational learning for switching state-space models.Neural Computation, 12(4):831-864, 2000.
14. S. Goldwater and T. Griffiths. A fully Bayesian approach to unsupervised part-of-speech tagging. In Proceedings ofthe Association for Computational Linguistics, volume 45, page 744, 2007.
15. S. Goldwater, T. Griffiths and M. Johnson. Interpolating between types and tokens by stimating power-law generators. In Advances in Neural Information Processing Systems, pages 459-466, 2006.
16. P. J. Green. Reversible jump Markov chain Monte Carlo computation and Bayesian model determination. Biometrika, 82(4):711-732, 1995.
17. N. Hjort, C. Holmes, P. Muller and S. Walker, editors. Bayesian Nonparametrics. Cambridge University Press, 2010.
18. M. Johnson. Why doesnt EM find good HMM POS-taggers. In Proceedings of the Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning, pages 296-305, 2007.
19. D. Jurafsky and J. H. Martin. Speech and Language Processing. Pearson Prentice Hall,2008.
20. D. J. C. MacKay. Ensemble learning for hidden Markov models. Technical report, Cavendish Laboratory, University of Cambridge, 1997.
21. C. D. Manning and H. Schütze. Foundations of Statistical Natural Language Processing. MIT Press.
22. M. P. Marcus, M. A. Marcinkiewicz and B. Santorini. Building a large annotated corpus of English: the Penn Treebank. Computational Linguistics, 19(2):313-330, June 1993.
23. R. M. Neal. Annealed importance sampling. Statistics and Computing, 11:125-139, 1998.
24. R. M. Neal. Markov chain sampling methods for Dirichlet process mixture models. Journal of Computational and Graphical Statistics, 9(2):249-265, 2000.
25. J. Pitman. Combinatorial stochastic processes, volume 1875 of Lecture Notes in Mathematics. Springer-Verlag, 2006.
26. L. R. Rabiner. A tutorial on hidden Markov models and selected applications in speech recognition. Proceedings of the IEEE, 77(2):257-286, 1989.
27. C. P. Robert, T. Ryden and D. M. Titterington. Bayesian inference in hidden Markov models through the reversible jump Markov chain Monte Carlo method. Journal of the Royal Statistical Society. Series B, Statistical Methodology, pages 57-75, 2000.
28. G. Schwarz. Estimating the dimension of a model. Annals of Statistics, 6(2):461-464, 1978.
29. S. L. Scott. Bayesian methods for hidden Markov models: Recursive computing in the 21st century. Journal ofthe American Statistical Association, 97(457):337-351, 2002.
30. J. Sethuraman. A constructive definition of Dirichlet priors. Statistica Sinica, 4:639-650, 1994.
31. T. Stepleton, Z. Ghahramani, G. Gordon and T-S. Lee. The block diagonal infinite hidden Markov model. In Proceedings of the International Conference on Artificial Intelligence and Statistics, pages 552-559, 2009.
32. A. Stolcke and S. Omohundro. Hidden Markov model induction by Bayesian model merging. Advances in Neural Information Processing Systems, 5: pages 11-18, 1993.
33. Y. W. Teh. A hierarchical Bayesian language model based on Pitman-Yor processes. In Proceedings of the 21st International Conference on Computational Linguistics and 44th Annual Meeting of the Association for Computational Linguistics, pages 985-992, 2006.
34. Y. W. Teh. Dirichlet processes. Encyclopedia of Machine Learning, to appear.
35. Y. W. Teh, M. I. Jordan, M. J. Beal and D. M. Blei. Hierarchical Dirichlet processes. Journal of the American Statistical Association, 101(476):1566-1581, 2006.
36. J. Van Gael, Y. Saatci, Y. W. Teh Z. Ghahramani. Beam sampling for the infinite hidden Markov model. In Proceedings ofthe International Conference on Machine Learning, pages 1088-1095,2008.
37. J. Van Gael, A. Vlachos and Z. Ghahramani. The infinite HMM for unsupervised POS tagging. In Proceedings ofthe Conference on Empirical Methods in Natural Language Processing, pages 678-687, 2009.
38. S. G. Walker. Sampling the Dirichlet mixture model with slices. Communications in Statistics-Simulation and Computation, 36(1):45, 2007.