Slow‐varying batch process monitoring based on canonical variate analysis
Bibliographic record
Abstract
Abstract Most industrial batch processes display normal slow changes over batches because of the influence of external factors. The question of how to take this slow‐varying behaviour into account during dynamic process monitoring remains a challenge for researchers. To address the above issue, a slow‐varying batch process monitoring method is proposed for multiphase batch processes. It makes subtraction between two different batches with a certain interval for pre‐treating the original data and subsequently utilizes a canonical variate analysis (CVA) algorithm with kernel density estimation (KDE) for fault detection. For each subphase, the proposed method can extract a variable‐wise dynamic characteristic with the time evolution for every single batch and capture statistical features of slow variations along batch direction simultaneously. It is less sensitive to normal gradual changes with a low false‐positive rate. The performance of the proposed method for batch process monitoring was tested on a numerical simulation system and penicillin fermentation production process with comparison to multiphase CVA, multiphase slow feature analysis (SFA), multiphase principal component analysis (PCA), and traditional CVA without phase division. The achieved results clearly demonstrate the effectiveness of the proposed method, which is a remarkable and promising tool for modelling and monitoring batch processes with regular slow‐varying characteristics.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".