Authors: Galyna Kriukova
Hidden Markov models are a well-known probabilistic graphical model for time series of discrete, partially observable stochastic processes. We consider the method to extend the application of hidden Markov models to non-Gaussian continuous distributions by embedding a priori probability distribution of the state space into reproducing kernel Hilbert space. Corresponding regularization techniques are proposed to reduce the tendency to overfitting and computational complexity of the algorithm, i.e. Nystr¨om subsampling and the general regularization family for inversion of feature and kernel matrices. This method may be applied to various statistical inference and learning problems, including classification, prediction, identification, segmentation, and as an online algorithm it may be used for dynamic data mining and data stream mining. We investigate, both theoretically and empirically, the regularization and approximation bounds of the discrete regularization method. Furthermore, we discuss applications of the method to real-world problems, comparing the approach to several state-of-the-art algorithms.
Comments: 6 Pages. Mohyla Mathematical Journal, Vol 1 (2018) http://mmj.ukma.edu.ua/article/view/152601
[v1] 2019-06-27 03:36:56
Unique-IP document downloads: 29 times
Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.