A variable mosquito flying optimization‐based hybrid artificial neural network model for the alarm tuning of process fault detection systems
Bibliographic record
Abstract
Abstract Chemical process systems are becoming extremely complex due to increased automation, heat and mass intensification, and expectation of higher efficiency. Many fault detection and diagnostic methods have been proposed for processing facilities. However, managing the missed alarm rate and the false alarm rate (FAR) in the detection and isolation of the fault is crucial in the complex process systems. This work presents a new data‐driven fault detection model using an artificial neural network (ANN) and variable mosquito flying optimization (V‐MFO) technique. The model is based on the optimization of the number of neurons in the hidden layer of the neural network. Subsequently, the model parameters have been tuned using the V‐MFO algorithm for maximizing the fault detection rate (FDR) while minimizing the FAR. The proposed fault detection method has been implemented on the Tennessee Eastman benchmark process. The performance of the proposed model has been evaluated in terms of accuracy, FDR and FAR against well‐known statistical‐based methods such as principal component analysis (PCA), kernel PCA, semiparametric PCA, modified independent component analysis, k nearest neighbors, linear discriminant analysis, support vector machine, and the ANN. The model is observed to be competitive for fault detection among the test algorithms. It recorded slightly improved accuracy and FDR. The proposed model also resulted in 0.6% improvement in the FAR and 8% improvement in missed detection rate compared to the simple ANN. This method provides an efficient fault detection tool for complex process systems.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 0.000 |
| 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".