Inferring Markov chains: Bayesian estimation, model comparison, entropy rate, and out-of-class modeling.
Markov chains are a natural and well understood tool for describing one-dimensional patterns in time or space. We show how to infer kth order Markov chains, for arbitrary k , from finite data by applying Bayesian methods to both parameter estimation and model-order selection. Extending existing results for multinomial models of discrete data, we connect inference to statistical mechanics through information-theoretic (type theory) techniques. We establish a direct relationship between Bayesian evidence and the partition function which allows for straightforward calculation of the expectation and variance of the conditional relative entropy and the source entropy rate. Finally, we introduce a method that uses finite data-size scaling with model-order comparison to infer the structure of out-of-class processes.
Strelioff
Christopher C
CC
Center for Computational Science & Engineering and Physics Department, University of California at Davis, One Shields Avenue, Davis, California 95616, USA. streliof@uiuc.edu
Crutchfield
James P
JP
Hübler
Alfred W
AW
D000465:Algorithms; D001185:Artificial Intelligence; D001499:Bayes Theorem; D003198:Computer Simulation; D019277:Entropy; D008390:Markov Chains; D008954:Models, Biological; D015233:Models, Statistical; D010363:Pattern Recognition, Automated / Q000379:methods*