TY - JOUR
T1 - Visibility graph-based segmentation of multivariate time series data and its application
AU - Hu, Jun
AU - Chu, Chengbin
AU - Zhu, Peican
AU - Yuan, Manman
N1 - Publisher Copyright:
© 2023 Author(s).
PY - 2023/9/1
Y1 - 2023/9/1
N2 - In this paper, we propose an efficient segmentation approach in order to divide a multivariate time series through integrating principal component analysis (PCA), visibility graph theory, and community detection algorithm. Based on structural characteristics, we can automatically divide the high-dimensional time series into several stages. First, we adopt the PCA to reduce the dimensions; thus, a low dimensional time series can be obtained. Hence, we can overcome the curse of dimensionality conduct, which is incurred by multidimensional time sequences. Later, the visibility graph theory is applied to handle these multivariate time series, and corresponding networks can be derived accordingly. Then, we propose a community detection algorithm (the obtained communities correspond to the desired segmentation), while modularity Q is adopted as an objective function to find the optimal. As indicated, the segmentation determined by our method is of high accuracy. Compared with the state-of-art models, we find that our proposed model is of a lower time complexity ( O ( n 3 ) ) , while the performance of segmentation is much better. At last, we not only applied this model to generated data with known multiple phases but also applied it to a real dataset of oil futures. In both cases, we obtained excellent segmentation results.
AB - In this paper, we propose an efficient segmentation approach in order to divide a multivariate time series through integrating principal component analysis (PCA), visibility graph theory, and community detection algorithm. Based on structural characteristics, we can automatically divide the high-dimensional time series into several stages. First, we adopt the PCA to reduce the dimensions; thus, a low dimensional time series can be obtained. Hence, we can overcome the curse of dimensionality conduct, which is incurred by multidimensional time sequences. Later, the visibility graph theory is applied to handle these multivariate time series, and corresponding networks can be derived accordingly. Then, we propose a community detection algorithm (the obtained communities correspond to the desired segmentation), while modularity Q is adopted as an objective function to find the optimal. As indicated, the segmentation determined by our method is of high accuracy. Compared with the state-of-art models, we find that our proposed model is of a lower time complexity ( O ( n 3 ) ) , while the performance of segmentation is much better. At last, we not only applied this model to generated data with known multiple phases but also applied it to a real dataset of oil futures. In both cases, we obtained excellent segmentation results.
UR - http://www.scopus.com/inward/record.url?scp=85171328207&partnerID=8YFLogxK
U2 - 10.1063/5.0152881
DO - 10.1063/5.0152881
M3 - 文章
C2 - 37712915
AN - SCOPUS:85171328207
SN - 1054-1500
VL - 33
JO - Chaos
JF - Chaos
IS - 9
M1 - 093123
ER -