Context tree estimation for not necessarily finite memory processes, via BIC and MDL
From MaRDI portal
Publication:3546742
DOI10.1109/TIT.2005.864431zbMath1284.94027OpenAlexW2103396489WikidataQ98839712 ScholiaQ98839712MaRDI QIDQ3546742
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2005.864431
Related Items
Pattern identification and characterization reveal permutations of organs as a key genetically controlled property of post-meristematic phyllotaxis, Sparse Markov Chains for Sequence Data, Divergence rates of Markov order estimators and their application to statistical estimation of stationary ergodic processes, Nonparametric statistical inference for the context tree of a stationary ergodic process, Optimal upper bounds for the divergence of finite-dimensional distributions under a given variational distance, Detecting renewal states in chains of variable length via intrinsic Bayes factors, Unnamed Item, Context tree selection and linguistic rhythm retrieval from written texts, A BIC‐based consistent metric between Markovian processes, The Computational Structure of Spike Trains, A copula-based partition Markov procedure, Joint Estimation of Intersecting Context Tree Models, Neighborhood radius estimation for variable-neighborhood random fields, Consistent estimation of the basic neighborhood of Markov random fields, Testing statistical hypothesis on random trees and applications to the protein classification problem, Exponential inequalities for VLMC empirical trees, Some upper bounds for the rate of convergence of penalized likelihood context tree estimators, On the minimal penalty for Markov order estimation, Context tree selection: a unifying view, Sharp oracle inequalities and slope heuristic for specification probabilities estimation in discrete random fields, On universal algorithms for classifying and predicting stationary processes, Variable length memory chains: characterization of stationary probability measures, A model selection approach for multiple sequence segmentation and dimensionality reduction, A minimum description length approach to hidden Markov models with Poisson and Gaussian emissions. Application to order identification, Estimate of the Interaction Neighborhood Radius for a Markov Random Field, Perfect simulation of processes with long memory: A “coupling into and from the past” algorithm, Comparison of contraction coefficients for \(f\)-divergences, Number of hidden states and memory: a joint order estimation problem for Markov chains with Markov regime, Robust Model Selection for Stochastic Processes, Space-efficient representation of truncated suffix trees, with applications to Markov order estimation
