Time series classification based on triadic time series motifs
arXiv:1901.00110 · doi:10.1142/S0217979219502370
Abstract
It is of great significance to identify the characteristics of time series to qualify their similarity. We define six types of triadic time-series motifs and investigate the motif occurrence profiles extracted from logistic map, chaotic logistic map, chaotic Henon map, chaotic Ikeda map, hyperchaotic generalized Henon map and hyperchaotic folded-tower map. Based on the similarity of motif profiles, we further propose to estimate the similarity coefficients between different time series and classify these time series with high accuracy. We further apply the motif analysis method to the UCR Time Series Classification Archive and provide evidence of good classification ability for some data sets. Our analysis shows that the proposed triadic time series motif analysis performs better than the classic dynamic time wrapping method in classifying time series for certain data sets investigated in this work.
arXiv comment10 pages, 6 figures
References in corpus (14)
- From time series to complex networks: the visibility graph
- Complex network approaches to nonlinear time series analysis
- The Visibility Graph: a new method for estimating the Hurst exponent of fractional Brownian motion
- Description of stochastic and chaotic series using visibility graphs
- Time lagged ordinal partition networks for capturing dynamics of continuous dynamical systems
- Degree distribution of the visibility graphs mapped from fractional Brownian motions and multifractal random walks
- The permutation entropy rate equals the metric entropy rate for ergodic information sources and ergodic dynamical systems
- Universal and nonuniversal allometric scaling behaviors in the visibility graphs of world stock market indices
- Horizontal visibility graphs transformed from fractional Brownian motions: Topological properties versus Hurst index
- Sequential visibility-graph motifs
- Sequential motif profile of natural visibility graphs
- Permutation complexity of interacting dynamical systems
- Tetradic motif profiles of horizontal visibility graphs
- Analytic degree distributions of horizontal visibility graphs mapped from unrelated random series and multifractal binomial measures