.png){kind=icon}
返回
A Hidden Markov Ensemble Algorithm Design for Time Series Analysis
.png){kind=icon}
OA
AI
DOI：10.3390/s22082950.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
With the exponential growth of data, solving classification or regression tasks by mining time series data has become a research hotspot. Commonly used methods include machine learning, artificial neural networks, and so on. However, these methods only extract the continuous or discrete features of sequences, which have the drawbacks of low information utilization, poor robustness, and computational complexity. To solve these problems, this paper innovatively uses Wasserstein distance instead of Kullback-Leibler divergence and uses it to construct an autoencoder to learn discrete features of time series. Then, a hidden Markov model is used to learn the continuous features of the sequence. Finally, stacking is used to ensemble the two models to obtain the final model. This paper experimentally verifies that the ensemble model has lower computational complexity and is close to state-of-the-art classification accuracy.
Keyword:
time series analysis
ensemble learning
Wasserstein distance
hidden Markov model
conditional variance autoencoder
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.5
论文数:
7.2W
被引数:
20.9W
机构
引用论文
Time Series Forecasting and Classification Models Based on Recurrent with Attention Mechanism and Generative Adversarial Networks基于递归注意机制和生成对抗网络的时间序列预测和分类模型.png)
SENSORSOAAI
SENSORSIF3.5
OAAI分享收藏Sulphasomizole (5-p-Aminobenzenesulphonamido-3-Methylisothiazole): A New Antibacterial SulphonamideNature
NatureIF0
PREAI
分享收藏
查看更多内容