Pages that link to "Item:Q3546742"

The following pages link to Context tree estimation for not necessarily finite memory processes, via BIC and MDL (Q3546742):

Displaying 30 items.

• A model selection approach for multiple sequence segmentation and dimensionality reduction (Q143696) (← links)
• Divergence rates of Markov order estimators and their application to statistical estimation of stationary ergodic processes (Q358133) (← links)
• Neighborhood radius estimation for variable-neighborhood random fields (Q554466) (← links)
• On the minimal penalty for Markov order estimation (Q718903) (← links)
• Context tree selection: a unifying view (Q719769) (← links)
• Comparison of contraction coefficients for \(f\)-divergences (Q784380) (← links)
• Nonparametric statistical inference for the context tree of a stationary ergodic process (Q887255) (← links)
• Some upper bounds for the rate of convergence of penalized likelihood context tree estimators (Q985992) (← links)
• A minimum description length approach to hidden Markov models with Poisson and Gaussian emissions. Application to order identification (Q1007478) (← links)
• On universal algorithms for classifying and predicting stationary processes (Q2039763) (← links)
• Variable length memory chains: characterization of stationary probability measures (Q2040105) (← links)
• Optimal upper bounds for the divergence of finite-dimensional distributions under a given variational distance (Q2190900) (← links)
• Testing statistical hypothesis on random trees and applications to the protein classification problem (Q2270660) (← links)
• Space-efficient representation of truncated suffix trees, with applications to Markov order estimation (Q2354764) (← links)
• Context tree selection and linguistic rhythm retrieval from written texts (Q2428742) (← links)
• Consistent estimation of the basic neighborhood of Markov random fields (Q2493548) (← links)
• Pattern identification and characterization reveal permutations of organs as a key genetically controlled property of post-meristematic phyllotaxis (Q2632219) (← links)
• Detecting renewal states in chains of variable length via intrinsic Bayes factors (Q2680304) (← links)
• Estimate of the Interaction Neighborhood Radius for a Markov Random Field (Q2811898) (← links)
• Robust Model Selection for Stochastic Processes (Q2876227) (← links)
• Sparse Markov Chains for Sequence Data (Q2922158) (← links)
• The Computational Structure of Spike Trains (Q3562862) (← links)
• A BIC‐based consistent metric between Markovian processes (Q4627105) (← links)
• Joint Estimation of Intersecting Context Tree Models (Q4923058) (← links)
• Perfect simulation of processes with long memory: A “coupling into and from the past” algorithm (Q4982617) (← links)
• A copula-based partition Markov procedure (Q5160264) (← links)
• Exponential inequalities for VLMC empirical trees (Q5190283) (← links)
• Number of hidden states and memory: a joint order estimation problem for Markov chains with Markov regime (Q5851010) (← links)
• (Q5870415) (← links)
• Sharp oracle inequalities and slope heuristic for specification probabilities estimation in discrete random fields (Q5963503) (← links)