Online monitoring method for multiple operating batch processes based on local collection standardization and multi‐model dynamic PCA
Bibliographic record
Abstract
Abstract To handle multiple operations and non‐Gaussian problems which widely exist in complex industry processes, a new online monitoring method for multi‐operation batch processes is proposed by combing local collection standardization and multi‐model dynamic principal component analysis (LCS‐MMDPCA). Since a series of operations are often manually manipulated by operators, in general, the statistics of each batch data do not follow Gaussian distribution, which results in a failure for the construction of a multivariate statistical model. To target multiple operations and non‐Gaussian problems, we first split the complex batch processes into a sequence of stages. Subsequently, the data in each stage are clustered according to the operations. Then, we exploit the Local Collection Standardization (LCS) method to make the data belonging to the same cluster obey Gaussian distribution. At last, we adopt MMDPCA to model the complex industry processes with multiple operations and non‐Gaussian features. Experimental results on fault detection in ladle furnace steelmaking process showed the advantages of the proposed method in comparison to multiway kernel principal component analysis (MKPCA) and multiway dynamic principal component analysis (MDPCA).
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.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| 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".