FPCA-SETCN: A Novel Deep Learning Framework for Remaining Useful Life Prediction
Bibliographic record
Abstract
The accurate prediction of remaining useful life (RUL) can serve as a reliable foundation for equipment maintenance, thereby effectively reducing the incidence of failure and maintenance costs. In this study, a novel deep learning (DL) framework that incorporates functional principal component analysis (FPCA) and enhanced temporal convolutional network (TCN) is proposed for RUL prediction. Precisely, FPCA is employed to capture the changing patterns in multistream degradation trajectories. Subsequently, the reconstructed signals from FPCA are fed into a convolutional block for extracting deep-level features. An enhanced squeeze-and-excitation (ESE) block is then incorporated into the network for adaptive feature recalibration, enhancing the network’s ability to focus on the most relevant information. The framework includes a TCN module augmented with hybrid attention mechanisms, comprising ESE and spatial attention (SA) blocks, to optimally capture forward and backward sequence information of the feature tensor. The efficiency and feasibility of the proposed approach are demonstrated through case studies on both the Commercial Modular Aero-Propulsion System Simulation (C-MAPSS) and Center for Advanced Life Cycle Engineering (CALCE) battery datasets. The proposed method achieves the lowest root-mean-square error (RMSE) of 15.56 on the C-MAPSS dataset and 0.03 on the CALCE dataset. The comparative studies highlight the superiority of the proposed network over existing DL 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.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| 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".