Short-term Wind Power Prediction Based on Soft Margin Multiple Kernel Learning Method
Bibliographic record
Abstract
For short-term wind power prediction, a soft margin multiple kernel learning (MKL) method is proposed. In order to improve the predictive effect of the MKL method for wind power, a kernel slack variable is introduced into each base kernel to solve the objective function. Two kinds of soft margin MKL methods based on hinge loss function and square hinge loss function can be obtained when hinge loss functions and square hinge loss functions are selected. The improved methods demonstrate good robustness and avoid the disadvantage of the hard margin MKL method which only selects a few base kernels and discards other useful kernels when solving the objective function, thereby achieving an effective yet sparse solution for the MKL method. In order to verify the effectiveness of the proposed method, the soft margin MKL method was applied to the second wind farm of Tianfeng from Xinjiang for short-term wind power single-step prediction, and the single-step and multi-step predictions of short-term wind power was also carried out using measured data provided by alberta electric system operator (AESO). Compared with the support vector machine (SVM), extreme learning machine (ELM), kernel based extreme learning machine (KELM) methods as well as the SimpleMKL method under the same conditions, the experimental results demonstrate that the soft margin MKL method with different loss functions can efficiently achieve higher prediction accuracy and good generalization performance for short-term wind power prediction, which confirms the effectiveness of the method.
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.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.001 |
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".