Papers › DyEdgeGAT: Dynamic Edge via Graph Attention for Early Fault Detection in IIoT Systems
DyEdgeGAT: Dynamic Edge via Graph Attention for Early Fault Detection in IIoT Systems
Mengjie Zhao, Olga Fink
In the Industrial Internet of Things (IIoT), condition monitoring sensor signals from complex systems often exhibit nonlinear and stochastic spatial-temporal dynamics under varying conditions. These complex dynamics make fault detection particularly challenging. While previous methods effectively model these dynamics, they often neglect the evolution of relationships between sensor signals. Undetected shifts in these relationships can lead to significant system failures. Furthermore, these methods frequently misidentify novel operating conditions as faults. Addressing these limitations, we propose DyEdgeGAT (Dynamic Edge via Graph Attention), a novel approach for early-stage fault detection in IIoT systems. DyEdgeGAT's primary innovation lies in a novel graph inference scheme for multivariate time series that tracks the evolution of relationships between time series, enabled by dynamic edge construction. Another key innovation of DyEdgeGAT is its ability to incorporate operating condition contexts into node dynamics modeling, enhancing its accuracy and robustness. We rigorously evaluated DyEdgeGAT using both a synthetic dataset, simulating varying levels of fault severity, and a real-world industrial-scale multiphase flow facility benchmark with diverse fault types under varying operating conditions and detection complexities. The results show that DyEdgeGAT significantly outperforms other baseline methods in fault detection, particularly in the early stages with low severity, and exhibits robust performance under novel operating conditions.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Tasks
Results from the paper archive 2025-07-28
| Task | Dataset | Model | Metric | Value | Rank at snapshot | Leaderboard | Report |
|---|---|---|---|---|---|---|---|
| Unsupervised Anomaly Detection | PRONTO | DyEdgeGAT | AUC | 0.8 | #1 of 1 | Archive leaderboard | report |
| Unsupervised Anomaly Detection | PRONTO | DyEdgeGAT | Best Delay | 61 | #1 of 1 | Archive leaderboard | report |
| Unsupervised Anomaly Detection | PRONTO | DyEdgeGAT | Best F1 | 0.86 | #1 of 1 | Archive leaderboard | report |
| Unsupervised Anomaly Detection | PRONTO | DyEdgeGAT | F1 | 0.83 | #1 of 1 | Archive leaderboard | report |
| Unsupervised Anomaly Detection | Synthetic | DyEdgeGAT | AUC | 0.83 | #1 of 1 | Archive leaderboard | report |
| Unsupervised Anomaly Detection | Synthetic | DyEdgeGAT | Best Delay | 21.4 | #1 of 1 | Archive leaderboard | report |
| Unsupervised Anomaly Detection | Synthetic | DyEdgeGAT | Best F1 | 0.75 | #1 of 1 | Archive leaderboard | report |
| Unsupervised Anomaly Detection | Synthetic | DyEdgeGAT | F1 | 0.69 | #1 of 1 | Archive leaderboard | report |
Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.
Methods
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections