Machine learning models for condition-based maintenance with regular truncated signals
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
Condition-based maintenance (CBM) of industrial machines depends on the continuous, real-time monitoring of the machine’s operational condition via smart sensors attached to different components on the machine. The problem of regularly spaced missing data, which can occur due to a variety of hardware or software issues, is one that is often overlooked in the literature surrounding CBM in industrial machines. Such missing data can cause issues in interpreting the true operational state of the machine, which can reduce the effectiveness of CBM processes. In this paper, we examine the capabilities of five data imputation techniques for handling this regular missing data and examine the impact these techniques have on machine learning (ML) classification algorithms for machine fault diagnosis. We examine the following techniques: simple mean imputation, mean imputation with outliers removed, best and worst-case imputation, and previous day imputation. Each of these methods is configured with the specific parameters that they will only consider data from the previous 24 hours, to ensure that the data is recent, and adequately represents the current status of the machine. The efficacy of each method at accurately reconstructing the missing data and the impact they have on ML classification is recorded in the results. The models are evaluated on a real-world dataset and are evaluated on a variety of common performance metrics.
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.006 | 0.015 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.006 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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