Multi‐block gated recurrent unit network‐based fault diagnosis method for multivariate nonlinear process
Bibliographic record
Abstract
Abstract The increasing complexity of industrial processes brings new challenges to fault diagnosis tasks, and different types of faults have higher and higher requirements on the performance of fault classification models. This paper proposes a novel multivariate nonlinear temporal‐related fault diagnosis method based on gated recurrent units (GRUs). First, to improve the performance of the model in local information extraction and global integration, high dimensional variables are divided into multiple sub‐blocks according to the structure of chemical process units, and a new block normalization method is proposed to improve the performance of local feature extraction. Second, aiming at the slow drifting faults, the GRU network is adopted inside the sub‐block to extract local sparse and nonlinear temporal features. By combining the variance features of variables after block normalization, the performance of the model on multiplicative faults will improve. Finally, aiming at the complex correlation between variables, a new recurrent matrix method is proposed to extract the time transform information inside each variable to improve the comprehensive performance of the model. Through a multi‐level feature integration strategy, the model can be trained in parallel to improve the training speed. The proposed method shows good performance in the Tennessee Eastman process, and the extracted multi‐class features allow the model to be trained end‐to‐end and simultaneously diagnose multiple types of faults.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
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".