Inhomogeneous Parsimonious Markov Models

Abstract

We introduce inhomogeneous parsimonious Markov models for modeling statistical patterns in discrete sequences. These models are based on parsimonious context trees, which are a generalization of context trees, and thus generalize variable order Markov models. We follow a Bayesian approach, consisting of structure and parameter learning. Structure learning is a challenging problem due to an overexponential number of possible tree structures, so we describe an exact and efficient dynamic programming algorithm for finding the optimal tree structures. We apply model and learning algorithm to the problem of modeling binding sites of the human transcription factor C/EBP, and find an increased prediction performance compared to fixed order and variable order Markov models. We investigate the reason for this improvement and find several instances of context-specific dependences that can be captured by parsimonious context trees but not by traditional context trees.

DOI: 10.1007/978-3-642-40988-2_21

Extracted Key Phrases

7 Figures and Tables

Cite this paper

@inproceedings{Eggeling2013InhomogeneousPM, title={Inhomogeneous Parsimonious Markov Models}, author={Ralf Eggeling and Andr{\'e} Gohr and Pierre-Yves Bourguignon and Edgar Wingender and Ivo Grosse}, booktitle={ECML/PKDD}, year={2013} }