可见性图
欧几里德距离
计算机科学
图形
欧几里德几何
能见度
系列(地层学)
数据挖掘
模式识别(心理学)
人工智能
算法
理论计算机科学
数学
正多边形
物理
光学
生物
古生物学
几何学
作者
Le Cheng,Peican Zhu,Wenguang Sun,Zhen Han,Keke Tang,Xiaodong Cui
标识
DOI:10.1016/j.physa.2023.129010
摘要
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.
科研通智能强力驱动
Strongly Powered by AbleSci AI