Fault detection and diagnosis for chemical processes using dynamic global–local preserving projections
Bibliographic record
Abstract
Abstract Most traditional multivariate statistical monitoring methods require an assumption that the observation values at a certain moment and a past moment are statistically independent. However, in actual chemical and biological processes, the sample at a certain moment is often affected by the previous moment. Therefore, given the problem of more false alarms and poor detection ability based on the traditional principal component analysis, this article proposes a dynamic global–local preserving projections (DGLPP) algorithm. Unlike dynamic local preserving projections (DLPP) and dynamic principal component analysis (DPCA), DGLPP controls the global and local information retained in the dimensionality reduction data by introducing weight coefficients, which makes the algorithm applicable to more types of industrial processes. Moreover, new parameter determination methods are also proposed for improved detection and diagnosis. Through the improved contribution graph method, we can see the influence degree of each variable on the fault, to monitor and isolate the fault. Finally, by verifying the operation of the multivariable process and two practical cases, the results show that compared with DPCA, DLPP, and global local retained projection (GLPP) methods, the performance under this method has been significantly improved.
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.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 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".