Condition‐based Maintenance Optimization Using Neural Network‐based Health Condition Prediction
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
Artificial neural network (ANN)‐based methods have been extensively investigated for equipment health condition prediction. However, effective condition‐based maintenance (CBM) optimization methods utilizing ANN prediction information are currently not available due to two key challenges: (i) ANN prediction models typically only give a single remaining life prediction value, and it is hard to quantify the uncertainty associated with the predicted value; (ii) simulation methods are generally used for evaluating the cost of the CBM policies, while more accurate and efficient numerical methods are not available, which is critical for performing CBM optimization. In this paper, we propose a CBM optimization approach based on ANN remaining life prediction information, in which the above‐mentioned key challenges are addressed. The CBM policy is defined by a failure probability threshold value. The remaining life prediction uncertainty is estimated based on ANN lifetime prediction errors on the test set during the ANN training and testing processes. A numerical method is developed to evaluate the cost of the proposed CBM policy more accurately and efficiently. Optimization can be performed to find the optimal failure probability threshold value corresponding to the lowest maintenance cost. The effectiveness of the proposed CBM approach is demonstrated using two simulated degradation data sets and a real‐world condition monitoring data set collected from pump bearings. The proposed approach is also compared with benchmark maintenance policies and is found to outperform the benchmark policies. The proposed CBM approach can also be adapted to utilize information obtained using other prognostics methods. Copyright © 2012 John Wiley & Sons, Ltd.
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.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 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