TY - GEN
T1 - Contrastive Learning for Fault Diagnosis Enhanced by System-Level Graph Representation
AU - Wu, Chenlin
AU - Lin, Limei
AU - Huang, Yanze
AU - Wang, Dajin
AU - Fan, Jianxi
AU - Jia, Xiaohua
N1 - Publisher Copyright:
© The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2026.
PY - 2026
Y1 - 2026
N2 - System-level fault diagnosis are key to improving the reliability of interconnected networks. However, traditional system-level diagnosis methods are often limited by the number of the regularity and the smallest node degree of an interconnected network. To address these challenges, we propose a graph-enhanced multi-view contrastive learning fault diagnosis algorithm (SGEMC) based on PMC and MM* model. Our method introduces a dual-view enhancement technique that integrates the diagnosis results of neighboring nodes and their relationship with target node, thereby enriching the output. Additionally, we incorporate an incremental contrast mechanism that allows the target node to be contrasted across multiple dimensions, including node-subgraph, node-node, and subgraph-subgraph contrasts, which significantly improves the model’s diagnosis accuracy. Finally, we propose a fault scoring method that leverages multiple rounds of positive and negative instance samplings to effectively differentiate normal nodes from faulty ones. Experimental results demonstrate that SGEMC outperforms the existing models such as CoLA, Sub-CR, and SL-GAD in terms of accuracy, precision, recall, F1 score, and AUC.
AB - System-level fault diagnosis are key to improving the reliability of interconnected networks. However, traditional system-level diagnosis methods are often limited by the number of the regularity and the smallest node degree of an interconnected network. To address these challenges, we propose a graph-enhanced multi-view contrastive learning fault diagnosis algorithm (SGEMC) based on PMC and MM* model. Our method introduces a dual-view enhancement technique that integrates the diagnosis results of neighboring nodes and their relationship with target node, thereby enriching the output. Additionally, we incorporate an incremental contrast mechanism that allows the target node to be contrasted across multiple dimensions, including node-subgraph, node-node, and subgraph-subgraph contrasts, which significantly improves the model’s diagnosis accuracy. Finally, we propose a fault scoring method that leverages multiple rounds of positive and negative instance samplings to effectively differentiate normal nodes from faulty ones. Experimental results demonstrate that SGEMC outperforms the existing models such as CoLA, Sub-CR, and SL-GAD in terms of accuracy, precision, recall, F1 score, and AUC.
KW - Fault diagnosis
KW - Graph Contrastive Learning
KW - Interconnected networks
KW - Network reliability
UR - https://www.scopus.com/pages/publications/105019488840
U2 - 10.1007/978-981-95-0129-8_16
DO - 10.1007/978-981-95-0129-8_16
M3 - Conference contribution
AN - SCOPUS:105019488840
SN - 9789819501281
T3 - Communications in Computer and Information Science
SP - 215
EP - 227
BT - Cloud and Network Computing - 2nd International Conference, ICCNC 2025, Proceedings
A2 - Lin, Limei
A2 - Lee, Chia-Wei
PB - Springer Science and Business Media Deutschland GmbH
T2 - 2nd International Conference on Cloud and Network Computing, ICCNC 2025
Y2 - 20 June 2025 through 22 June 2025
ER -