Early bearing fault diagnosis based on improved SFLA and ELM network
Post-publication record
Source: Retraction Watch, joined by DOI. OpenAlex records retraction as is_retracted, a boolean over a state space with at least four values, so it cannot express an expression of concern, a correction or a reinstatement; it reports them as false, which reads as “fine”.
Bibliographic record
Abstract
In this paper, an extreme learning machine (ELM) network based on an improved shuffled frog leaping algorithm (CCSFLA) is applied in early bearing fault diagnosis. ELM is a new type of single layer forward network. Although the generalization is stronger compared with traditional neural networks, a random setup of initial parameters increases instability of the network. An improved SFLA based on sinusoidal chaotic mapping with infinite collapses and constriction factors (CCSFLA) is proposed in this paper to optimize the ELM and obtain a CCSFLA–ELM model. Results show that the CCSFLA–ELM model can be used for optimization and that it improved the recognition of early bearing fault 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.000 |
| Science and technology studies | 0.001 | 0.001 |
| 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".