Time series classification by Euclidean distance-based visibility graph

The analysis and discrimination of time series data has important practical significance. Currently, transforming the time series data into networks through visibility graph (VG) methods is an effective approach for classifying the series data through GNNs. However, there are two main obstacles to the VG method: (1) the tension between efficiency and complexity during weighted graph construction; (2) difficulty in assigning the different importance of nodes. To tackle these difficulties, we propose an improved weighted visibility graph algorithm (WLVG) in this paper. The proposed algorithm can first intelligently assign weights to the network according to the Euclidean distance among nodes, and then resample the network by the weight coefficients resulting in the removal of the unimportant edges. Finally, in order to effectively aggregate the information among neighbors, the graph isomorphism network (GIN) is utilized for identifying the objects. Experimental results show WLVG outperforms other baseline methods on several practical datasets and demonstrate its effectiveness.& COPY; 2023 Elsevier B.V. All rights reserved.

Automated summary

The analysis and discrimination of time series data have practical significance. Transforming time series data into networks using visibility graph (VG) methods is an effective approach for classifying the data through GNNs. However, there are two main obstacles: efficiency and complexity in weighted graph construction, and difficulty in assigning node importance. To overcome these challenges, an improved weighted visibility graph algorithm (WLVG) is proposed, which intelligently assigns weights based on Euclidean distance and removes unimportant edges. The graph isomorphism network (GIN) is used to aggregate information among neighbors. Experimental results show WLVG outperforms baseline methods on practical datasets, demonstrating its effectiveness.