Selecting hidden Markov model state number with cross-validated likelihood (Q626234): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00180-007-0097-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2058177657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4769776 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Maximization Technique Occurring in the Statistical Analysis of Probabilistic Functions of Markov Chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Choosing starting values for the EM algorithm for getting the highest likelihood in multivariate Gaussian mixture models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal error exponents in hidden markov models order estimation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic models for heterogeneous DNA sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4139463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Baum's forward-backward algorithm revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hidden Markov processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model-Based Clustering, Discriminant Analysis, and Density Estimation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Likelihood ratio inequalities with applications to various mixtures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The likelihood ratio test for the number of components in a mixture with Markov regime / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bayes Factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixture Densities, Maximum Likelihood and the EM Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4861400 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bayesian estimation of hidden Markov chains: A stochastic implementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical Bayesian Density Estimation Using Mixtures of Normals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating the dimension of a model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bayesian Measures of Model Complexity and Fit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Can the strengths of AIC and BIC be shared? A conflict between model indentification and regression estimation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model selection via multifold cross validation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Modified Bayes Information Criterion with Applications to the Analysis of Comparative Genomic Hybridization Data / rank
 
Normal rank

Latest revision as of 19:57, 3 July 2024

scientific article
Language Label Description Also known as
English
Selecting hidden Markov model state number with cross-validated likelihood
scientific article

    Statements

    Selecting hidden Markov model state number with cross-validated likelihood (English)
    0 references
    0 references
    0 references
    22 February 2011
    0 references
    A hidden Markov chain model is considered in which the states chain is stationary and ergodic, and the observations are conditionally independent given the chain realization. The distributions of the observations are known up to unknown parameters which depend on the hidden states. The authors consider the computation of cross-validated likelihood criteria for selection of the number of the hidden chain states. Two algorithms are proposed. In the first one the training and the test subsamples are taken by considering, respectively, the odd and even indices of the original data set. In the second algorithm the elements of the test subsample are chosen at random and considered as missing data in the training subsample. A version of the EM algorithm is used for fitting the model by the training subsample. Numerical results are presented for simulated and biological real life data.
    0 references
    0 references
    EM algorithm
    0 references
    missing at random
    0 references
    maximum likelihood estimation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references