We discuss an interpretation of the Mixture Transition Distribution (MTD) for discrete-valued time series which is based on a sequence of independent latent variables which are occasion-specific. We show that, by assuming that this latent process follows a first order Markov Chain, MTD can be generalized in a sensible way. A class of models results which also includes the Hidden Markov Model (HMM). For these models we out-line an EM algorithm for the maximum likelihood estimation which exploits recursions developed within the HMM literature. Some key words: Backward-forward Recursions; Discrete-valued time series; EM-algorithm; State-space models
A recursive algorithm is proposed for estimation of parameters in mixture models, where the observat...
This thesis deals with computational and theoretical aspects of maximum likelihood estimation for da...
Markov switching models are a family of models that introduces time variation in the parameters in t...
We discuss an interpretation of the mixture transition distribution (MTD) for discrete-valued time s...
The mixture transition distribution (MTD) model was introduced by Raftery (1985) as a parsimonious m...
22 pagesThe Mixture Transition Distribution (MTD) model was introduced by Raftery to face the need f...
Modeling time series that present non-Gaussian features plays as central role in many fields, includ...
We describe an extension of the hidden Markov model in which the manifest process conditionally foll...
For a class of latent Markov models for discrete variables having a longitudinal structure, we intro...
A hidden Markov model (HMM) is a temporal probabilistic model in which the state of the process is d...
We note similarities of the state space reconstruction ("Embedology") practiced in numeric...
In reality many time series are non-linear and non-gaussian. They show the characters like flat stre...
Hidden Markov Models (HMMs) and Linear Dynamical Systems (LDSs) are based on the same assumption: a ...
In the current thesis several selected aspects of the two related latent class models; finite mixtur...
This A lot of machine learning concerns with creating statistical parameterized models of systems ba...
A recursive algorithm is proposed for estimation of parameters in mixture models, where the observat...
This thesis deals with computational and theoretical aspects of maximum likelihood estimation for da...
Markov switching models are a family of models that introduces time variation in the parameters in t...
We discuss an interpretation of the mixture transition distribution (MTD) for discrete-valued time s...
The mixture transition distribution (MTD) model was introduced by Raftery (1985) as a parsimonious m...
22 pagesThe Mixture Transition Distribution (MTD) model was introduced by Raftery to face the need f...
Modeling time series that present non-Gaussian features plays as central role in many fields, includ...
We describe an extension of the hidden Markov model in which the manifest process conditionally foll...
For a class of latent Markov models for discrete variables having a longitudinal structure, we intro...
A hidden Markov model (HMM) is a temporal probabilistic model in which the state of the process is d...
We note similarities of the state space reconstruction ("Embedology") practiced in numeric...
In reality many time series are non-linear and non-gaussian. They show the characters like flat stre...
Hidden Markov Models (HMMs) and Linear Dynamical Systems (LDSs) are based on the same assumption: a ...
In the current thesis several selected aspects of the two related latent class models; finite mixtur...
This A lot of machine learning concerns with creating statistical parameterized models of systems ba...
A recursive algorithm is proposed for estimation of parameters in mixture models, where the observat...
This thesis deals with computational and theoretical aspects of maximum likelihood estimation for da...
Markov switching models are a family of models that introduces time variation in the parameters in t...