Semi-Supervised Learning Approach for Optimizing Condition-based-Maintenance (CBM) Decisions
Bibliographic record
Abstract
Recent heightened enthusiasm towards Industrial Artificial Intelligence (IAI) and Industrial Internet of Things (IIoT) coupled with developments in smart sensor technologies have resulted in simultaneous incorporation of several advanced Condition Monitoring (CM) technologies within manufacturing and industrial sectors. Efficient utilization of CM data leads to enhanced safety, reliability and availability of manufacturing systems. In this regard, the paper proposes an efficient and novel hybrid Maintenance Decision Support System (MDSS) for fault diagnostic and prognostic considering CM data along with event- triggered data. The proposed MDSS model is a hybrid Machine Learning (ML)-based solution coupled with statistical techniques. In order to find an optimal maintenance policy, we concentrate the attention on a time-dependent Proportional Hazards Model (PHM) augmented with a semi-supervised ML approach. The developed hybrid model is capable of inferring and fusing High-Dimensional and Multi-modal Streaming (HDMS) data sources in an adaptive and autonomous fashion to recommend optimal maintenance decisions without human intervention. To illustrate the complete structure of the proposed MDSS, experimental evaluations are designed based on a dataset provided by NASA containing run-to-failure and CM data associated with aircraft engines. The effectiveness of the proposed model is demonstrated through a comprehensive set of comparisons with different ML algorithms.
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.002 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| 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.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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".