A novel fault classification method using reconstructed distance‐based discriminant locality preserving projection for industrial processes
Bibliographic record
Abstract
Abstract Fault detection and classification is a crucial issue in modern industrial processes for ensuring steady operation and high product quality. The process data collected and stored fully reflect the equipment running state and the production process. Moreover, the extracted nonlinear features can directly affect the effectiveness of the data‐driven fault classification model. In this paper, a novel fault classification method based on nonlinear feature extraction using reconstructed distance‐based discriminant locality preserving projection (RD‐DLPP) is proposed. First, a hypersphere model for each class of data is developed according to the spatial structures and classes information in high‐dimensional space. The hyperspheres are used as indicators to evaluate the discriminatory difficulty of samples. Second, the constraints of the correlations between the k ‐nearest neighbour points of the sample and the hypersphere are introduced, which can efficiently reconstruct new measure metrics between the sample and its k ‐nearest neighbour points. Finally, an improved fault classification model based on RD‐DLPP is established for the construction of the highly discriminant subspace. The Bayesian decision is then used to classify the samples. The feasibility and efficiency of the proposed method are verified by the Tennessee Eastman process as a case study.
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".