Sparse Markov Chains for Sequence Data

作者：Jaaskinen Vaino; Xiong Jie; Corander Jukka^*; Koski Timo

来源：Scandinavian Journal of Statistics, 2014, 41(3): 639-655.

DOI：10.1111/sjos.12053

• Bayesian learning
• data compression
• predictive inference
• Markov chains
• variable order Markov models

Finite memory sources and variable-length Markov chains have recently gained popularity in data compression and mining, in particular, for applications in bioinformatics and language modelling. Here, we consider denser data compression and prediction with a family of sparse Bayesian predictive models for Markov chains in finite state spaces. Our approach lumps transition probabilities into classes composed of invariant probabilities, such that the resulting models need not have a hierarchical structure as in context tree-based approaches. This can lead to a substantially higher rate of data compression, and such non-hierarchical sparse models can be motivated for instance by data dependence structures existing in the bioinformatics context. We describe a Bayesian inference algorithm for learning sparse Markov models through clustering of transition probabilities. Experiments with DNA sequence and protein data show that our approach is competitive in both prediction and classification when compared with several alternative methods on the basis of variable memory length.

• 出版日期2014-9