Local dynamic partial least squares approaches for the modelling of batch processes
Bibliographic record
Abstract
Abstract The application of multivariate statistical projection based techniques has been recognized as one approach to contributing to an increased understanding of process behaviour. The key methodologies have included multi‐way principal component analysis (PCA), multi‐way partial least squares (PLS) and batch observation level analysis. Batch processes typically exhibit nonlinear, time variant behaviour and these characteristics challenge the aforementioned techniques. To address these challenges, dynamic PLS has been proposed to capture the process dynamics. Likewise approaches to removing the process nonlinearities have included the removal of the mean trajectory and the application of nonlinear PLS. An alternative approach is described whereby the batch trajectories are sub‐divided into operating regions with a linear/linear dynamic model being fitted to each region. These individual models are spliced together to provide an overall nonlinear global model. Such a structure provides the potential for an alternative approach to batch process performance monitoring. In the paper a number of techniques are considered for developing the local model, including multi‐way PLS and dynamic multi‐way PLS. Utilising the most promising set of results from a simulation study of a batch process, the local model comprising individual linear dynamic PLS models was benchmarked against global nonlinear dynamic PLS using data from an industrial batch fermentation process. In conclusion the results for the local operating region techniques were comparable to the global model in terms of the residual sum of squares but for the global model structure was evident in the residuals. Consequently, the local modelling approach is statistically more robust.
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.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".