Design of an online learning scheme for quality prediction in refining and chemical units
Bibliographic record
Abstract
Abstract The refining and chemical production process is highly complex, with various uncertainties leading to fluctuations in product quality or even non‐compliance with standards. This makes real‐time monitoring of product quality essential. In recent years, with the advancement of digitalization and intelligent technologies, many quality prediction methods based on mechanistic or data‐driven modelling have emerged. However, for refining and chemical processes characterized by high dimensionality, strong coupling, and multiple working conditions, these methods may suffer from model mismatches and other limitations. Therefore, this study introduces an online learning approach for quality prediction in refining and chemical units, aiming to extract feature data across multiple working conditions from historical records without relying on process models. The method begins by efficiently extracting steady‐state data from process variables using filtering and fluctuation detection techniques. K‐means clustering and support vector data description (SVDD) are then applied to extract features at typical process points, while an innovative incremental principal component analysis (IPCA) method is employed to determine the optimal number of clusters for precise data classification. Additionally, a novel solution addresses matching issues between data sampled at different intervals, integrating process variables, working conditions, and quality indicators based on expert knowledge. A case study of a catalytic cracking distillation unit demonstrates the feasibility of the approach, highlighting its significant implications for quality prediction and online soft sensors, as well as its strong potential for future application across multiple units.
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.002 | 0.003 |
| 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.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 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".