Reducing smearing effect in contribution plots and improving fault detection via polynomial approximated isomap embeddings
Bibliographic record
Abstract
Abstract Dimension reduction is an essential method used in multivariate statistical process monitoring for fault detection and diagnosis. Principal component analysis (PCA) and independent component analysis (ICA) are the most frequently used linear dimensional reduction tools, and the contribution plot is the most popular fault isolation method in the absence of any prior information on the faults. These methods, however, come with their shortcomings. The fault detection capability of linear methods may not be sufficient for non‐linear processes, and smearing effect is known to deteriorate the diagnostics obtained from contribution plots. While the fault detection rate may be increased by kernelized methods or deep artificial neural network models, tuning data‐dependent hyperparameter(s) and network structure with limited historical data is not an easy task. Furthermore, the resulting non‐linear models often do not directly possess fault isolation capability. In the current study, we aim to devise a novel method named ICA pIso ‐PCA, which offers non‐linear fault detection and isolation in a rather straightforward manner. The rationale of ICA pIso ‐PCA mainly involves building a non‐linear scores matrix, composed of principal component scores and high‐order polynomial approximated isomap embeddings, followed by implementation of the ICA‐PCA algorithm on this matrix. Applications on a toy dataset and the Tennessee Eastman plant show that the I 2 index from ICA pIso ‐PCA yields a high fault detection rate and offers accurate contribution plots with diminished smearing effects compared to those from traditional monitoring methods. Easy implementation and the potential for future research are further advantages 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.008 |
| Meta-epidemiology (narrow) | 0.002 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| 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".