Context-specific kernel-based hidden Markov model for time series analysis
Traditional hidden Markov models have been a useful tool to understand and model stochastic dynamic data; in the case of non-Gaussian data, models such as mixture of Gaussian hidden Markov models can be used. However, these suffer from the computation of precision matrices and have a lot of unnecessary parameters. As a consequence, such models often perform better when it is assumed that all variables are independent, a hypothesis that may be unrealistic. Hidden Markov models based on kernel density estimation are also capable of modeling non-Gaussian data, but they assume independence between variables. In this article, we introduce a new hidden Markov model based on kernel density estimation, which is capable of capturing kernel dependencies using context-specific Bayesian networks. The proposed model is described, together with a learning algorithm based on the expectation-maximization algorithm. Additionally, the model is compared to related HMMs on synthetic and real data. From the results, the benefits in likelihood and classification accuracy from the proposed model are quantified and analyzed.
Code (1)
Tasks
Density EstimationTime SeriesTime Series AnalysisMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Kernel Density Estimation-Based Markov Models with Hidden State
We consider Markov models of stochastic processes where the next-step conditional distribution is defined by a kernel density estimator (KDE), similar to Markov forecast densities and certain time-series bootstrap scheme…
Density EstimationTime Series AnalysisScalable Hybrid Hidden Markov Model with Gaussian Process Emission for Sequential Time-series Observations
A hidden Markov model (HMM) using Gaussian Process as an emission model has been widely used to model sequential data in complex form. This study particularly introduces the hybrid Bayesian HMM with GP emission using SM …
Time SeriesTime Series AnalysisVariational InferenceData-Driven Quickest Change Detection in (Hidden) Markov Models
The paper investigates the problems of quickest change detection in Markov models and hidden Markov models (HMMs). Sequential observations are taken from a (hidden) Markov model. At some unknown time, an event occurs in …
Change DetectionFault DetectionShort-Term Wind-Speed Forecasting Using Kernel Spectral Hidden Markov Models
In machine learning, a nonparametric forecasting algorithm for time series data has been proposed, called the kernel spectral hidden Markov model (KSHMM). In this paper, we propose a technique for short-term wind-speed p…
BIG-bench Machine LearningTime SeriesTime Series AnalysisUniversal Approximation of Markov Kernels by Shallow Stochastic Feedforward Networks
We establish upper bounds for the minimal number of hidden units for which a binary stochastic feedforward network with sigmoid activation probabilities and a single hidden layer is a universal approximator of Markov ker…