SET: A Shared-Encoder Transformer Scheme for Multi-Sensor, Multi-Class Fault Classification in Industrial IoT
Bibliographic record
Abstract
The Industrial Internet of Things (IIoT) has revolutionized the industrial sector by integrating sensors to monitor equipment health and optimize production processes. These sensors collect real-time data and are prone to a variety of different faults, such as bias, drift, noise, gain, spike, and constant faults. Such faults can lead to significant operational problems, including false results, incorrect predictions, and misleading maintenance decisions. Therefore, classifying sensor data appropriately is essential for ensuring the reliability and efficiency of IIoT systems. In this paper, we propose the Shared-Encoder Transformer (SET) scheme for multi-sensor, multi-class fault classification in IIoT systems. Leveraging the transformer architecture, the SET uses a shared encoder with positional encoding and multi-head self-attention mechanisms to capture complex temporal patterns in sensor data. Consequently, it can accurately detect the health status of sensor data, and if the sensor data is faulty, it can specifically identify the fault type. Additionally, we introduce a comprehensive fault injection strategy to address the problem of fault data scarcity, enabling the validation of the robust performance of SET even with limited fault samples in both ideal and realistic scenarios. In our research, we conducted extensive experiments using the Commercial Modular Aeropropulsion System Simulation (C-MAPSS) and Skoltech Anomaly Benchmark (SKAB) datasets to study the performance of the SET. Our experimental results indicate that SET consistently outperforms baseline methods, including Long Short-Term Memory (LSTM), Convolutional Neural Network (CNN)-LSTM, and Multilayer Perceptron (MLP), as well as the proposed comparative variant of SET, Multi-Encoder Transformer (MET), in terms of accuracy, precision, recall, and F1-score across different fault intensities. The shared-kmencoder architecture improves fault detection accuracy and ensures parameter efficiency/robustness, making it suitable for deployment in memory-constrained industrial environments.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".