Siamese <scp>DeNPE</scp> network framework for fault detection of batch process
Bibliographic record
Abstract
Abstract In batch processes, it is crucial to ensure safe production by fault detection. However, the long batch duration, limited runs, and strong nonlinearity of the data pose challenges. Incipient faults with small amplitudes further complicate the detection process. To achieve safe production, motivated by deep learning strategies, we propose a new fault detection method of batch process called Siamese deep neighbourhood preserving embedding network (SDeNPE). First, the DeNPE network is constructed by means of NPE and kernel functions, which utilizes the different types of kernel functions in the kernel mapping layer to extract diverse deep nonlinear features and overcome strong nonlinearity in the process data. Then, the Siamese network is used to obtain the different features between the data and improve the recognition of incipient faults. In addition, the deep extraction and Siamese network allow for batches of training data reduction without diminishing the performance of fault detection. Finally, we utilize monitoring statistics to complete the fault detection process. Two batch process cases involving the penicillin fermentation process and the semiconductor etching process demonstrate the superior fault detection performance of the proposed SDeNPE over the other comparison methods.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".