2022
DOI: 10.3390/s22082950
|View full text |Cite
|
Sign up to set email alerts
|

A Hidden Markov Ensemble Algorithm Design for Time Series Analysis

Abstract: With the exponential growth of data vector 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 Ku… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 21 publications
0
3
0
Order By: Relevance
“…As undisturbed soil, the air-dried soil was used for indoor hyperspectral measurement. A 1:5 soil-water ratio extraction solution was prepared from each air-dried soil sample to determine the total salt content of the soil [39][40]. Using the Markov distance method [41][42], samples were analyzed, and 96 valid samples were obtained as research samples after eliminating 2 abnormal samples.…”
Section: Figure 1 Geographical Location Of the Study Areamentioning
confidence: 99%
“…As undisturbed soil, the air-dried soil was used for indoor hyperspectral measurement. A 1:5 soil-water ratio extraction solution was prepared from each air-dried soil sample to determine the total salt content of the soil [39][40]. Using the Markov distance method [41][42], samples were analyzed, and 96 valid samples were obtained as research samples after eliminating 2 abnormal samples.…”
Section: Figure 1 Geographical Location Of the Study Areamentioning
confidence: 99%
“…It is developed on the basis of the Markov chain, which is a discrete memoryless random process responsible for describing the relationship between the sequence of states of the next moment with the current one [83][84][85]. An HMM is an evolution of a Markov chain that requires two stochastic processes, adding a random relationship between the sequence of states and the observation vector, and where the sequence of states cannot be directly observed [83,84,[86][87][88][89]. Then, an HMM is a probabilistic time series model, doubly stochastic, which includes the transition of hidden states and emitting observations [90].…”
Section: Hidden Markov Models (Hmms)mentioning
confidence: 99%
“…While it can be relevant to measure contemporaneous similarities in time series, the distance is not well suited in case of differences in the time dimension [1]. Dynamic Time Warping (DTW) is an algorithm that efficiently determines the nonlinear alignment of two time series that is optimal with respect to a set of criteria [2][3][4][5]. Thereby, the algorithm is not distorted through differences in the time domain, such as leads or lags.…”
Section: Introductionmentioning
confidence: 99%