A New Method of Nonlinear Feature Extraction for Multi-Fault Diagnosis of Rotor Systems
Bibliographic record
Abstract
Rotor systems have been extensively used in a variety of industrial applications. However an unexpected failure may cause a break down of the rotational machinery, resulting in production and significant economic losses. Efficient incipient fault diagnosis is therefore critical to the machinery normal operation. Noise and vibration analysis is popular and effective for the rotor fault diagnosis. One of the key procedures in the fault diagnosis is feature extraction and selection. Literature review indicates that only limited research considered the nonlinear property of the feature space by the use of manifold learning algorithms in the field of mechanical fault diagnosis, and nonlinear feature extraction for rotor multi-fault detection has not been studied. This paper reports a new development based on a novel supervised manifold learning algorithm (adaptive locally linear embedding) applied to nonlinear feature extraction for rotor multiple defects identification. The adaptive locally linear embedding (ALLE) combines with the adaptive nearest neighbour algorithm and supervised locally linear embedding (LLE) to provide an adaptive supervised learning. Hence, distinct nonlinear features could be extracted from high-dimensional dataset effectively. Based on ALLE, a new fault diagnosis approach has been proposed. The independent component analysis (ICA) was firstly employed to separate the faulty components of the rotor vibration from the observation data. Then wavelet transform (WT) was used to decompose the recovered signals, and statistical features of frequency bands were hence calculated. Lastly, ALLE was applied to learn the low-dimensional intrinsic structure of the original feature space. The experiments on vibration data of single and coupled rotor faults have demonstrated that sensitive fault features can be extracted efficiently after the ICA-WT-ALLE processing, and the proposed diagnostic system is effective for the multi-fault identification of the rotor system. Furthermore, the proposed method achieves higher performance in terms of the classification rate than other feature extraction methods such as principal component analysis (PCA) and locally linear embedding (LLE).
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".