Towards Accurate Root-Alarm Identification: The Causal Bayesian Network Approach
Bibliographic record
Abstract
Abnormalities in modern process industries are reported by alarms. Strong inter-connectivities within different units of a plant lead to annunciations of multiple alarms in a short period of time, which hinders a prompt operator response. A fundamental problem in such alarm floods is to identify the original source of abnormality by finding the directly affected alarm, known as the root cause. This is essentially a causal problem which has been tackled by many non-causal approaches, including transfer entropy and Bayesian network based methods, which despite their successful applications, have their own shortcomings. Causal identification requires intervention. That is, to “intervene” and manually change the distribution of a random variable A, and compare its conditional distribution with respect to another variable B before and during the intervention to examine whether A is caused by B. This acknowledged notion of causality, leads to causal Bayesian networks where unlike Bayesian networks, the edges are truly causal. Nevertheless, intervening the alarms during a fault event is implausible if not impossible, hindering the use of this rich notion of causality in alarm root cause analysis. We tackle this issue by treating abnormalities as uncertain interventions, because they, indeed, intervene the directly affected alarms and change their distributions. We then find the causal Bayesian network that best represents the alarm data. In addition to more-accurate root-cause identification, our causal Bayesian network based method has the ability to discover the root causes under multiple simultaneous abnormalities.
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.005 | 0.019 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.002 |
| Bibliometrics | 0.004 | 0.003 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.002 | 0.003 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
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".