Multi-head attention transformer and Bayesian inference recommendation engine-based blade icing detection framework for wind turbines
Bibliographic record
Abstract
Abstract Icing accumulation on wind turbine blades significantly diminishes power output and revenue generation. Traditional icing detection methods, including sensor-based and model-based approaches, heavily rely on domain knowledge, contrasting with data-centric methods. However, a balanced distribution of normal and abnormal instances in wind turbine data is imperative. In this research, we propose a framework for blade icing detection utilizing a multi-head attention mechanism-based transformer. Supervisory control and data acquisition (SCADA) data is collected from wind turbines on Hitra Island, Norway, with a 10-min average interval over 12 months. To address dimensionality challenges, an autoencoder-based data compression technique is employed, followed by the application of a multi-head attention transformer for icing detection. We investigate and compare the performance of two baseline deep learning methods: convolutional neural network (CNN) and Convolutional Neural Network-Long Short-Term Memory (CNN-LSTM), against our proposed transformer framework. The results demonstrate superior accuracy and F1-score by the proposed model compared to CNN and CNN-LSTM. Additionally, we delve into a recommendation engine grounded in Bayesian inference. This engine assesses the risk associated with specific control actions, estimating conditional risk for icing and non-icing events on wind turbine blades. This Bayesian recommendation engine holds promise for real-time deployment scenarios.
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".