An improved intelligent early warning method based on MWSPCA and its application in complex chemical processes
Bibliographic record
Abstract
Abstract With the development of industrial automation, the requirement of abnormal early warning in the industrial production process is getting higher and higher. Facing complex chemical processes, traditional fault detection and abnormal early warning methods have low detection efficiency and poor real‐time performance. Therefore, this paper analyzes and studies fault detection and abnormal early warning methods, and puts forward an improved intelligent early warning method based on the moving window sparse principal component analysis (MWSPCA) suitable for complex chemical processes. The sparse principal component analysis algorithm is used to establish the initial early warning model, and then the moving window is used to update the early warning model, which makes the early warning model more suitable for the characteristics of time‐varying data. Furthermore, the proposed method reduces the false alarm rate and missed alarm rate of the early warning, and improves the real‐time performance of the early warning model. Finally, the feasibility and the validity of the proposed method are verified by the TE process and the oil drilling process. The experiment results show that the proposed method can reduce the risk of complex chemical processes.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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".