Improved ensemble local mean decomposition based on cubic trigonometric cardinal spline interpolation and its application for rotating machinery fault diagnosis
Bibliographic record
Abstract
Ensemble local mean decomposition has been gradually introduced into mechanical vibration signal processing due to its excellent performance in electroencephalogram signal analysis. However, an unsatisfactory problem is that ensemble local mean decomposition cannot effectively process vibration signals of complex mechanical system due to the constraints of moving average. The process of moving average is time-consuming and inaccurate in complex signal analysis. Therefore, an improved ensemble local mean decomposition method called C-ELMD with modified envelope algorithm based on cubic trigonometric cardinal spline interpolation is proposed in this article. First, the shortcomings in sifting process of ensemble local mean decomposition is discussed and, furthermore, advantages and disadvantages of the common interpolation methods adopted to improve ensemble local mean decomposition are compared. Then, cubic trigonometric cardinal spline interpolation is employed to construct the local mean and envelope curves in a more precise way. In addition, the influence of shape-controlling parameter on envelope estimation accuracy in cubic trigonometric cardinal spline interpolation is also discussed in detail to select an optimal shape-controlling parameter. The effectiveness of cubic trigonometric cardinal spline interpolation for improving the accuracy of ensemble local mean decomposition is demonstrated using a synthetic signal. Finally, the proposed cubic trigonometric cardinal spline interpolation is tested to be effective in gear and bearing fault detection and diagnosis.
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.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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".