Logic‐based probabilistic network model to detect and track faults in a process system
Bibliographic record
Abstract
Abstract Process systems are becoming complex due to a higher dependency among operational variables and complex control loops. Principal component analysis (PCA) is widely used to reduce the dimensionality of the complex process systems, while Bayesian networks (BNs) are increasingly employed to model relationships among the operational variables. This article integrates these two methods (BN and PCA) through a logic‐based approach to study the fault conditions of a process system. A distillation pilot plant is used to test the integrated approach. The process monitoring data are analyzed using the PCA to identify the abnormality variables while the BN is developed using data‐driven learning. The variable dependency in the BN nodes is learned through maximum likelihood estimation. The results of the proposed approach are compared against the logic‐based full BN model. The study observes that the logic‐based PCA‐BN approach proposed improves the reliability of fault detection. While the logic‐based full BN provides a better understanding of fault propagation path through the unit, which helps track and troubleshoot the detected faults.
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.003 |
| 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.001 |
| 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.004 | 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".