Wan Wenqing, Chen Jinglong, Xie Jingsong
State Key Laboratory for Manufacturing and Systems Engineering, Xi'an Jiaotong University, Xi'an, 710049, PR China.
State Key Laboratory for Manufacturing and Systems Engineering, Xi'an Jiaotong University, Xi'an, 710049, PR China.
ISA Trans. 2023 Aug;139:574-585. doi: 10.1016/j.isatra.2023.04.033. Epub 2023 May 4.
The Internet of Things (IoT) is crucial in developing next-generation high-speed railways (HSRs). HSR IoT enables intelligent diagnosis of trains using multi-sensor data, which is critical for maintaining high speeds and ensuring passenger safety. Graph neural network (GNN)-based methods have gained popularity in HSR IoT research due to the ability to represent the sensor network as intuitive graphs. However, labeling monitoring data in the HSR scenario takes time and effort. To address this challenge, we propose a semi-supervised graph-level representation learning approach called MIM-Graph, which uses mutual information maximization to learn from a large amount of unlabeled data. First, the multi-sensor data is converted into association graphs based on their spatial topology. The unsupervised encoder is trained using global-local mutual maximization. The teacher-student framework transfers knowledge from the unsupervised encoder learned to the supervised encoder, which is trained using a small amount of labeled data. As a result, the supervised encoder learns distinguishable representations for intelligent diagnosis of HSR. We evaluate the proposed method using CWRU dataset and data from HSR Bogie test platform, and the experimental results demonstrate the effectiveness and superiority of MIM-Graph.
物联网(IoT)在下一代高速铁路(HSR)的发展中至关重要。高铁物联网利用多传感器数据实现列车的智能诊断,这对于保持高速运行和确保乘客安全至关重要。基于图神经网络(GNN)的方法因能够将传感器网络表示为直观的图而在高铁物联网研究中受到欢迎。然而,在高铁场景中标记监测数据既耗时又费力。为应对这一挑战,我们提出了一种名为MIM-Graph的半监督图级表示学习方法,该方法利用互信息最大化从大量未标记数据中学习。首先,多传感器数据根据其空间拓扑转换为关联图。无监督编码器使用全局-局部互最大化进行训练。师生框架将从无监督编码器学到的知识转移到监督编码器,监督编码器使用少量标记数据进行训练。结果,监督编码器学习到用于高铁智能诊断的可区分表示。我们使用CWRU数据集和高铁转向架测试平台的数据对所提出的方法进行评估,实验结果证明了MIM-Graph的有效性和优越性。