Early Classification of Industrial Alarm Floods Based on Semisupervised Learning
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.
Bibliographic record
Abstract
Early classification of ongoing alarm floods in industrial monitoring systems is crucial to provide a safe and efficient operation. It can provide online decision support for plant operators to take timely action, without waiting for the end of an alarm flood. In this article, a data-driven approach is proposed to address the early classification problem with unlabeled historical data. To prioritize earlier activated alarms and take advantage of the triggering time information of alarms, a vector representation called exponentially attenuated component (EAC) is used to represent alarm floods. This makes alarm sequences fit for different powerful machine learning algorithms, which can be easily implemented online with acceptable computational complexities. A method based on the time information of unlabeled historical alarm floods is formulated to determine the attenuation coefficient for EAC representation. With the Gaussian mixture model, an efficient semisupervised approach is proposed to provide an early classification of alarm floods using unlabeled historical data. It includes two phases: offline clustering and online classification, where the clustering step is automated in terms of choosing the optimal number of clusters by applying an efficient cluster validity index. The efficiency of the proposed method is validated by the Tennessee Eastman process benchmark and a real industrial dataset.
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 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.000 |
| 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.001 | 0.001 |
| 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 it