KPCA and AE Based Local-Global Feature Extraction Method for Vibration Signals of Rotating Machinery
Bibliographic record
Abstract
Feature extraction plays a key role in fault diagnosis of rotating machinery. Many methods reported in the literature are based on masses of labeled data and need much prior knowledge to select the most discriminating features or establish a complex deep-learning model. To solve the dilemma, a novel feature extraction method based on kernel principal component analysis (KPCA) and an autoencoder (AE), namely, SFS-KPCA-AE, is presented in this paper to automatically extract the most discriminative features from the frequency spectrum of vibration signals. First, fast Fourier transform is calculated on the entire vibration signal to get the frequency spectrum. Next, the spectrum is divided into several segments. Then, local-global feature extraction is performed by applying KPCA to these segments. Finally, an AE is employed to obtain the low-dimensional representations of the high-dimensional global feature. The proposed feature extraction method combined with a classifier achieves fault diagnosis for rotating machinery. A rotor dataset and a bearing dataset are utilized to validate the performance of the proposed method. Experimental results demonstrate that the proposed method achieved satisfactory performance in feature extraction when training samples or motor load changed. By comparing with other methods, the superiority of the proposed SFS-KPCA-AE is verified.
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.000 | 0.001 |
| 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.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| 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".