Multi‐block principal component analysis based on variable weight information and its application to multivariate process monitoring
Bibliographic record
Abstract
The traditional principal component analysis (PCA)‐based process monitoring method builds a global statistical model and omits the mining of the local variable behaviours, which may degrade the fault detection performance. Considering this problem, this paper proposes a variable weight information‐based multi‐block PCA (VWI‐MBPCA) method. Firstly, a sequence hierarchical clustering algorithm is proposed to divide the full PCA component space into several sub‐blocks, where the components sharing similar variable weight information are gathered together and then the sub‐block T2 statistic is constructed for monitoring sub‐block components. Further, the variables with small weight information on each component sub‐block are extracted to build an additional sub‐PCA model, where the statistic is developed to compensate the sub‐block T2 statistic. In order to integrate the monitoring results of each sub‐block, Bayesian inference is applied to construct an overall T2 statistic. To identify the faulty variables, a multi‐block PCA contribution plot is designed by choosing some specific blocks to highlight fault information. Finally, simulations on a numerical example and the benchmark Tennessee Eastman (TE) process are used to demonstrate the strengths of the proposed method.
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.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.003 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 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".