2011
DOI: 10.1007/s10182-011-0160-7
|View full text |Cite
|
Sign up to set email alerts
|

Testing lumpability for marginal discrete hidden Markov models

Abstract: Markov chains, Multinomial hidden Markov models, Conditional independence, Identifiability, EM algorithm,

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2013
2013
2015
2015

Publication Types

Select...
3

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(5 citation statements)
references
References 16 publications
0
5
0
Order By: Relevance
“…This theorem is a special case of the results presented in Colombi and Giordano (2011) where the statement (1) is proved to ensure that the marginal process E T of the latent component E U is still a Markov chain. Condition (2) states that observable variables F R (t) at time t depend only on the latent variables E T (t).…”
Section: Multiple Hidden Markov Modelsmentioning
confidence: 89%
See 2 more Smart Citations
“…This theorem is a special case of the results presented in Colombi and Giordano (2011) where the statement (1) is proved to ensure that the marginal process E T of the latent component E U is still a Markov chain. Condition (2) states that observable variables F R (t) at time t depend only on the latent variables E T (t).…”
Section: Multiple Hidden Markov Modelsmentioning
confidence: 89%
“…In this section, we fit different MHMMs on two data sets. The EM algorithm used for estimating the models is described in Colombi and Giordano, 2011, and implemented in the R-package hmmm by The data set of a soft-drink company (Ching et al, 2002, available also in the Rpackage hmmm) consists of a one-year time series of daily sales of soft-drinks: lemon tea, orange juice and apple juice, all with categories: low, medium, high level. Changes in sale outcomes over time can depend on time-varying unobservable factors and we consider an MHMM with two dichotomous latent variables to model these data.…”
Section: Examplesmentioning
confidence: 99%
See 1 more Smart Citation
“…In addition to this, the package can fit hidden Markov models where the conditional distribution of several observable variables and the transition probabilities of the latent chain can be specified by HMM models, see Colombi and Giordano (2011). The hidden.emfit() function computes the ML estimates of the parameters via an EM algorithm, but the current version of the package does not provide standard errors.…”
Section: Discussionmentioning
confidence: 99%
“…Such systems are classified as lumpable [1]. The lumpability criterion (strong, weak or nearly) of Markov chains is an active field of research [2][3][4][5]. If a system is found to be lumpable and the states are joined together following this criterion, then the course-grained system continues to have the same measurable properties as the original system.…”
Section: Introductionmentioning
confidence: 99%