Power production prediction of wind turbines using a fusion of MLP and ANFIS networks
Bibliographic record
Abstract
Access to accurate power production prediction of a wind turbine in future hours enables operators to detect possible underperformance and anomalies in advance. This may enable more proactive and strategic operations optimisation. This study examines common Supervisory Control And Data Acquisition (SCADA) data over a period of 20 months for 21 pitch regulated 2.3 MW turbines. In this study, an algorithm is proposed to impute values of data that are missing, out‐of‐range, or outliers. It is shown that an appropriate combination of a decision tree and mean value for imputation can improve the data analysis and prediction performance by the creation of a smoother dataset. In addition, principal component analysis is employed to extract parameters with power production influence based on all available signals in the SCADA data. Then, a new data fusion technique is applied, combining dynamic multilayer perceptron (MLP) and adaptive neuro‐fuzzy inference system (ANFIS) networks to predict future performance of wind turbines. This prediction is made on a scale of one‐hour intervals. This novel combination of feature extraction, imputation, and MLP/ANFIS fusion performs well with favourably low prediction error levels. Thus, such an approach may be a valuable tool for turbine power production prediction.
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.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 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".