A sparse PCA for nonlinear fault diagnosis and robust feature discovery of industrial processes
Bibliographic record
Abstract
Pearson's correlation measure is only able to model linear dependence between random variables. Hence, conventional principal component analysis (PCA) based on Pearson's correlation measure is not suitable for application to modern industrial processes where process variables are often nonlinearly related. To address this problem, a nonparametric PCA model is proposed based on nonlinear correlation measures, including Spearman's and Kendall tau's rank correlation. These two correlation measures are also less sensitive to outliers comparing to Pearson's correlation, making the proposed PCA a robust feature extraction technique. To reveal meaningful patterns from process data, a generalized iterative deflation method is applied to the robust correlation matrix of the process data to sequentially extract a set of leading sparse pseudoeigenvectors. For online fault diagnosis, the T2 and SPE statistics are computed and analyzed with respect to the subspace spanned by the extracted pseudoeigenvectors. The proposed method is applied to two industrial case studies. Its process monitoring performance is demonstrated to be superior to that of the conventional PCA and is comparable to those of Kernel PCA and kernel independent component analysis at a lower computational cost. The proposed PCA is also more robust in sparse feature extraction from contaminated process data. © 2016 American Institute of Chemical Engineers AIChE J, 62: 1494–1513, 2016
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.000 |
| 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.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".