Fault prediction of non‐linear multi‐mode industrial process based on <scp>MKPCA</scp> model
Bibliographic record
Abstract
Abstract The actual industrial process is regarded as a non‐linear multi‐mode process. If the system is described according to the model of the single‐mode or the linear multi‐mode, it will inevitably lead to a large number of false alarms or missed alarms. The fault detection, fault reconstruction, fault amplitude estimation, and prediction for non‐linear multi‐mode process based on the multi‐kernel principal component analysis (MKPCA) model are studied in this paper. First, the MKPCA model will be applied to fault detection in the steady‐state process of different modes, and a weighted algorithm will be adopted for fault detection in the transition process. Then, the fault degree will be described quantitatively, and the fault amplitude in the form of fault reconstruction will be solved by the optimization method, and the consistent estimation algorithm of fault amplitude under different modes will also be studied. Finally, the prediction model of support vector machine (SVM) prediction model will be applied to predict the development trend of the fault amplitude. Furthermore, the Tennessee Eastman (TE) process will be taken as an application object to verify the effectiveness and superiority of the method.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| 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".