MétaCan
Menu
Back to cohort
Record W2789652994 · doi:10.1109/tie.2018.2795573

Detection of Frequent Alarm Patterns in Industrial Alarm Floods Using Itemset Mining Methods

2018· article· en· W2789652994 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueIEEE Transactions on Industrial Electronics · 2018
Typearticle
Languageen
FieldComputer Science
TopicData Mining Algorithms and Applications
Canadian institutionsUniversity of Alberta
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsALARMComputer scienceData miningManual fire alarm activationVisualizationIdentification (biology)Real-time computingEngineering

Abstract

fetched live from OpenAlex

The presence of alarm floods is identified as the main reason for low efficiency of alarm systems and the leading cause of many industrial accidents. In practice, a commonly used technique to deal with alarm floods is dynamic alarm suppression, which temporally suppresses predefined groups of alarms following unplanned events that are not relevant or meaningful to the operator. However, determining what alarms to suppress from a pool of thousands of configured alarm variables remains a challenging problem. This paper proposes a data-driven method to find such alarm groups by detecting frequent patterns in alarm floods from historical alarm data. Main contributions of this study are: 1) the identification and extraction of alarm floods are formulated; 2) frequent alarm patterns are defined and itemset mining methods are adapted to discover meaningful patterns in alarm floods; and 3) new visualization techniques are proposed based on exiting plots to show alarm floods and alarm patterns. The effectiveness of the proposed method is demonstrated by application to real industrial data.

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.

Full frame distilled prediction

Teacher imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Other design · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.950
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.002
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.086
GPT teacher head0.338
Teacher spread0.252 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it