Monitoring Uneven Multistage/Multiphase Batch Processes using Trajectory‐Based Fuzzy Phase Partition and Hybrid MPCA Models
Bibliographic record
Abstract
Abstract Batch processes often have the traits of multiple operation stages/phases and uneven batch durations. These two traits bring difficulties to batch process modelling and monitoring. In this paper, a trajectory‐based fuzzy phase partition (TBFPP) method and hybrid multiway PCA (MPCA) models are developed for monitoring multistage/multiphase batch processes with uneven durations. The TBFPP method divides each batch into several fuzzy operation phases by clustering trajectory data of phase‐sensitive process variables using the sequence‐constraint fuzzy c‐means (SCFCM) clustering algorithm. This TBFPP method not only solves the uneven duration problem of batches, but also can identify transition regions between neighbouring operation phases. Fuzzy operation phases are further divided into “steady” and “transition” operation phases according to the membership degrees of samples. Hybrid modelling methods, consisting of phase‐based (global) modelling and just‐in‐time (local) modelling, are used to cope with different process characteristics of the “steady” and “transition” operation phases. Offline phase‐based MPCA models are built for “steady” operation phases to describe the steady process characteristics. Online just‐in‐time MPCA models are built for “transition” operation phases to handle the time‐varying process characteristics. Based on the hybrid MPCA models, an online process monitoring method is proposed. The efficacy of the proposed methods is demonstrated through a simulation study of a fed‐batch fermentation process.
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.001 |
| 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.000 |
| Scholarly communication | 0.001 | 0.001 |
| 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".