Bayesian Structural Inference for Hidden Processes

We introduce a Bayesian approach to discovering patterns in structurally complex processes. The proposed method of Bayesian structural inference (BSI) relies on a set of candidate unifilar hidden Markov model (uHMM) topologies for inference of process structure from a data series. We employ a recently developed exact enumeration of topological ε-machines. (A sequel then removes the topological restriction.) This subset of the uHMM topologies has the added benefit that inferred models are guaranteed to be ε-machines, irrespective of estimated transition probabilities. Properties of ε-machines and uHMMs allow for the derivation of analytic expressions for estimating transition probabilities, inferring start states, and comparing the posterior probability of candidate model topologies, despite process internal structure being only indirectly present in data. We demonstrate BSI's effectiveness in estimating a process's randomness, as reflected by the Shannon entropy rate, and its structure, as quantified by the statistical complexity. We also compare using the posterior distribution over candidate models and the single, maximum a posteriori model for point estimation and show that the former more accurately reflects uncertainty in estimated values. We apply BSI to in-class examples of finite- and infinite-order Markov processes, as well to an out-of-class, infinite-state hidden process.

[1]  Adrián López García de Lomana,et al.  Topological augmentation to infer hidden processes in biological systems , 2013, Bioinform..

[2]  John K Kruschke,et al.  Bayesian data analysis. , 2010, Wiley interdisciplinary reviews. Cognitive science.

[3]  E L Ionides,et al.  Inference for nonlinear dynamical systems , 2006, Proceedings of the National Academy of Sciences.

[4]  James P. Crutchfield,et al.  Enumerating Finitary Processes , 2010, ArXiv.

[5]  Christopher C. Strelioff,et al.  Optimal instruments and models for noisy chaos. , 2007, Chaos.

[6]  James P. Crutchfield,et al.  Equations of Motion from a Data Series , 1987, Complex Syst..

[7]  Matthew B Kennel,et al.  Estimating good discrete partitions from observed data: symbolic false nearest neighbors. , 2003, Physical review letters.

[8]  Sanjeev Galande,et al.  One size does not fit all: On how Markov model order dictates performance of genomic sequence analyses , 2012, Nucleic acids research.

[9]  Pauline Ziman,et al.  Pictish symbols revealed as a written language through application of Shannon entropy , 2010, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[10]  Young,et al.  Inferring statistical complexity. , 1989, Physical review letters.

[11]  H. K. Kesavan,et al.  Bayesian estimation of shannon entropy , 1997 .

[12]  J. Crutchfield Between order and chaos , 2011, Nature Physics.

[13]  J. Kemeny,et al.  Denumerable Markov chains , 1969 .

[14]  Lai,et al.  Estimating generating partitions of chaotic systems by unstable periodic orbits , 2000, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[15]  Robert Haslinger,et al.  The Computational Structure of Spike Trains , 2009, Neural Computation.

[16]  Colin de la Higuera,et al.  A bibliographical study of grammatical inference , 2005, Pattern Recognit..

[17]  G. Z. Sun,et al.  Grammatical Inference , 1998, Lecture Notes in Computer Science.

[18]  C. Finney,et al.  A review of symbolic analysis of experimental data , 2003 .

[19]  Rajesh P N Rao,et al.  A Markov model of the Indus script , 2009, Proceedings of the National Academy of Sciences.

[20]  J P Crutchfield,et al.  Inferring planar disorder in close-packed structures via epsilon-machine spectral reconstruction theory: structure and intrinsic computation in zinc sulfide. , 2007, Acta crystallographica. Section B, Structural science.

[21]  James P. Crutchfield,et al.  Equivalence of History and Generator-Machines , 2012 .

[22]  Mark K Transtrum,et al.  Why are nonlinear fits to data so challenging? , 2009, Physical review letters.

[23]  James P. Crutchfield,et al.  Computational Mechanics: Pattern and Prediction, Structure and Simplicity , 1999, ArXiv.

[24]  D. Lathrop Nonlinear Dynamics and Chaos: With Applications to Physics, Biology, Chemistry, and Engineering , 2015 .

[25]  J. D. Saddy,et al.  Symbolic dynamics of event-related brain potentials. , 2000, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[26]  Mw Hirsch,et al.  Chaos In Dynamical Systems , 2016 .

[27]  Lawrence R. Rabiner,et al.  A tutorial on hidden Markov models and selected applications in speech recognition , 1989, Proc. IEEE.

[28]  Chun-Biu Li,et al.  Multiscale complex network of protein conformational fluctuations in single-molecule time series , 2008, Proceedings of the National Academy of Sciences.

[29]  Byung-Jun Yoon,et al.  Hidden Markov Models and their Applications in Biological Sequence Analysis , 2009, Current genomics.

[30]  James P. Crutchfield,et al.  Asymptotic Synchronization for Finite-State Sources , 2010, ArXiv.

[31]  Douglas Lind,et al.  An Introduction to Symbolic Dynamics and Coding , 1995 .

[32]  David R. Wolf,et al.  Estimating functions of probability distributions from a finite set of samples. , 1994, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[33]  Kristina Lisa Shalizi,et al.  Pattern Discovery in Time Series, Part I: Theory, Algorithm, Analysis, and Convergence , 2002 .

[34]  James P. Crutchfield,et al.  Exact Synchronization for Finite-State Sources , 2010, ArXiv.

[35]  Zoubin Ghahramani,et al.  An Introduction to Hidden Markov Models and Bayesian Networks , 2001, Int. J. Pattern Recognit. Artif. Intell..

[36]  Christopher R. Myers,et al.  Universally Sloppy Parameter Sensitivities in Systems Biology Models , 2007, PLoS Comput. Biol..

[37]  J P Crutchfield,et al.  ε-Machine spectral reconstruction theory: a direct method for inferring planar disorder and structure from X-ray diffraction studies. , 2013, Acta crystallographica. Section A, Foundations of crystallography.

[38]  James P. Crutchfield,et al.  Prediction, Retrodiction, and the Amount of Information Stored in the Present , 2009, ArXiv.

[39]  Barak A. Pearlmutter,et al.  Results of the Abbadingo One DFA Learning Competition and a New Evidence-Driven State Merging Algorithm , 1998, ICGI.

[40]  Christopher C. Strelioff,et al.  Inferring Markov chains: Bayesian estimation, model comparison, entropy rate, and out-of-class modeling. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[41]  J. Crutchfield,et al.  Discovering planar disorder in close-packed structures from x-ray diffraction: Beyond the fault model , 2002, cond-mat/0203290.

[42]  J. Crutchfield The calculi of emergence: computation, dynamics and induction , 1994 .

[43]  W. Marsden I and J , 2012 .

[44]  R. F.,et al.  Mathematical Statistics , 1944, Nature.

[45]  Robert Haslinger,et al.  Quantifying self-organization with optimal predictors. , 2004, Physical review letters.

[46]  Karoline Wiesner,et al.  A New Method for Inferring Hidden Markov Models from Noisy Time Sequences , 2012, PloS one.

[47]  Michael P. H. Stumpf,et al.  Simulation-based model selection for dynamical systems in systems and population biology , 2009, Bioinform..