### Abstract

An approximation formula for the predictive Bayes code for the FSMX models, subspaces of Markov models, is presented. It is empirically shown that the code using the approximation formula along with the Jeffreys prior (Clark et al, 1994) gives shorter code length than the one using the Laplace estimator for the first order Markov models. It is also shown that there is difficulty in introducing the formula to CONTEXT or CTW methods.

Original language | English |
---|---|

Number of pages | 1 |

Publication status | Published - Jan 1 1995 |

Externally published | Yes |

Event | Proceedings of the 1995 IEEE International Symposium on Information Theory - Whistler, BC, Can Duration: Sep 17 1995 → Sep 22 1995 |

### Other

Other | Proceedings of the 1995 IEEE International Symposium on Information Theory |
---|---|

City | Whistler, BC, Can |

Period | 9/17/95 → 9/22/95 |

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Information Systems
- Modelling and Simulation
- Applied Mathematics

## Fingerprint Dive into the research topics of 'Approximation of Bayes code for Markov sources'. Together they form a unique fingerprint.

## Cite this

Takeuchi, J. I., & Kawabata, T. (1995).

*Approximation of Bayes code for Markov sources*. Paper presented at Proceedings of the 1995 IEEE International Symposium on Information Theory, Whistler, BC, Can, .