Next Article in Journal
Utility–Privacy Trade-Off in Distributed Machine Learning Systems
Next Article in Special Issue
Stock Index Spot–Futures Arbitrage Prediction Using Machine Learning Models
Previous Article in Journal
Detecting Tripartite Steering via Quantum Entanglement
Previous Article in Special Issue
Efficiency of the Moscow Stock Exchange before 2022
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A New Method for Determining the Embedding Dimension of Financial Time Series Based on Manhattan Distance and Recurrence Quantification Analysis

School of Science, Beijing Information Science and Technology University, Beijing 100101, China
*
Author to whom correspondence should be addressed.
Entropy 2022, 24(9), 1298; https://doi.org/10.3390/e24091298
Submission received: 18 July 2022 / Revised: 9 September 2022 / Accepted: 11 September 2022 / Published: 14 September 2022
(This article belongs to the Special Issue Applications of Statistical Physics in Finance and Economics)

Abstract

:
Identification of embedding dimension is helpful to the reconstruction of phase space. However, it is difficult to calculate the proper embedding dimension for the financial time series of dynamics. By this Letter, we suggest a new method based on Manhattan distance and recurrence quantification analysis for determining the embedding dimension. By the advantages of the above two tools, the new method can calculate the proper embedding dimension with the feature of stability, accuracy and rigor. Besides, it also has a good performance on the chaotic time series which has a high-dimensional attractors.

1. Introduction

According to the Takens theory [1], a one-dimensional financial time series must have a suitable time delay [2] and embedding dimension [3,4,5,6]. The phase space reconstruction, which is proposed firstly by Takens, can demonstrate the inherent dynamic characteristics of the time series by selecting the appropriate time delay and embedding dimension. Therefore, phase space reconstruction is an important method for analyzing time series [7,8,9], and it has been widely used in various aspects of society such as chemistry, transportation and geology [10,11,12,13,14].
However, determining the time delay and embedding dimension is a necessary step for phase space reconstruction. At present, the time delay is often determined by the method of average mutual information with high accuracy and good applicability [15], while the embedding dimension was originally solved by the method of false-nearest neighbor (FNN) [16]. However, the method contains subjective parameters and depends strongly on the numbers of data points. Therefore, later, Cao made improvements in the principle of the algorithm [17]. Although Cao’s method makes up for the shortcomings of FNN, it is still not good enough in terms of the stability and accuracy of solving the embedding dimension. In addition, it cannot handle financial chaotic time series with high-dimensional attractors well.
At the same time, the recurrence plot [18,19,20] and its recurrence quantification analysis (RQA) [21,22,23], which are related to the embedding dimension, have been successfully applied in analyzing the dynamic characteristics of complex systems, and have been applied to other fields such as economics and sociology [24,25,26,27,28]. What is more, the measures of RQA have been proven to be correlated with the embedding dimension by Zbilut [29]. However, due to the imperfect calculation method of time delay and other parameters, Zbilut only found a qualitative connection, but did not accurately calculate the quantitative relationship between the RQA and embedding dimension. Thus, after verifying its correctness through numerical experiments, we take it as a measure that can help to judge the embedding dimension of the time series. At the same time, we understand that Manhattan distance is applicable in high-dimensional space. It has a similar calculation effect with the Euclidean distance and maximum norm, and has less calculation time [30]. Thus, we improved the algorithm, which is based on the FNN and Cao by using the Manhattan distance [31,32,33]. Finally, through the improvement of the above two ways, two synergistic measures for determining the embedding dimension are obtained, thereby establishing a new embedding dimension calculation method with strong robustness, accuracy and applicability.
The rest of this letter is organized as follows: Section 2 introduces the methodology, which contains a recurrence plot with its quantification and false-nearest neighbor(FNN) method with Cao’s modification and measures of determining the embedding dimension. Section 3 describes the empirical results. Section 4 offers the conclusions.

2. Methodology

2.1. Indicator 1

For time series x i ( i = 1 N ) , we can reconstruct it in phase space, and obtain the reconstructed vector V i ( m ) = ( x i , x i + τ , , x i + ( m 1 ) τ ) , i = 1 , 2 , , N ( m 1 ) τ , where τ represents the time delay, determined by the mutual information method, and m represents the embedding dimension. Its calculation method is the problem we will explore next. Originally, Matthew B. Kennel used Equations (1)–(3) as indicators to determine the embedding dimension of the chaotic time series with attractors.
R m 2 ( i , n ( i , k ) ) = k = 0 m 1 [ x ( i + k τ ) x n ( i , k ) ( i + k τ ) ] 2 , i = 1 , 2 , , n ( m 1 ) τ .
R m + 1 2 ( i , n ( i , k ) ) = R m 2 ( i , n ( i , k ) ) + [ x ( i + k τ ) x n ( i , k ) ( i + k τ ) ] 2 .
( R m + 1 2 ( i , n ( i , k ) ) R m 2 ( i , n ( i , k ) ) R m 2 ( i , n ( i , k ) ) ) 1 2 > R t o l .
Among them, R m 2 ( i , n ( i , k ) ) represents the distance between the reconstructed vector and the nearest neighbor when the embedding dimension is m, and n ( i , k ) is an integer, determined by i and k. By choosing an appropriate R t o l , the optimal embedding dimension is found when the Equation (3) is greater than R t o l . However, the disadvantage of this method is that the selection of R t o l is subjective, which can easily lead to an inaccuracy of the experiment. Later, Cao introduced a ( i , m ) and E 1 ( m ) , and improved it by using the maximum norm. It mainly improves the subjective shortcomings of parameter selection, but at the same time exposes new problems. Because the distance between high-dimensional time series is nonlinear, the maximum norm is not suitable for high-dimensional time series. Thus, we introduced a Manhattan distance, and proved its stability and accuracy in processing time series with high-dimensional embedding dimension through experiments. The Manhattan distance is defined as follows:
For the vector c and vector d . If n = 2 , the Manhattan distance is the L 1 -norm, and the distance between the two vectors is M H ( c , d ) = | x 1 y 1 | + | x 2 y 2 | ; if n > 2 , the Manhattan distance is M H ( c , d ) = | x 1 y 1 | + | x 2 y 2 | + + | x n y n | .
By introducing the Manhattan distance and improving a ( i , m ) , the following formula is obtained:
a ( i , m ) = k = 0 m 1 | x ( i + k τ ) x n ( i , k ) ( i + k τ ) | k = 0 m | x ( i + k τ ) x n ( i , k ) ( i + k τ ) | , i = 1 , 2 , , N m τ .
E ( m ) = 1 N m τ i = 1 N m τ a ( i , m ) .
where
E 11 ( m ) = E ( m + 1 ) / E ( m ) .

2.2. Indicator 2

In order to conduct the experiment more accurately and ensure the success of the experiment, Kennel proposed Equations (7) and (8) as the test standard, but there are many shortcomings; for example, the experimental results are greatly affected by individual subjectivity and cannot identify the chaotic time series.
R m + 1 ( i ) R A > A t o l .
R A 2 = 1 N i = 1 N [ x ( i ) x ¯ ] 2 .
where A t o l is some threshold, R A is the distance between average value and actual value, and
x ¯ = 1 N i = 1 N x ( i ) .
To solve the above shortcomings, Cao introduced a new measure E 2 ( m ) , which can identify deterministic signals from chaotic signals, as shown in the formula,
E 2 ( m ) = E * ( m + 1 ) E * ( m ) .
E * ( m ) = 1 N m τ i = 1 N m τ | x i + m τ x n ( i , d ) + m τ | .
However, the above methods have limitations. Through experiments, we found that when the embedding dimension tends to be stable, the magnitude of change will be very small, and it is impossible to determine when the optimal embedding dimension is obtained. At the same time, Webber Jr found embedding dimension is related to the quantification of the recurrence plot. Recurrence plot is a two-dimensional method that can demonstrate the inherent certainty, correlation, and periodicity of the time series. For the time series x ( i ) , i = 1 , 2 , , N , through selecting the time delay and embedding dimension, it is reconstructed as
V 1 V 2 V 3 V n = x 1 x 1 + τ x 1 + 2 τ x 1 + ( m 1 ) τ x 2 x 2 + τ x 2 + 2 τ x 2 + ( m 1 ) τ x 3 x 3 + τ x 3 + 2 τ x 3 + ( m 1 ) τ x N x N + τ x N + 2 τ x N + ( m 1 ) τ
V i represents the i-th state, N = n ( m 1 ) τ is the total number of recurrence points, m 2 is the embedding dimension, and τ 1 is the time-delay.
The recurrence plot is drawn by a distance matrix, and the elements in the distance matrix can be defined by the following formula:
R i j = H ( ϵ | | V i V j | | ) , i , j = 1 , 2 , , N .
The H ( x ) function is the Heaviside Function; if x > 0 , the value of H ( x ) is 1, if x < 0 , the value of H ( x ) is 0, i represents the number of rows, and j represents the number of columns, when R i j = 1 is 1, it is represented by black dots in the recurrence plot. Otherwise, it is represented by white dots in the recurrence plot. The threshold ϵ is an empirical value. After the above process, the distance matrix is transformed into a matrix. Finally, the 0 1 matrix is visualized and expressed in the form of a two-dimensional plot.
The determinism ( D E T ) is obtained by quantifying the recurrence plot. It is the ratio between the recurrence points and the total recurrence points of a diagonal structure with a length greater than or equal to 1. When the dynamic behavior of the two systems is weakly correlated or uncorrelated, it will produce a very short diagonal structure, and its basic definition is:
D E T = l = l m i n N l p ( l ) l = 1 N l p ( l ) .
l m i n represents the length of the diagonal structure in the recurrence plot, l m i n = 2 , and P ( l ) represents the probability of the diagonal structure with the length l in the recurrence plot.
After the experiments, we determined the relationship between the D E T and embedding dimension. It is demonstrated by the following Figure 1. Based on confirming the correctness of Joseph L.Webber Jr’s view, we proposed a method to assist in determining the embedding dimensions.

3. Experiment of Normal Examples

Firstly, we demonstrate the accuracy of our method for solving the embedding dimension. Thus, we selected data with a known minimum embedding dimension of 3.
The data are the x-component values from Lorenz attractor with the parameters σ = 10 , r = 28 , b = 8 / 3 ; they are the same as that considered in [9]. We take the integral step equals 0.01 , then calculate the numerically integration of the equation. The results are demonstrated in the Figure 2 and Table 1. It is very clear that our method has the accuracy. As the embedding dimension increases, our E 11 measure gradually stabilizes. In addition, through the value of D E T , we can find that when the embedding dimension is 3, D E T , which can help us to determine the embedding dimension, becomes a saturation value when the E 11 becomes stable. Therefore, our method can be used to solve the embedding dimension of the time series more accurately.
After discussing the feasibility of our improved method, we next compare the method with the traditional FNN method. As is considered in [9], we select the data from the following equation
t n + 4 = s i n ( t n + 5 ) + s i n ( 2 t n + 1 + 5 ) + s i n ( 3 t n + 2 + 5 ) + s i n ( 4 t n + 3 + 5 ) .
By transforming into the following prediction model, we can know that its embedding dimension is 4
t n + 4 = W ( t n , t n + 1 , t n + 2 , t n + 3 ) = s i n ( t n + 5 ) + s i n ( 2 t n + 1 + 5 ) + s i n ( 3 t n + 2 + 5 ) + s i n ( 4 t n + 3 + 5 ) .
The results of the comparison experiments are shown in Figure 3 and Figure 4 and Table 2.
In this example, the time delay is 1. Obviously, our E 11 measure becomes stable after the embedding dimension reaches 4. At the same time, the D E T value exceeds 0.9 and tends towards 1. This demonstrates that our method can well identify the embedding dimension of this time series. At the same time, the FNN method is where A t o l = 3 , R t o l = 9 cannot accurately identify its embedding dimension when faced with a time series of 1000 data points.
Next, we are going to discuss the stability and applicability for time series from a high-dimensional attractor. Until the present, many methods only discussed the time series that is from low-dimensional systems; thus, the method that can determine the embedding dimension needs to be improved. As is demonstrate in [10], Cao tested the data which from Mackey-Glass delay-differential equation, as followed, has a high-dimensional attractor, but the result is unsatisfactory.
d x ( t ) d t = 0.1 x ( t ) + 0.2 x ( t Δ ) 1 + x ( t Δ ) 10 .
As demonstrated in Figure 5, there is a sudden dip at d = 15 ; however, they could not explain the phenomenon and hope to investigating it in their future work. Thus, in order to solve this problem, we use our measure E 11 and D E T , which from the modified method tests the above Mackey-Glass series, and obtains the result in Figure 6 and Table 3.
Cao’s method has better advantages than the traditional FNN method. It can identify whether the time series is random data through the quantity E 2 . However, it is only useful for identification.
Next, we will explore the role of the E11 indicator in the method. We selected the CSI 500 Index from 2016 to 2021 as the experimental data. Before the experiment, considering the impact of the market adjustment in 2018 on the embedding dimension of the time series, we divided the experimental data into three parts: before, during and after 2018, and analyzed the embedding dimension, respectively. The experimental results are shown in Figure 7, Figure 8 and Figure 9. The embedding dimension of the time series around 2018 reached the minimum around 5–6, while in 2018, due to the market adjustment, the minimum embedding dimension appeared around 3–4. This demonstrates that the market adjustment has an impact on the embedding dimension of the whole time series. There are 33–40% changes here, which indicates that the market adjustment has a significant impact on the embedding dimension of the whole time series; thus, the embedding dimension of the whole time series is not constant. Next, we will explore the advantages of the new method on the experimental data.
In our experiments, we found that when E 1 tends to stabilize, E 2 does not help us to determine when the embedded dimension stops increasing. Among them, we selected the daily closing chaotic time series of the CSI 500 Index from 2016 to 2021 as the experimental data. The experimental results are shown in Figure 10. The quantity of E 1 becomes stable when the embedding dimension is 5 to 6; however, the quantity of E 2 tends to be stable after the embedding dimension is 3.
We improved this part of the shortcomings by using the quantity D E T of RQA. Through experiments on the above data, we obtained the experimental results, as shown in Figure 11 and Table 4. As shown in Figure 11, the value of quantity E 11 becomes stable when the embedding dimension reaches 4 to 6. From Table 4, we can find that the value of quantity D E T exceeds 0.9 after the embedding dimension reaches 5, and the certainty becomes very high. Therefore, we can effectively determine the optimal embedding dimension of the time series through quantity D E T .

4. Conclusions

Aiming at the shortcomings of traditional methods for finding the embedding dimension of the time series, we propose a new and effective method based on them and perfect the financial time series. In addition, through the experimental analysis of the time series, we find that this method has better advantages in accuracy, stability, and calculation of the theoretical and financial time series with high-dimensional chaotic attractors. Financial systems are complex and full of systemic risk and nonlinear characteristics.
In the further study, we also hope that our new method will be useful in applications of nonlinear techniques to explore more financial time series as well as the artificial time series. Next, we will deal with the non-stationary data in a stable way, and our work analyzes the multi-scale and multi-domain financial time series to more accurately reveal the dynamic characteristics of the financial system.

Author Contributions

Investigation, H.Z.; Methodology, H.Z.; Supervision, J.H.; Writing—original draft, H.Z.; Writing—review & editing, J.H. All authors have read and agreed to the published version of the manuscript.

Funding

This research was supported by the National Natural Science Foundation of China under Grant No. 12272058 and National Natural Science Foundation of China (NNSFC) under Grant No. 11902038 and R & D Program of Beijing Municipal Education Commission (No. KM 202011232019), P.R.China.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Takens, F. Detecting strange attractors in turbulence. LNM 1981, 898, 366–381. [Google Scholar]
  2. Sun, B.J.; Li, M.; Zhang, F.F. The characteristics and self-time-delay synchronization of two-time-delay complex Lorenz system. J. Franklin Inst. 2019, 356, 334–350. [Google Scholar] [CrossRef]
  3. Bhavsar, R.; Davey, N.; Helian, N. Time Series Analysis using Embedding Dimension on Heart Rate Variability. Procedia Comput. Sci. 2018, 145, 89–96. [Google Scholar] [CrossRef]
  4. Jazayeri, M.; Ostojic, S. Interpreting neural computations by examining intrinsic and embedding dimensionality of neural activity. Curr. Opin. Neurobiol. 2021, 70, 113–120. [Google Scholar] [CrossRef] [PubMed]
  5. Li, D.Y.; Cao, M.S. A novel embedding method for characterization of low-dimensional nonlinear dynamical systems. Nonlinear Dyn. 2021, 104, 125–148. [Google Scholar] [CrossRef]
  6. Sugihara, G.; May, R.M. Applications of Fractals in Ecology. TREE 1990, 5, 79–86. [Google Scholar] [CrossRef]
  7. Machado, J.A.T. Relativistic time effects in financial dynamics. Nonlinear Dyn. 2014, 75, 735–744. [Google Scholar] [CrossRef]
  8. Machado, J.A.T.; Duarte, F.B.; Duarte, G.M. Analysis of financial data series using fractional Fourier transform and multidimensional scaling. Nonlinear Dyn. 2011, 65, 235–245. [Google Scholar] [CrossRef]
  9. Zhou, Q.; Zhu, Z.; Xian, G. A novel regression method for harmonic analysis of time series. ISPRS J. Photogramm. Remote Sens. 2022, 185, 48–61. [Google Scholar] [CrossRef]
  10. Karlaftis, M.G.; Vlahogianni, E.I. Memory properties and fractional integration in transportation time-series. TR_C 2009, 17, 444–453. [Google Scholar] [CrossRef]
  11. Zolotova, N.V.; Ponyavin, D.L. Phase asynchrony of the north-south sunspot activity. Astron. Astrophys. 2006, 449, L1–L4. [Google Scholar] [CrossRef] [Green Version]
  12. Liu, W.; Wang, D.Z.; Chen, Z.H. Recurrence plot-based dynamic analysis on electrochemical noise of the evolutive corrosion process. Corros. Sci. 2017, 124, 93–102. [Google Scholar] [CrossRef]
  13. King, G.P.; Stewart, L. Phase space reconstruction for symmetric dynamical systems. Physica D 1992, 58, 216–228. [Google Scholar] [CrossRef]
  14. Atay, F.M.; Yurtsever, E. Phase-space reconstruction in Hamiltonian systems through multiple time series. Chem. Phys. Lett. 1997, 276, 282–288. [Google Scholar] [CrossRef]
  15. Wallot, S.; Monster, D. Calculation of average mutual information (AMI) and false-nearest neighbors (FNN) for the estimation of embedding parameters of multidimensional time series in matlab. Front. Psychol. 2018, 9, 1–10. [Google Scholar]
  16. Kennel, M.B.; Brown, R.; Abarbanel, H.D.I. Determine embedding dimension for phase-space reconstruction using a geometrical construction. Phys. Rev. A 1992, 45, 3403–3411. [Google Scholar] [CrossRef] [PubMed]
  17. Cao, L.Y. Practical method for determining the minimum embedding dimension of a scalar time series. Physica D 1997, 110, 43–50. [Google Scholar] [CrossRef]
  18. Eckmann, J.P.; Kamphorst, S.O.; Ruelle, D. Recurrence plots of dynamical systems. Europhys. Lett. 1987, 4, 973–977. [Google Scholar] [CrossRef]
  19. Meng, X.J.; Qiu, S.; Wan, S.H. A motor imagery EEG signal classification algorithm based on recurrence plot convolution neural network. Pattern Recognit. Lett. 2021, 146, 134–141. [Google Scholar] [CrossRef]
  20. Kok, T.L.; Aldrich, C. Analysis of Electrochemical Noise for Corrosion Type Identification by Use of Global Recurrence Plots and Texture Analysis. IFAC-Pap. OnLine 2019, 52, 36–41. [Google Scholar] [CrossRef]
  21. Webber, C.L., Jr.; Marwan, N. Recurrence Quantification Analysis-Theory and Best Practices; Springer: Berlin/Heidelberg, Germany, 2015. [Google Scholar]
  22. Wallot, S. Multidimensional cross-recurrence quantification analysis (MDCRQA)—A method for quantifying correlation between multivariate time-series. Multivar. Behav. Res. 2019, 54, 173–191. [Google Scholar] [CrossRef] [PubMed]
  23. Xu, M.; Shang, P.J.; Lin, A.J. Multiscale recurrence quantification analysis of order recurrence plot. Physica A 2017, 469, 381–389. [Google Scholar] [CrossRef]
  24. Marwan, N.; Wessel, M.; Kurths, J. Recurrence Plot Based Measures of Complexity and its Application to Heart Rate Variability Data. Phys. Rev. E 2002, 66, 381–389. [Google Scholar] [CrossRef] [PubMed]
  25. Belaire, J.; Contreras, D.; Tordera, L. Assessing nonlinear structures in real exchange rates using recurrence plot strategies. Physica D 2002, 171, 249–264. [Google Scholar] [CrossRef]
  26. Yao, C.Z.; Lin, Q.W. Recurrecnce plots analysis of the CNY exchange markets based on phase space reconstruction. N. Am. J. Econ. Financ. 2017, 42, 584–596. [Google Scholar] [CrossRef]
  27. Yin, Y.; Shang, P.J. Multiscale recurrence plot and recurrence quantification analysis for financial time series. Nonlinear Dyn. 2016, 85, 2309–2352. [Google Scholar] [CrossRef]
  28. Afonso, L.C.S.; Rosa, G.H.; Pereira, C.R.; Weber, S.A.T.; Hook, C.; Albuquerque, V.H.C.; Papa, J.P. A recurrence plot-based approach for Parkinson’s disease identification. Future Gener. Comput. Syst. 2019, 94, 282–292. [Google Scholar] [CrossRef]
  29. Zbilut, J.P.; Webber, C.L. Embeddings and delays as derived from quantification of recurrence plots. Phys. Lett. A 1992, 171, 199–203. [Google Scholar] [CrossRef]
  30. Tielen, G.J.; Luek, T.; Kuzma, M. The role of Manhattan distance in antiferromagnetic ordering. Physica A 1997, 246, 199–220. [Google Scholar] [CrossRef]
  31. Gueye, S.; Michelon, P. A linear formulation withvarianles for quadratic assignment problems with Manhattan distance matrices. EURO J. Comput. 2015, 3, 79–110. [Google Scholar] [CrossRef]
  32. Blackburn, S.R.; Homberger, C.; Winkler, P. The minimum Manhattan distance and minimum jump of permutations. J. Comb. Theory Ser. A 2019, 161, 364–386. [Google Scholar] [CrossRef]
  33. Neyman, S.N.; Sitohang, B.; Sutiusna, S. Reversible Fragile Watermarking based on Difference Expansion Using Manhattan Distances for 2D Vector Map. Procedia Technol. 2013, 11, 614–620. [Google Scholar] [CrossRef] [Green Version]
Figure 1. The relationship between the D E T and embedding dimension.
Figure 1. The relationship between the D E T and embedding dimension.
Entropy 24 01298 g001
Figure 2. The value of E 1 , E 2 and E 11 , whose data are from the Lorenz attractor. It reveals uncertain, unrepeatable, and unpredictable chaotic phenomena. E 1 and E 2 is the measure of Cao’s method. E 11 is the measure of our method.
Figure 2. The value of E 1 , E 2 and E 11 , whose data are from the Lorenz attractor. It reveals uncertain, unrepeatable, and unpredictable chaotic phenomena. E 1 and E 2 is the measure of Cao’s method. E 11 is the measure of our method.
Entropy 24 01298 g002
Figure 3. It is the percentage of FNN for the data from above Equation (15).
Figure 3. It is the percentage of FNN for the data from above Equation (15).
Entropy 24 01298 g003
Figure 4. It is same as the Figure 3 but the value is E11.
Figure 4. It is same as the Figure 3 but the value is E11.
Entropy 24 01298 g004
Figure 5. It is same as the Figure 2 but the data comes from Mackey-Glass delay-differential equation.
Figure 5. It is same as the Figure 2 but the data comes from Mackey-Glass delay-differential equation.
Entropy 24 01298 g005
Figure 6. The value E 11 for the data, which is same as the above data.
Figure 6. The value E 11 for the data, which is same as the above data.
Entropy 24 01298 g006
Figure 7. The value of E 11 , whose data are from the CSI 500 Index from 2016 to 2017.
Figure 7. The value of E 11 , whose data are from the CSI 500 Index from 2016 to 2017.
Entropy 24 01298 g007
Figure 8. The value of E 11 , whose data are from the CSI 500 Index from 2018.
Figure 8. The value of E 11 , whose data are from the CSI 500 Index from 2018.
Entropy 24 01298 g008
Figure 9. The value of E 11 , whose data are from the CSI 500 Index from 2019 to 2021.
Figure 9. The value of E 11 , whose data are from the CSI 500 Index from 2019 to 2021.
Entropy 24 01298 g009
Figure 10. The value of E 1 , E 2 whose data are from the CSI 500 Index from 2016 to 2021.
Figure 10. The value of E 1 , E 2 whose data are from the CSI 500 Index from 2016 to 2021.
Entropy 24 01298 g010
Figure 11. The value of E 11 , whose data are same with the above Figure 10.
Figure 11. The value of E 11 , whose data are same with the above Figure 10.
Entropy 24 01298 g011
Table 1. The value D E T for time series which is from the Lorenz attractor.
Table 1. The value D E T for time series which is from the Lorenz attractor.
Dimension DET
10.48
20.79
30.93
40.92
50.95
60.92
70.94
80.93
90.92
Table 2. The value D E T for time series which is from the above map in Equation (14).
Table 2. The value D E T for time series which is from the above map in Equation (14).
Dimension DET
10.37
20.67
30.78
40.95
50.955
60.963
70.95
80.97
90.96
100.975
Table 3. The value D E T for time series, which is from the Mackey-Glass delay-differential equation.
Table 3. The value D E T for time series, which is from the Mackey-Glass delay-differential equation.
Dimension DET Dimension DET
10.48110.94
20.59120.95
30.63130.93
40.72140.96
50.78150.94
60.82160.943
70.84170.945
80.85180.943
90.87190.953
100.95200.97
Table 4. The value D E T for time series, which is same as Figure 10.
Table 4. The value D E T for time series, which is same as Figure 10.
Dimension DET
10.57
20.83
30.89
40.96
50.954
60.965
70.95
80.97
90.963
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Zhu, H.; Huang, J. A New Method for Determining the Embedding Dimension of Financial Time Series Based on Manhattan Distance and Recurrence Quantification Analysis. Entropy 2022, 24, 1298. https://doi.org/10.3390/e24091298

AMA Style

Zhu H, Huang J. A New Method for Determining the Embedding Dimension of Financial Time Series Based on Manhattan Distance and Recurrence Quantification Analysis. Entropy. 2022; 24(9):1298. https://doi.org/10.3390/e24091298

Chicago/Turabian Style

Zhu, Hanhuai, and Jingjing Huang. 2022. "A New Method for Determining the Embedding Dimension of Financial Time Series Based on Manhattan Distance and Recurrence Quantification Analysis" Entropy 24, no. 9: 1298. https://doi.org/10.3390/e24091298

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop