The PDF file you selected should load here if your Web browser has a PDF reader plug-in installed (for example, a recent version of Adobe Acrobat Reader).

Alternatively, you can also download the PDF file directly to your computer, from where it can be opened using a PDF reader. To download the PDF, click the Download link below.

If you would like more information about how to print, save, and work with PDFs, Highwire Press provides a helpful Frequently Asked Questions about PDFs.

Download this PDF file Fullscreen Fullscreen Off

References

  1. Bühlmann, Peter; Wyner, Abraham J. Variable length Markov chains. Ann. Statist. 27 (1999), no. 2, 480--513. MR1714720 (2000j:62123)
  2. Csiszár, Imre; Talata, Zsolt. Context tree estimation for not necessarily finite memory processes, via BIC and MDL. IEEE Trans. Inform. Theory 52 (2006), no. 3, 1007--1016. MR2238067 (2007a:94052)
  3. Dedecker, Jérôme; Doukhan, Paul. A new covariance inequality and applications. Stochastic Process. Appl. 106 (2003), no. 1, 63--80. MR1983043 (2004c:60111)
  4. Dedecker, Jérôme; Prieur, Clémentine. New dependence coefficients. Examples and applications to statistics. Probab. Theory Related Fields 132 (2005), no. 2, 203--236. MR2199291 (2007b:62081)
  5. Duarte, Denise; Galves, Antonio; Garcia, Nancy L. Markov approximation and consistent estimation of unbounded probabilistic suffix trees. Bull. Braz. Math. Soc. (N.S.) 37 (2006), no. 4, 581--592. MR2284889 (2008b:60185)
  6. Fernández, Roberto; Ferrari, Pablo; Galves, Antonio. Coupling, renewal and perfect simulation of chains of infinite order, 2001. Notes for a minicourse at the Vth Brazilian School of Probability.
  7. Ferrari, Fiorenzo; Wyner, Abraham. Estimation of general stationary processes by variable length Markov chains. Scand. J. Statist. 30 (2003), no. 3, 459--480. MR2002222 (2004f:62092)
  8. Galves, Antonio; Leonardi, Florencia. Exponential inequalities for empirical unbounded context trees. Progress in Probability 60 (2008), 257--270.
  9. Galves, Antonio; Löcherbach, Eva. Stochastic chains with memory of variable length. TICSP Series 38 (2008), 117--133.
  10. Galves, Antonio; Maume-Deschamps, Véronique; Schmitt, Bernard. Exponential inequalities for VLMC empirical trees. ESAIM Probab. Stat. 12 (2008), 219--229. MR2374639
  11. Rissanen, Jorma. A universal data compression system. IEEE Trans. Inform. Theory 29 (1983), no. 5, 656--664. MR0730903 (84m:94017)
  12. Ron, Dana ; Singer, Yoram ; Tishby, Naftali. The power of amnesia: Learning probabilistic automata with variable memory length. Machine Learning 25 (1996), 117--149.
  13. Willems, Frans ; Shtarkov, Yuri ; Tjalkens, Tjalling. The context-tree weighting method: basic properties. IEEE Trans. Inform. Theory IT-44 (1995), 653--664.
Bookmark and Share


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.