A Fault Diagnosis Method for Wind Turbine Gearbox under High Noise Based on Adaptive Probability Random Forest
Bibliographic record
Abstract
A fault diagnosis method for wind turbine gearbox based on adaptive probability random forest is proposed to address the issue of noise pollution in SCADA data of wind turbine gearbox.Firstly, SMOTE oversampling is used to balance sample categories, and then CART is trained and classified by constructing multiple balanced subsets.The sample error rate represents the weight of sample ambiguity, and the label uncertainty is determined.Monte Carlo simulation is used to calculate the mean distribution of features, which is fused with each sample instance to obtain the uncertainty of sample features.Utilizing adaptive labels and sample uncertainties as inputs to probabilistic random forest can enhance the ability to manage feature noise and label noise, thereby improving the robustness of fault diagnosis.Conduct an experimental evaluation using the SCADA dataset of wind turbine gearbox.The results show that this model outperforms other methods in terms of false alarm rate, false alarm rate, and F1 rating metrics when dealing with missing values, Gaussian noise, and label noise in the dataset, as compared to other methods.This method is of great significance for improving the accuracy and robustness of wind turbine gearbox 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.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| 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".