Two-Dimensional Optimization Framework of Online Interpretable Time-Frequency Feature Learning for Practical Machine Health Monitoring
Bibliographic record
Abstract
Data-driven feature extraction for machine health monitoring has garnered significant attention, yet two key limitations remain unaddressed: lack of interpretability and the need for extensive historical fault data. To overcome these problems, an online two-dimensional optimization framework is proposed that enables interpretable time-frequency feature extraction and health index (HI) construction without requiring faulty samples for model training. Our approach introduces a convex hull-based closest point optimization model for estimating time-frequency instances and learning interpretable time-frequency features. By leveraging a small set of baseline vibration samples and recent online data, rapid fault diagnosis can be achieved based on optimized interpretable time-frequency features. This method also facilitates long-term degradation tracking by constructing and updating an HI from collected time-frequency spectrograms. Once machine faults appear, updated time-frequency features can show apparent and interpretable fault signatures for prompt fault alarming. Moreover, the proposed framework allows continuous HI updates for incipient fault detection and degradation tracking. The proposed framework is validated by using two run-to-failure datasets and ablation experiments are conducted to demonstrate its superiority.
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.003 |
| 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.001 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".