Bayesian variable order Markov models

Journal of Machine Learning Research

Volumn 9, Issue , 2010, Pages 161-168

  Dimitrakakis, Christos ^a  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

BAYESIAN ESTIMATIONS; CONTEXT TREE WEIGHTING; GENERALISATION; PREDICTIVE MODELS; RECURSIONS; VARIABLE ORDER MARKOV MODELS;

ARTIFICIAL INTELLIGENCE; BAYESIAN NETWORKS; FORESTRY;

MARKOV PROCESSES;

ARTIFICIAL INTELLIGENCE; FORESTRY; MATHEMATICAL MODELS; RANDOM PROCESSES;

EID: 84862287199     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (17)

1. Matthew J. Beal, Zoubin Ghahramani, and Carl Edward Rasmussen. The infinite hidden Markov model. In Thomas G. Dietterich, Suzanna Becker, and Zoubin Ghahramani, editors, NIPS, pages 577-584. MIT Press, 2001.
2. Ron Begleiter, Ran El-Yaniv, and Golan Yona. On prediction using variable order Markov models. Journal of Artificial Intelligence Research, pages 385-421, 2004.
3. Peter Bühlmann and Abraham J. Wyner. Variable length Markov chains. The Annals of Statistics, 27 (2):480-513, 1999.
4. Nicolò Cesa-Bianchi and Gábor Lugosi. Prediction, Learning and Games. Cambridge University press, Cambridge, UK, 2006.
5. J. Cleary and I. Witten. Data compression using adaptive coding and partial string matching. IEEE Transactions on Communications, 32(4):394-402, 1984.
6. Christos Dimitrakakis. Variable order Markov decision processes: Exact Bayesian inference with an application to POMDPs. Submitted, 2010.
7. Christos Dimitrakakis. Bayesian variable order Markov models: Towards bayesian predictive state representations. Technical Report IAS-UVA-09-04, University of Amsterdam, June 2009.
8. Arnaud Doucet, Nando de Freitas, and Neil Gordon, editors. Sequential Monte Carlo Methods in Practice. Springer, 2001.
9. Thomas S. Ferguson. Prior distributions on spaces of probability measures. The Annals of Statistics, 2(4): 615-629, 1974. ISSN 00905364.
10. N. Friedman and D. Koller. Being Bayesian about network structure. A Bayesian approach to structure discovery in Bayesian networks. Machine Learning, 50(1):95-125, 2003.
11. J. Gasthaus, F. Wood, and Y. W. Teh. Lossless compression based on the sequence memoizer. In Data Compression Conference, 2010.
12. M. Meila and M.I. Jordan. Learning with mixtures of trees. The Journal of Machine Learning Research, 1:1-48, 2001.
13. Ramsés H. Mena and Stephen G. Walker. Stationary autoregressive models via a bayesian nonparametric approach. Journal of Time Series Analysis, 26(6): 789-805, 2005.
14. D. Mochihashi and E. Sumita. The infinite Markov model. In Advances in Neural Information Processing Systems, pages 1017-1024. MIT Press, 2008.
15. Stephane Ross, Brahim Chaib-draa, and Joelle Pineau. Bayes-adaptive POMDPs. In J.C. Platt, D. Koller, Y. Singer, and S. Roweis, editors, Advances in Neural Information Processing Systems 20, Cambridge, MA, 2008. MIT Press.
16. F.M.J. Willems, Y.M. Shtarkov, and T.J. Tjalkens. The context tree weighting method: basic properties. IEEE Transactions on Information Theory, 41 (3):653-664, 1995.
17. F. Wood, C. Archambeau, J. Gasthaus, L. James, and Y.W. Teh. A stochastic memoizer for sequence data. In Proceedings of the 26th Annual International Conference on Machine Learning. ACM New York, NY, USA, 2009.