TY - JOUR
T1 - Pre-connected and trainable adjacency matrix-based GCN and neighbor feature approximation for industrial fault diagnosis
AU - Qing, Hao Yang
AU - Zhang, Ning
AU - He, Yan Lin
AU - Zhu, Qun Xiong
AU - Xu, Yuan
N1 - Publisher Copyright:
© 2024
PY - 2024/11
Y1 - 2024/11
N2 - Industrial fault diagnosis methods based on graph convolution network (GCN) becomes a hot topic for its great feature extraction ability to multivariate time-series data. However, GCNs ignore inter-sample temporality when constructing the adjacency matrix (AM), leading to low prediction accuracy. A novel fault diagnosis method based on pre-connected and trainable AM-based GCN and neighbor feature approximation (PTGCN-FA) is proposed at the node-level task. Firstly, PTGCN-FA introduces the temporal nearest neighbors into spatial nearest neighbors to pre-connect and construct the AM. Then, the AM is trained only where the samples are connected, which makes the best weights obtained and reduces the time complexity of the model. Finally, after the GCN layers, the trained AM is introduced into the approximation of features, which are neighbors in the original sample space. Two process industry cases are carried out, and the simulation results including diagnosis accuracy, confusion matrix, study to the ratio of labeled data and an ablation experiment verify PTGCN-FA has more efficient and accurate diagnostic performance than related methods. Additionally, the analysis of the temporal neighborhood weight parameter shows that the performance of fault diagnosis can be improved by considering both temporal and spatial information between samples.
AB - Industrial fault diagnosis methods based on graph convolution network (GCN) becomes a hot topic for its great feature extraction ability to multivariate time-series data. However, GCNs ignore inter-sample temporality when constructing the adjacency matrix (AM), leading to low prediction accuracy. A novel fault diagnosis method based on pre-connected and trainable AM-based GCN and neighbor feature approximation (PTGCN-FA) is proposed at the node-level task. Firstly, PTGCN-FA introduces the temporal nearest neighbors into spatial nearest neighbors to pre-connect and construct the AM. Then, the AM is trained only where the samples are connected, which makes the best weights obtained and reduces the time complexity of the model. Finally, after the GCN layers, the trained AM is introduced into the approximation of features, which are neighbors in the original sample space. Two process industry cases are carried out, and the simulation results including diagnosis accuracy, confusion matrix, study to the ratio of labeled data and an ablation experiment verify PTGCN-FA has more efficient and accurate diagnostic performance than related methods. Additionally, the analysis of the temporal neighborhood weight parameter shows that the performance of fault diagnosis can be improved by considering both temporal and spatial information between samples.
KW - Fault diagnosis
KW - Features extraction techniques
KW - Graph convolution networks
KW - Multivariate time-series data
KW - Temporal nearest neighbors
UR - http://www.scopus.com/inward/record.url?scp=85207082343&partnerID=8YFLogxK
U2 - 10.1016/j.jprocont.2024.103320
DO - 10.1016/j.jprocont.2024.103320
M3 - Article
AN - SCOPUS:85207082343
SN - 0959-1524
VL - 143
JO - Journal of Process Control
JF - Journal of Process Control
M1 - 103320
ER -