A minimum description length approach to hidden Markov models with Poisson and Gaussian emissions. Application to order identification
type: Item
instance of: scholarly article
title: A minimum description length approach to hidden Markov models with Poisson and Gaussian emissions. Application to order identification
zbMATH Open document ID: 1284.62534
published in: Journal of Statistical Planning and Inference
publication date: 2009-03-20T00:00:00Z
Mathematics Subject Classification ID: 62M09
Mathematics Subject Classification ID: 62E17
Mathematics Subject Classification ID: 60E15
zbMATH DE Number: 5530760
zbMATH Keywords: BIC
zbMATH Keywords: infinite alphabet
zbMATH Keywords: model selection
zbMATH Keywords: order estimation
author: Antoine Chambaz
author: Aurélien Garivier
author: Elisabeth Gassiat
MaRDI profile type: Publication
full work available at URL: j.jspi.2008.06.010
OpenAlex ID: W1996769950
Wikidata QID: Q99980101
cites work: Asymptotic distribution and local power of the likelihood ratio test for mixtures: bounded and unbounded cases
cites work: Identification of the multiscale fractional Brownian motion with biomechanical applications
cites work: The minimum description length principle in coding and modeling
cites work: Statistical Inference for Probabilistic Functions of Finite State Markov Chains
cites work: A Maximization Technique Occurring in the Statistical Analysis of Probabilistic Functions of Markov Chains
cites work: Inference in hidden Markov models.
cites work: Testing the order of a model
cites work: Bounds for Bayesian order identification with application to mixtures
cites work: Penalized minimum‐distance estimates in finite mixture models
cites work: Information-theoretic asymptotics of Bayes methods
cites work: The consistency of the BIC Markov order estimator.
cites work: Context tree estimation for not necessarily finite memory processes, via BIC and MDL
cites work: The estimation of the order of a mixture model
cites work: Efficient universal noiseless source codes
cites work: Hidden Markov processes
cites work: Consistency of the Unlimited BIC Context Tree Estimator
cites work: Likelihood ratio inequalities with applications to various mixtures
cites work: Optimal error exponents in hidden markov models order estimation
cites work: The likelihood ratio test for the number of components in a mixture with Markov regime
cites work: Model Selection and the Principle of Minimum Description Length
cites work: On estimating the number of constituents of a finite mixture of continuous distributions
cites work: Bayesian Model Selection in Finite Mixtures by Marginal Density Decompositions
cites work: Consistent estimation of mixture complexity.
cites work: Joint parameter estimation and symbol detection for linear or nonlinear unknown channels
cites work: Consistent estimation of the order of mixture models.
cites work: Strongly consistent code-based identification and order estimation for constrained finite-state model classes
cites work: Hidden Markov models for bioinformatics
cites work: Maximum-likelihood estimation for hidden Markov models
cites work: Consistent estimation of a mixing distribution
cites work: An Introduction to the Application of the Theory of Probabilistic Functions of a Markov Process to Automatic Speech Recognition
cites work: Estimating the order of a hidden markov model
cites work: A default Bayesian test for the number of components in a mixture
cites work: Modeling by shortest data description
cites work: Stochastic complexity and modeling
cites work: Estimating the dimension of a model
DOI: 10.1016/J.JSPI.2008.06.010
description: scientific article; zbMATH DE number 5530760