The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Wind power forecasting based on daily wind speed data using machine learning algorithms
Abstract
Abstract Wind energy is a significant and eligible source that has the potential for producing energy in a continuous and sustainable manner among renewable energy sources. However, wind energy has several challenges, such as initial investment costs, the stationary property of wind plants, and the difficulty in finding wind-efficient energy areas. In this study, long-term wind power forecasting was performed based on daily wind speed data using five machine learning algorithms. We proposed a method based on machine learning algorithms to forecast wind power values efficiently. We conducted several case studies to reveal performances of machine learning algorithms. The results showed that machine learning algorithms could be used for forecasting long-term wind power values with respect to historical wind speed data. Furthermore, the results showed that machine learning-based models could be applied to a location different from model-trained locations. This study demonstrated that machine learning algorithms could be successfully used before the establishment of wind plants in an unknown geographical location whether it is logical by using the model of a base location.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Breiman, L. (2001) · Machine Learning · doi:10.1023/a:1010933404324 · Cited by 133,538
Regression shrinkage and selection via the lasso
Tibshirani, R. (1996) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1996.tb02080.x · Cited by 51,482
Advances in neural information processing systems 7
(1996) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(96)90463-0 · Cited by 14,281
XGBoost: A Scalable Tree Boosting System
Chen, T., & Guestrin, C. (2016) · arXiv · doi:10.48550/arxiv.1603.02754 · Cited by 7,104
Support Vector Regression Machines
Drucker, H., Burges, C. J. C., Kaufman, L., Smola, A. J., & Vapnik, V. N. (1996) · Cited by 4,658
Wind Energy Explained: Theory, Design and Application
Manwell, J. F., McGowan, J. G., & Rogers, A. L. (2009) · Wiley eBooks · doi:10.1002/9781119994367 · Cited by 3,022
Wind energy explained: theory, design and application
(2002) · Choice Reviews Online · doi:10.5860/choice.40-2191 · Cited by 1,721
Introduction to Machine Learning
Yu, F. R., & He, Y. (2019) · SpringerBriefs in Electrical and Computer Engineering · doi:10.1007/978-3-030-10546-4_1 · Cited by 1,594
Current status and future advances for wind speed and power forecasting
Jung, J., & Broadwater, R. (2014) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2013.12.054 · Cited by 710
Some Studies in Machine Learning Using the Game of Checkers. II—Recent Progress
Samuel, A. L. (1967) · IBM Journal of Research and Development · doi:10.1147/rd.116.0601 · Cited by 695
Cited by
Artificial intelligence and machine learning in energy systems: A bibliographic perspective
Entezari, A., Aslani, A., Zahedi, R., & Noorollahi, Y. (2023) · Energy Strategy Reviews · doi:10.1016/j.esr.2022.101017 · Cited by 385
Bin Abu Sofian, A. D. A., Lim, H. R., Siti Halimatul Munawaroh, H., Ma, Z., Chew, K. W., & Show, P. L. (2024) · Sustainable Development · doi:10.1002/sd.2885 · Cited by 270
Allal, Z., Noura, H. N., Salman, O., & Chahine, K. (2024) · Journal of Environmental Management · doi:10.1016/j.jenvman.2024.120392 · Cited by 130
Metadata
- Authors
- Demolli, H., Dokuz, A. S., Ecemis, A., & Gokcek, M.
- Venue
- Energy Conversion and Management
- Publisher
- Elsevier BV
- Published
- 2019-10
- Volume
- 198
- Pages
- 111823
- ISSN
- 0196-8904 (ISSN-L)
- OpenAlex
- W2964052759
- Cited by
- 468
- References
- 34
- FWCI
- 15.33
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Wind power forecasting based on daily wind speed data using machine learning algorithms. https://app.cochat.ai/papers/10.1016/j.enconman.2019.111823
- The paper
- Demolli, H., Dokuz, A. S., Ecemis, A., & Gokcek, M. (2019). Wind power forecasting based on daily wind speed data using machine learning algorithms. Energy Conversion and Management. https://doi.org/10.1016/j.enconman.2019.111823
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.