Predictive Maintenance and Fault Monitoring Enabled by Machine Learning: Experimental Analysis of a TA-48 Multistage Centrifugal Plant Compressor
Bibliographic record
Abstract
In an increasingly competitive industrial world, the need to adapt to any change at any time has become a major necessity for every industry to remain competitive and survive in their environments. Industries are undergoing rapid and perpetual changes on several levels. Indeed, the latter requires companies to be more reactive and involved in their policies of continuous improvement in order to satisfy their customers and maximize the quantity and quality of production, while keeping the cost of production as low as possible. Reducing downtime is one of the major objectives of these industries of the future. This paper aimed to apply machine learning algorithms on a TA-48 multistage centrifugal compressor for failure prediction and remaining useful life (RUL), i.e., to reduce system downtime using a predictive maintenance (PdM) approach through the adoption of Industry 4.0 approaches. To achieve our goal, we followed the methodology of the predictive maintenance workflow that allows us to explore and process the data for the model training. Thus, a comparative study of different prediction algorithms was carried out to arrive at the final choice, which is based on the implementation of LSTM neural networks. In addition, its performance was improved as the data sets were fed and incremented. Finally, the model was deployed to allow operators to know the failure times of compressors and subsequently ensure minimum downtime rates by making decisions before failures occur.
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.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| 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".