Model evaluation for prognostics: estimating cost saving for the end users
Bibliographic record
Abstract
Unexpected failures of complex equipment such as trains or aircraft introduce superfluous costs, disrupt operation, have an effect on consumer's satisfaction, and potentially decrease safety in practice. One of the objectives of prognostics and health management (PHM) systems is to help reduce the number of unexpected failures by continuously monitoring the components of interest and predicting their failures sufficiently in advance to allow for proper planning. In other words, PHM systems may help turn unexpected failures into expected ones. Recent research has demonstrated the usefulness of data mining to help build prognostic models for PHM but also has identified the need for new model evaluation methods that take into account the specificities of prognostic applications. This paper investigates this problem. First, it reviews classical and recent methods to evaluate data mining models and it explains their deficiencies with respect to prognostic applications. The paper then proposes a novel approach that overcomes these deficiencies. This approach integrates the various costs and benefits involved in prognostics to quantify the cost saving expected from a given prognostic model. From the end user's perspective, the formula is practical as it is easy to understand and requires realistic inputs. The paper illustrates the usefulness of the methods through a real-world case study involving data-mining prognostic models and realistic costs/benefits information. The results show the feasibility of the approach and its applicability to various prognostic applications.
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.003 | 0.015 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".