Probabilistic dynamic stationary subspace regression model for soft sensing of nonstationary industrial processes
Bibliographic record
Abstract
Abstract Soft sensor technology is increasingly crucial for quality control in modern industrial processes. However, as industrial systems grow more complex, they begin to exhibit intricate characteristics such as nonstationary, uncertainty, and dynamic. These complexities pose significant challenges to conventional data‐driven soft sensor modelling approaches. In response, researchers have explored methods like stationary subspace analysis (SSA), probabilistic stationary subspace analysis (PSSA), and hidden Markov model (HMM) to handle nonstationary, uncertain, and dynamic process data. Nonetheless, each of these methods fails to fully capture these characteristics of complex industrial processes, which in turn limits their predictive performance. To overcome these limitations, this chapter introduces a probabilistic dynamic stationary subspace regression (PDSSR) soft sensor model tailored to nonstationary industrial processes. Specifically, the proposed model first decomposes the latent variables into quality‐related and quality‐unrelated components according to their relevance to the product quality variables. Next, within a stationary subspace analysis framework, the quality‐related information is further partitioned into stationary and nonstationary components, thereby accurately capturing nonstationary characteristics. Moreover, during the online estimation process, a hidden Markov chain inference mechanism is incorporated to enhance the accuracy of parameter estimation by accounting for regime changes over time. Finally, Numerical example and a case study on a debutanizer distillation column demonstrate that the proposed method achieves high predictive accuracy in soft sensing for complex, nonstationary industrial processes.
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.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".