Distributed process monitoring for large‐scale processes based on <scp>MJMI</scp> ‐weighted <scp>DKPCA</scp>
Bibliographic record
Abstract
Abstract Although the distributed monitoring model has been widely employed in monitoring large‐scale processes, the dynamic nonlinear property in process data is rarely investigated. Given the complex dynamic nature of industrial processes, different process variables interact with each other over time. In order to describe the correlation of dynamic variables more accurately, this work proposes a novel dynamic nonlinear fault detection framework based on maximum joint mutual information (MJMI)‐weighted dynamic kernel principal component analysis (WDKPCA). After dividing the process variables using the MJMI scheme, the proposed dynamic weighting method defines the weight of time‐delayed variables, which allows the dynamic characteristics of these variables to be characterized more comprehensively. By these means, the processes can be decomposed into multiple subblocks, and a distributed monitoring scheme based on DKPCA is thus established. Then, the Bayesian fusion strategy is used to fuse the monitoring results of different subblocks. Through a series of experiments on the Tennessee Eastman (TE) process, the results indicate that MJMI‐WDKPCA has superior process monitoring performance.
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".