<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article article-type="research-article" dtd-version="2.3" xml:lang="EN" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Energy Res.</journal-id>
<journal-title>Frontiers in Energy Research</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Energy Res.</abbrev-journal-title>
<issn pub-type="epub">2296-598X</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">840519</article-id>
<article-id pub-id-type="doi">10.3389/fenrg.2022.840519</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Energy Research</subject>
<subj-group>
<subject>Original Research</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>Regional Ultra-Short-Term Wind Power Combination Prediction Method Based on Fluctuant/Smooth Components Division</article-title>
<alt-title alt-title-type="left-running-head">Li et&#x20;al.</alt-title>
<alt-title alt-title-type="right-running-head">Regional Wind Power Combination Prediction</alt-title>
</title-group>
<contrib-group>
<contrib contrib-type="author" corresp="yes">
<name>
<surname>Li</surname>
<given-names>Yalong</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
<xref ref-type="corresp" rid="c001">&#x2a;</xref>
<uri xlink:href="https://loop.frontiersin.org/people/1607214/overview"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Yan</surname>
<given-names>Licheng</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
</contrib>
<contrib contrib-type="author">
<name>
<surname>He</surname>
<given-names>Hao</given-names>
</name>
<xref ref-type="aff" rid="aff2">
<sup>2</sup>
</xref>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Zha</surname>
<given-names>Wenting</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
</contrib>
</contrib-group>
<aff id="aff1">
<sup>1</sup>
<institution>School of Mechanical Electronic and Information Engineering</institution>, <institution>China University of Mining and Technology (Beijing)</institution>, <addr-line>Beijing</addr-line>, <country>China</country>
</aff>
<aff id="aff2">
<sup>2</sup>
<institution>Electric Power Research Institute</institution>, <institution>State Grid Jiangxi Electric Power Co., Ltd.</institution>, <addr-line>Nanchang</addr-line>, <country>China</country>
</aff>
<author-notes>
<fn fn-type="edited-by">
<p>
<bold>Edited by:</bold> <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/1056181/overview">Fengji Luo</ext-link>, The University of Sydney, Australia</p>
</fn>
<fn fn-type="edited-by">
<p>
<bold>Reviewed by:</bold> <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/1056529/overview">Chun Sing Lai</ext-link>, Brunel University London, United&#x20;Kingdom</p>
<p>
<ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/1019911/overview">Davide Astolfi</ext-link>, University of Perugia, Italy</p>
</fn>
<corresp id="c001">&#x2a;Correspondence: Yalong Li, <email>lylwyyx@163.com</email>
</corresp>
<fn fn-type="other">
<p>This article was submitted to Smart Grids, a section of the journal Frontiers in Energy Research</p>
</fn>
</author-notes>
<pub-date pub-type="epub">
<day>02</day>
<month>03</month>
<year>2022</year>
</pub-date>
<pub-date pub-type="collection">
<year>2022</year>
</pub-date>
<volume>10</volume>
<elocation-id>840519</elocation-id>
<history>
<date date-type="received">
<day>21</day>
<month>12</month>
<year>2021</year>
</date>
<date date-type="accepted">
<day>04</day>
<month>02</month>
<year>2022</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#xa9; 2022 Li, Yan, He and Zha.</copyright-statement>
<copyright-year>2022</copyright-year>
<copyright-holder>Li, Yan, He and Zha</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/">
<p>This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these&#x20;terms.</p>
</license>
</permissions>
<abstract>
<p>When multiple scattered wind farms are connected to the power grid, the meteorological and geographic information data used for power prediction of a single wind farm are not suitable for the regional wind power prediction of the dispatching department. Therefore, based on the regional wind power historical data, this study proposes a combined prediction method according to data decomposition. Firstly, the original sequence processed by the extension methods is decomposed into several regular components by Complete Ensemble Empirical Mode Decomposition with Adaptive Noise (CEEMDAN). All the components are classified into two categories: fluctuant components and smooth components. Then, according to the characteristics of different data, the long short-term memory (LSTM) network and autoregressive integrated moving average (ARIMA) model are used to model the fluctuant components and the smooth components, respectively, and obtain the predicted values of each component. Finally, the predicted data of all components are accumulated, which is the final predicted result of the regional ultra-short-term wind power. The feasibility and accuracy of this method are verified by the comparative analysis.</p>
</abstract>
<kwd-group>
<kwd>wind power prediction</kwd>
<kwd>CEEMDAN</kwd>
<kwd>LSTM network</kwd>
<kwd>ARIMA</kwd>
<kwd>combination prediction</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1">
<title>Introduction</title>
<p>With the vigorous development of wind resources in China, multiple wind farms are connected to the provincial and regional power grid at the same time. Different wind farms are far away and have dispersion characteristics (<xref ref-type="bibr" rid="B5">Gan et&#x20;al., 2016</xref>). In order to face the impact of cluster grid connection on the power system and the power market, it is necessary to predict the regional wind power when making decisions such as operating plans and market transactions (<xref ref-type="bibr" rid="B23">Zalzar et&#x20;al., 2020</xref>). In recent years, regional wind power prediction has become a key technology to improve the operation level of large-scale wind power integration into a power system (<xref ref-type="bibr" rid="B18">Wang et&#x20;al., 2021</xref>). The traditional regional wind power prediction is to accumulate the power prediction results of sub-wind farms or divided small-region wind farms (<xref ref-type="bibr" rid="B10">Lobo and Sanchez, 2012</xref>). However, error may occur in the wind power prediction for each wind farm, and it is difficult to consider the dispersion characteristics of prediction error in accumulation (<xref ref-type="bibr" rid="B16">Wang C et&#x20;al., 2017</xref>). In addition, the weather forecasts and geographical features used in the power prediction of each wind farm are different from each other. They are no longer applicable to regional wind power prediction. Therefore, the dispatching department can use the stored regional historical wind power data to complete the forecast, which avoids the accumulation process and does not rely on individual wind&#x20;farms.</p>
<p>With the rapid development of the smart grid, environmental sensors, and related technologies, artificial intelligence methods have been gradually applied in ultra-short-term wind power prediction. Compared with the traditional support vector regression (SVR) and backpropagation (BP) algorithms, recurrent neural network (RNN) is good at processing time series data. In response to the problem of gradient disappearance or gradient explosion about RNN, the input gate, the output gate, and the forget gate have been introduced in the long short-term memory network (<xref ref-type="bibr" rid="B6">Hochreiter and Schmidhuber, 1997</xref>), which can fully reflect the long-term historical information in time series data and showing better performance. <xref ref-type="bibr" rid="B22">Xu et&#x20;al. (2021</xref>) showed that, by combining a similar day with an LSTM network, the ultra-short-term wind power prediction method had been proposed to improve the prediction accuracy. <xref ref-type="bibr" rid="B20">Wu et&#x20;al. (2021</xref>) proposed a spatiotemporal correlation model for the ultra-short-term wind power prediction based on CNN-LSTM. By constructing the error following the forget gate-based LSTM model, the ultra-short-term wind power prediction has been achieved with less prediction error (<xref ref-type="bibr" rid="B24">Zhang et&#x20;al., 2020</xref>). In order to improve the accuracy and reduce the training time, a multilayer bidirectional gated recurrent unit (GRU) is constructed (<xref ref-type="bibr" rid="B2">Chen et&#x20;al., 2021</xref>). However, meteorological data have been used in the abovementioned works, which are not suitable for the regional ultra-short-term wind power prediction. Machine learning methods continue to learn the mapping relationship between input data and output data through training a large number of data samples (<xref ref-type="bibr" rid="B3">Elsaraiti and Merabet, 2021</xref>), providing improvement for power prediction only based on historical data. In order to further explore the variation law of wind power data with time and improve the prediction accuracy of training models, many scholars choose wavelet decomposition, Empirical Mode Decomposition (EMD) (<xref ref-type="bibr" rid="B7">Huang et&#x20;al., 1998</xref>), Ensemble Empirical Mode Decomposition (EEMD) (<xref ref-type="bibr" rid="B21">Wu and Huang, 2011</xref>), and other methods to decompose the historical data into several regular subsequences (<xref ref-type="bibr" rid="B14">Safari et&#x20;al., 2017</xref>). These methods integrated with the machine learning method can build a combination model. Using the discrete wavelet transform to decompose the non-stationary wind power time series, the obtained components have more stationarity, which is easier to predict (<xref ref-type="bibr" rid="B9">Liu et&#x20;al., 2019</xref>). Similarly, three-stage wavelet decomposition is adopted to smooth the original wind power time series, and the prediction models for each sub-series sample are developed based on the LSTM network. The proposed method overcomes the poor prediction of a single LSTM network for the non-stationary signals (<xref ref-type="bibr" rid="B19">Wang et&#x20;al., 2019</xref>). Compared with the wavelet decomposition technique, the EMD method has more advantages in dealing with nonlinear, non-stationary, and complex time series data. EMD is used to decompose the power load data, and LSTM is used to train the subsequences (<xref ref-type="bibr" rid="B1">Bedi and Toshniwal, 2018</xref>). The EEMD-SE technique is used to decompose the original wind power series into a number of subsequences with obvious complexity differences. The forecasting model of each subsequence is created by full-parameters continued fraction (<xref ref-type="bibr" rid="B17">Wang HZ et&#x20;al., 2017</xref>). A novel fault diagnosis method based on EEMD and optimized Elman_AdaBoost is proposed to get better accuracy and real-time processing performance (<xref ref-type="bibr" rid="B4">Fu et&#x20;al., 2018</xref>). In practice, EMD and EEMD have some defects, including mode mixing, large calculation, and difficulties in eliminating auxiliary noise, which limit their application (<xref ref-type="bibr" rid="B12">Mahmoud et&#x20;al., 2017</xref>). Compared with EMD and EEMD, Complete Ensemble Empirical Mode Decomposition with Adaptive Noise (CEEMDAN) (<xref ref-type="bibr" rid="B15">Torres et&#x20;al., 2011</xref>) is more suitable for data decomposition. CEEMDAN is used to decompose wind speed data, and each component is trained based on an improved BP neural network (<xref ref-type="bibr" rid="B13">Qu et&#x20;al., 2018</xref>). The original wind power is decomposed by the CEEMDAN to eliminate the noise of the data. Then, the decomposed wind power is reconstructed into new subsequences (<xref ref-type="bibr" rid="B11">Lu et&#x20;al., 2021</xref>). In addition, to improve the prediction accuracy, the end effect of the intrinsic mode functions (IMFs) obtained by CEEMDAN also needs to be resolved (<xref ref-type="bibr" rid="B8">Huang et&#x20;al., 2003</xref>). There are usually two methods to suppress the end effect. The first is to replace spline interpolation using different interpolation methods, but the degree of suppression is limited. The second is to increase the sequence length by extending the left and right ends of the original sequence, which is proved to be more suitable.</p>
<p>Aiming at the problem of regional wind power prediction with weak regularity, this study proposes a combined prediction method based on modal decomposition and artificial intelligence technology. Through actual analysis, the accuracy of the combined prediction method will be tested by comparison with the actual engineering level and the prediction results of other methods. The main contributions are as follows:<list list-type="simple">
<list-item>
<p>1) CEEMDAN is used to decompose wind power data to solve the problem of mode mixing and difficulties in eliminating auxiliary&#x20;noise.</p>
</list-item>
<list-item>
<p>2) LSTM, which can reflect the long-term historical information in time series, is used to predict the fluctuant components of wind&#x20;power.</p>
</list-item>
<list-item>
<p>3) According to the different characteristics of fluctuant and smooth components, LSTM and ARIMA are selected to predict the wind power, respectively, and the prediction results are further combined and optimized.</p>
</list-item>
</list>
</p>
<sec id="s1-1">
<title>Processing and Division of Regional Wind Power Historical Data</title>
<p>Before decomposition, the end points of the regional wind power historical data are extended to suppress the end effect. After decomposition, the decomposed subsequences are divided into two categories: fluctuant components and smooth components.</p>
</sec>
<sec id="s1-2">
<title>Data Extension Method</title>
<p>The existing extension methods have certain requirements for the original data, making it inapplicable for wind power data because regularity is not obvious. In order to suppress the end effect as much as possible, two different methods are used to deal with the left and right end points, respectively. For the left end points, the data of two pairs of extreme points are extracted forward. In contrast, for the right end points, the data of the two pairs of extreme points are extracted in a symmetrical continuation manner. The extension process is shown in <xref ref-type="fig" rid="F1">Figure&#x20;1</xref>.</p>
<fig id="F1" position="float">
<label>FIGURE 1</label>
<caption>
<p>Diagram of the data extension process.</p>
</caption>
<graphic xlink:href="fenrg-10-840519-g001.tif"/>
</fig>
</sec>
<sec id="s1-3">
<title>Complete Ensemble Empirical Mode Decomposition With Adaptive Noise</title>
<p>CEEMDAN is based on EMD and EEMD. In order to eliminate end effect and reconstruction errors, CEEMDAN replaces the noise data added by EEMD with adaptive white noise. The complete decomposition steps of CEEMDAN are as follows.<list list-type="simple">
<list-item>
<p>1) First, add the <italic>I</italic> group of normally distributed white noise data <italic>w</italic>
<sub>
<italic>i</italic>
</sub>(<italic>t</italic>) to the regional wind power historical data <italic>s</italic>(<italic>t</italic>). Construct the <italic>I</italic> group of new series <italic>s</italic>
<sub>
<italic>i</italic>
</sub>(<italic>t</italic>) (<italic>i</italic>&#x20;&#x3d; 1, 2, &#xb7;&#xb7;&#xb7; <italic>I</italic>). After EMD decomposition is performed to obtain the average value, the first modal component IMF<sub>1</sub>(<italic>t</italic>) is obtained as follows:</p>
</list-item>
</list>
<disp-formula id="e1">
<mml:math id="m1">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="normal">s</mml:mi>
<mml:mi mathvariant="normal">i</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mtext>&#x2002;</mml:mtext>
<mml:mo>&#x3d;</mml:mo>
<mml:mtext>&#x200a;</mml:mtext>
<mml:mtext>&#x200a;</mml:mtext>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>&#x3b5;</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>
</mml:mo>
</mml:mrow>
</mml:math>
<label>(1)</label>
</disp-formula>
<disp-formula id="e2">
<mml:math id="m2">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>IMF</mml:mi>
</mml:mrow>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mtext>&#x2002;</mml:mtext>
<mml:mo>&#x3d;</mml:mo>
<mml:mtext>&#x2002;</mml:mtext>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mi>I</mml:mi>
</mml:mfrac>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>I</mml:mi>
</mml:munderover>
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mi>IMF</mml:mi>
</mml:mrow>
<mml:mn>1</mml:mn>
<mml:mi>i</mml:mi>
</mml:msubsup>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>
</mml:mo>
<mml:mtext>&#x2002;</mml:mtext>
</mml:mrow>
</mml:mstyle>
</mml:mrow>
</mml:math>
<label>(2)</label>
</disp-formula>where <italic>&#x3b5;</italic>
<sub>0</sub> denotes the weight coefficient of Gaussian white noise and IMF<sub>1</sub>
<sup>
<italic>i</italic>
</sup>(<italic>t</italic>) denotes the first IMF after EMD decomposition of <italic>s</italic>
<sub>
<italic>i</italic>
</sub>(<italic>t</italic>).<list list-type="simple">
<list-item>
<p>2) Subtracting IMF<sub>1</sub>(<italic>t</italic>) from <italic>s</italic>(<italic>t</italic>), the first residual component <italic>r</italic>
<sub>1</sub>(<italic>t</italic>) is obtained as follows:</p>
</list-item>
</list>
<disp-formula id="e3">
<mml:math id="m3">
<mml:mrow>
<mml:msub>
<mml:mi>r</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mtext>&#x2002;</mml:mtext>
<mml:mo>&#x3d;</mml:mo>
<mml:mtext>&#x2002;</mml:mtext>
<mml:mi mathvariant="normal">s</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mtext>&#x2002;</mml:mtext>
<mml:mo>&#x2212;</mml:mo>
<mml:mtext>&#x2002;</mml:mtext>
<mml:msub>
<mml:mrow>
<mml:mi>IMF</mml:mi>
</mml:mrow>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>
</mml:mo>
</mml:mrow>
</mml:math>
<label>(3)</label>
</disp-formula>
<list list-type="simple">
<list-item>
<p>3) Continue to do EMD decomposition on <italic>r</italic>
<sub>1</sub>(<italic>t</italic>) &#x2b; <italic>&#x3b5;</italic>
<sub>1</sub>
<italic>E</italic>
<sub>1</sub>[<italic>w</italic>
<sub>
<italic>i</italic>
</sub>(<italic>t</italic>)] to obtain the IMF<sub>2</sub>(<italic>t</italic>) and <italic>r</italic>
<sub>2</sub>(<italic>t</italic>), as shown in <xref ref-type="disp-formula" rid="e4">Eqs 4</xref>,&#x20;<xref ref-type="disp-formula" rid="e5">5</xref>:</p>
</list-item>
</list>
<disp-formula id="e4">
<mml:math id="m4">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>IMF</mml:mi>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mtext>&#x2002;</mml:mtext>
<mml:mo>&#x3d;</mml:mo>
<mml:mtext>&#x2002;</mml:mtext>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mi>I</mml:mi>
</mml:mfrac>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>I</mml:mi>
</mml:munderover>
<mml:mrow>
<mml:msub>
<mml:mi>E</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mrow>
<mml:mo>{</mml:mo>
<mml:msub>
<mml:mi>r</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mtext>&#x2002;</mml:mtext>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>&#x3b5;</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:msub>
<mml:mi>E</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>]</mml:mo>
</mml:mrow>
<mml:mo>}</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:mstyle>
<mml:mo>
</mml:mo>
</mml:mrow>
</mml:math>
<label>(4)</label>
</disp-formula>where <italic>E</italic>1(&#xb7;) denotes the first component after EMD decomposition:<disp-formula id="e5">
<mml:math id="m5">
<mml:mrow>
<mml:msub>
<mml:mi>r</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mtext>&#x2002;</mml:mtext>
<mml:mo>&#x3d;</mml:mo>
<mml:mtext>&#x2002;</mml:mtext>
<mml:msub>
<mml:mi>r</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mtext>&#x2002;</mml:mtext>
<mml:mo>&#x2212;</mml:mo>
<mml:mtext>&#x2002;</mml:mtext>
<mml:msub>
<mml:mrow>
<mml:mi>IMF</mml:mi>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>
</mml:mo>
</mml:mrow>
</mml:math>
<label>(5)</label>
</disp-formula>
<list list-type="simple">
<list-item>
<p>4) Repeat the process of Step 3. Then, IMF<sub>
<italic>h</italic>
</sub>(<italic>t</italic>) and <italic>r</italic>
<sub>
<italic>h</italic>
</sub>(<italic>t</italic>) can be calculated as follows:</p>
</list-item>
</list>
<disp-formula id="e6">
<mml:math id="m6">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>IMF</mml:mi>
</mml:mrow>
<mml:mi>h</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mtext>&#x2002;</mml:mtext>
<mml:mo>&#x3d;</mml:mo>
<mml:mtext>&#x2002;</mml:mtext>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mi>I</mml:mi>
</mml:mfrac>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>I</mml:mi>
</mml:munderover>
<mml:mrow>
<mml:msub>
<mml:mi>E</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mrow>
<mml:mo>{</mml:mo>
<mml:msub>
<mml:mi>r</mml:mi>
<mml:mrow>
<mml:mi>h</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mtext>&#x2002;</mml:mtext>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>&#x3b5;</mml:mi>
<mml:mrow>
<mml:mi>h</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mi>E</mml:mi>
<mml:mrow>
<mml:mi>h</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>]</mml:mo>
</mml:mrow>
<mml:mo>}</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:mstyle>
<mml:mo>
</mml:mo>
</mml:mrow>
</mml:math>
<label>(6)</label>
</disp-formula>
<disp-formula id="e7">
<mml:math id="m7">
<mml:mrow>
<mml:msub>
<mml:mi>r</mml:mi>
<mml:mi>h</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mtext>&#x2002;</mml:mtext>
<mml:mo>&#x3d;</mml:mo>
<mml:mtext>&#x2002;</mml:mtext>
<mml:msub>
<mml:mi>r</mml:mi>
<mml:mrow>
<mml:mi>h</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mtext>&#x2002;</mml:mtext>
<mml:mo>&#x2212;</mml:mo>
<mml:mtext>&#x2002;</mml:mtext>
<mml:msub>
<mml:mrow>
<mml:mi>IMF</mml:mi>
</mml:mrow>
<mml:mi>h</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>
</mml:mo>
</mml:mrow>
</mml:math>
<label>(7)</label>
</disp-formula>
<list list-type="simple">
<list-item>
<p>5) Until the termination condition is satisfied, <italic>h</italic> IMF(<italic>t</italic>)s and a <italic>res</italic>(<italic>t</italic>) can be obtained as follows:</p>
</list-item>
</list>
<disp-formula id="e8">
<mml:math id="m8">
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mtext>&#x2002;</mml:mtext>
<mml:mo>&#x3d;</mml:mo>
<mml:mtext>&#x2002;</mml:mtext>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>h</mml:mi>
</mml:munderover>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>IMF</mml:mi>
</mml:mrow>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mstyle>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mtext>&#x2002;</mml:mtext>
<mml:mo>&#x2b;</mml:mo>
<mml:mtext>&#x2002;</mml:mtext>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>.</mml:mo>
<mml:mtext>&#x2002;</mml:mtext>
<mml:mtext>&#x2002;</mml:mtext>
</mml:mrow>
</mml:math>
<label>(8)</label>
</disp-formula>
</p>
</sec>
<sec id="s1-4">
<title>Component Judgment Formula</title>
<p>Because the data changes of the latter few IMFs and Res are relatively smooth, modeling these subsequences by fitting can save time. Therefore, a threshold f&#x2a; is set according to the ratio <italic>f</italic> of the number of extreme points to the number of original data. When <italic>f</italic> is greater than f&#x2a;, these IMFs are judged to be the fluctuant components, and the remaining IMFs and Res are judged to be the smooth components. The extension data are not included when calculating <italic>f</italic>, and the judgment formula <italic>f</italic> is as follows:<disp-formula id="e9">
<mml:math id="m9">
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mtext>&#x2002;</mml:mtext>
<mml:mo>&#x3d;</mml:mo>
<mml:mtext>&#x2002;</mml:mtext>
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mi>M</mml:mi>
<mml:mrow>
<mml:mi>max</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>M</mml:mi>
<mml:mrow>
<mml:mi>min</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mi>N</mml:mi>
</mml:mfrac>
<mml:mo>
</mml:mo>
</mml:mrow>
</mml:math>
<label>(9)</label>
</disp-formula>where <italic>M</italic>
<sub>max</sub>, <italic>M</italic>
<sub>min</sub>, and <italic>N</italic> denote the number of maximum points, minimum points, and the original data, respectively.</p>
</sec>
</sec>
<sec id="s2">
<title>Fluctuant/Smooth Components Prediction Method</title>
<p>After completing the processing and division of regional wind power historical data, the subsequences contained in each component are modeled and predicted, respectively. Because the decomposition results are a number of subsequences with gradually decreasing frequency components, it is more difficult to model the fluctuant components relative to the smooth components.</p>
<sec id="s2-1">
<title>Prediction Method of Fluctuant Components</title>
<p>Because the fluctuant components contain several IMFs with the highest frequency components, the prediction results of each subsequence in this component will directly affect the final prediction accuracy. RNN is specialized in processing time series data and has a unique memory function for processed data. In order to effectively solve the problem in RNN related to gradient, LSTM adds three control gates on the basis of RNN: the input gate, forget gate, and output gate are added to build LSTM. In addition, it can ensure the model remembers the historical information of an uncertain time. The basic unit model of LSTM is shown in <xref ref-type="fig" rid="F2">Figure&#x20;2</xref>.</p>
<fig id="F2" position="float">
<label>FIGURE 2</label>
<caption>
<p>Basic unit model of LSTM.</p>
</caption>
<graphic xlink:href="fenrg-10-840519-g002.tif"/>
</fig>
<p>The forget gate determines the degree of retention of historical state information. When the output value is closer to 0, it means more discarded; when the output value is closer to 1, it means more reserved as follows:<disp-formula id="e10">
<mml:math id="m10">
<mml:mrow>
<mml:msub>
<mml:mi>f</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>sigmoid</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:msub>
<mml:mi mathvariant="italic">w</mml:mi>
<mml:mi mathvariant="normal">f</mml:mi>
</mml:msub>
<mml:mo>&#x22c5;</mml:mo>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:msub>
<mml:mi>h</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mo>]</mml:mo>
</mml:mrow>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi mathvariant="italic">b</mml:mi>
<mml:mi mathvariant="normal">f</mml:mi>
</mml:msub>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>
</mml:mo>
</mml:mrow>
</mml:math>
<label>(10)</label>
</disp-formula>where <italic>x</italic>
<sub>
<italic>t</italic>
</sub> denotes the input vector. <italic>h</italic>
<sub>
<italic>t</italic>-1</sub> denotes the output vector of the hidden layer at the previous moment. <italic>w</italic>
<sub>f</sub> and <italic>b</italic>
<sub>f</sub> denote the weight and bias of the forget gate, respectively.</p>
<p>The input gate determines the information stored in the unit as follows:<disp-formula id="e11">
<mml:math id="m11">
<mml:mrow>
<mml:msub>
<mml:mi>i</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>sigmoid</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:msub>
<mml:mi mathvariant="italic">w</mml:mi>
<mml:mi mathvariant="normal">i</mml:mi>
</mml:msub>
<mml:mo>&#x22c5;</mml:mo>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:msub>
<mml:mi>h</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mo>]</mml:mo>
</mml:mrow>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>b</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>
</mml:mo>
</mml:mrow>
</mml:math>
<label>(11)</label>
</disp-formula>
</p>
<p>Update the status information after getting the output value of the input gate. Then, the state and the new cell state calculate can be gained:<disp-formula id="e12">
<mml:math id="m12">
<mml:mrow>
<mml:msubsup>
<mml:mi>C</mml:mi>
<mml:mi>t</mml:mi>
<mml:mo>&#x2032;</mml:mo>
</mml:msubsup>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>tanh</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:msub>
<mml:mi mathvariant="italic">W</mml:mi>
<mml:mi mathvariant="normal">c</mml:mi>
</mml:msub>
<mml:mo>&#x22c5;</mml:mo>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:msub>
<mml:mi>h</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mo>]</mml:mo>
</mml:mrow>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>b</mml:mi>
<mml:mi>c</mml:mi>
</mml:msub>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>
</mml:mo>
</mml:mrow>
</mml:math>
<label>(12)</label>
</disp-formula>
<disp-formula id="e13">
<mml:math id="m13">
<mml:mrow>
<mml:msub>
<mml:mi>C</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mi>f</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mo>&#x2217;</mml:mo>
<mml:msub>
<mml:mi>C</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>i</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mo>&#x2217;</mml:mo>
<mml:msubsup>
<mml:mi>C</mml:mi>
<mml:mi>t</mml:mi>
<mml:mo>&#x2032;</mml:mo>
</mml:msubsup>
<mml:mo>
</mml:mo>
</mml:mrow>
</mml:math>
<label>(13)</label>
</disp-formula>where <italic>w</italic>
<sub>i</sub> and <italic>w</italic>
<sub>c</sub> denote the weights of the input gate and cell state, respectively. <italic>b</italic>
<sub>i</sub> and <italic>b</italic>
<sub>c</sub> denote the biases of the input gate and cell state, respectively.</p>
<p>The output gate determines the output of information:<disp-formula id="e14">
<mml:math id="m14">
<mml:mrow>
<mml:msub>
<mml:mi>o</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>sigmoid</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:msub>
<mml:mi mathvariant="italic">w</mml:mi>
<mml:mi mathvariant="normal">o</mml:mi>
</mml:msub>
<mml:mo>&#x22c5;</mml:mo>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:msub>
<mml:mi>h</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mo>]</mml:mo>
</mml:mrow>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>b</mml:mi>
<mml:mi>o</mml:mi>
</mml:msub>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>
</mml:mo>
</mml:mrow>
</mml:math>
<label>(14)</label>
</disp-formula>
<disp-formula id="e15">
<mml:math id="m15">
<mml:mrow>
<mml:msub>
<mml:mi>h</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mi>o</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mo>&#x2217;</mml:mo>
<mml:mi>tanh</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:msub>
<mml:mi>C</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>,</mml:mo>
</mml:mrow>
</mml:math>
<label>(15)</label>
</disp-formula>where <italic>w</italic>
<sub>o</sub> denotes the weight of the output gate and <italic>b</italic>
<sub>o</sub> represents the bias of the output&#x20;gate.</p>
</sec>
<sec id="s2-2">
<title>Prediction Method of Smooth Components</title>
<p>Compared with the fluctuant components, the data of each subsequence in the smooth components are extremely steady. ARIMA can be used to predict the smooth components, which can reduce time consumption while obtaining extremely high prediction accuracy. The ARIMA (<italic>p</italic>, <italic>d</italic>, <italic>q</italic>) model is shown as follows:<disp-formula id="e16">
<mml:math id="m16">
<mml:mrow>
<mml:mi mathvariant="normal">&#x394;</mml:mi>
<mml:mi>x</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mo>-</mml:mo>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>D</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mo>
</mml:mo>
</mml:mrow>
</mml:math>
<label>(16)</label>
</disp-formula>
<disp-formula id="e17">
<mml:math id="m17">
<mml:mrow>
<mml:msup>
<mml:mi mathvariant="normal">&#x394;</mml:mi>
<mml:mn>2</mml:mn>
</mml:msup>
<mml:mi>x</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>&#x394;</mml:mi>
<mml:mi mathvariant="normal">x</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mi mathvariant="normal">&#x394;</mml:mi>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>D</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msup>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mo>
</mml:mo>
</mml:mrow>
</mml:math>
<label>(17)</label>
</disp-formula>
<disp-formula id="e18">
<mml:math id="m18">
<mml:mrow>
<mml:msup>
<mml:mi mathvariant="normal">&#x394;</mml:mi>
<mml:mi>d</mml:mi>
</mml:msup>
<mml:mi>x</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>D</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mi>d</mml:mi>
</mml:msup>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mi>&#x3c6;</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>&#x3c6;</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>&#x3c6;</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mn>...</mml:mn>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>&#x3c6;</mml:mi>
<mml:mi>p</mml:mi>
</mml:msub>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>p</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>&#x3b5;</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>&#x3b8;</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:msub>
<mml:mi>&#x3b5;</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mn>...</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>&#x3b8;</mml:mi>
<mml:mi>q</mml:mi>
</mml:msub>
<mml:msub>
<mml:mi>&#x3b5;</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>q</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>
</mml:mo>
</mml:mrow>
</mml:math>
<label>(18)</label>
</disp-formula>where <italic>p</italic> denotes the autoregressive order; <italic>q</italic> denotes the average moving order; <italic>d</italic> denotes the difference order; <italic>&#x3c6;</italic>
<sub>0</sub>, <italic>&#x3c6;</italic>
<sub>1</sub> &#x2026; <italic>&#x3c6;</italic>
<sub>
<italic>p</italic>
</sub> denote the autoregressive coefficients; and <italic>&#x3b8;</italic>
<sub>1</sub>, <italic>&#x3b8;</italic>
<sub>2</sub> &#x2026; <italic>&#x3b8;</italic>
<sub>
<italic>q</italic>
</sub> denote the moving average coefficients.</p>
</sec>
</sec>
<sec id="s3">
<title>Combined Prediction Method</title>
<p>In this section, the missing data in the historical data of regional wind power will be repaired and the data will be denoised to improve the signal-to-noise ratio. Then, the left and right end points of the data will be extended and decomposed by CEEMDAN. Additionally, we will delete the data of the extension part of each subsequence.</p>
<sec id="s3-1">
<title>Forecasting Process</title>
<p>The CEEMDAN process will find the upper and lower envelopes, respectively, according to the maximum and minimum points of the repaired original sequence. When the training data are updated, they need to be re-decomposed, and subsequences will also change after each decomposition. <xref ref-type="fig" rid="F3">Figure&#x20;3</xref> shows that the decomposed IMFs<sub>1</sub> of the training data are separated by 96 data points. It can be seen that the changing trends of the overlapping part are almost the same, but a more obvious difference can be seen after partial magnification. Therefore, the trained model cannot be saved for continuous prediction. After each prediction is completed, the data need to be decomposed again by CEEMDAN, with the fluctuant/smooth components redivided and retrained. In addition, in order to directly obtain multiple power values, the LSTM model is trained in <italic>n</italic>:<italic>1</italic> multi-input and multi-output modes. After the model training is completed, the last <italic>n</italic> data are input, and the future <italic>l</italic> data will be predicted.</p>
<fig id="F3" position="float">
<label>FIGURE 3</label>
<caption>
<p>Difference of IMF1 before and after updating training&#x20;data.</p>
</caption>
<graphic xlink:href="fenrg-10-840519-g003.tif"/>
</fig>
<p>The construction process based on the fluctuant /smooth components partition model (combined prediction method) is shown in <xref ref-type="fig" rid="F4">Figure&#x20;4</xref>. The specific steps are as follows:<list list-type="simple">
<list-item>
<p>1) Extract the repaired <italic>n</italic> days of historical data before the predictive time points as the training data, and complete the data extension.</p>
</list-item>
<list-item>
<p>2) Perform CEEMDAN on the data to obtain the subsequences composed of IMFs and Res. Calculate the proportion <italic>f</italic> of each subsequence, and divide IMFs and Res into fluctuant components and smooth components according to&#x20;<italic>f.</italic>
</p>
</list-item>
<list-item>
<p>3) Different methods are used to model the subsequences contained in the fluctuant components and the smooth components.</p>
</list-item>
</list>
</p>
<fig id="F4" position="float">
<label>FIGURE 4</label>
<caption>
<p>Prediction flow chart based on fluctuant/smooth components division.</p>
</caption>
<graphic xlink:href="fenrg-10-840519-g004.tif"/>
</fig>
<p>For the fluctuant components, each subsequence is divided into training data and testing data. The tree-structured Parzen estimator (TPE) algorithm is used to optimize the hyperparameters of the LSTM model, including the number of LSTM layers of each model, the number of nodes in each layer, the activation function, batch_size, and optimizer.</p>
<p>For the smooth components, ARIMA (1, 2, 0) is used to fit the <italic>z</italic> data points before each subsequence predictive time point. After the fitting function is obtained, the <italic>z &#x2b;</italic> 1 to <italic>z &#x2b; l</italic> data can be calculated.<list list-type="simple">
<list-item>
<p>4) The final predictive result can be obtained by combining all the predictive data for each subsequence.</p>
</list-item>
<list-item>
<p>5) In the next round of prediction, update the regional wind power historical data first and repeat Steps 1&#x2013;4 to start a new prediction round. The hyperparameter optimization process of the LSTM model is not re-optimized due to the time-consuming process, and the first hyperparameters combination is used&#x20;again.</p>
</list-item>
</list>
</p>
</sec>
<sec id="s3-2">
<title>Evaluation Indexes</title>
<p>In order to measure the prediction accuracy, an evaluation system with mean absolute error (MAE), root mean squared error (RMSE), and qualified rate (Q) is established, which can effectively reflect the prediction accuracy. The calculations of MAE, RMSE, and Q are shown in <xref ref-type="disp-formula" rid="e19">Eqs 19</xref>, <xref ref-type="disp-formula" rid="e20">20</xref>, <xref ref-type="disp-formula" rid="e21">21</xref>, <xref ref-type="disp-formula" rid="e22">22</xref>. RMSE and MAE reflect the absolute value of the error and are used to directly measure the prediction accuracy. Q reflects the acceptable degree of the prediction effect in practice.<disp-formula id="e19">
<mml:math id="m19">
<mml:mrow>
<mml:mi>MAE</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mi>n</mml:mi>
</mml:mfrac>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:munderover>
<mml:mrow>
<mml:mrow>
<mml:mo>&#x7c;</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi mathvariant="normal">p</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi mathvariant="normal">r</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo>&#x7c;</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:mstyle>
</mml:mrow>
</mml:math>
<label>(19)</label>
</disp-formula>
<disp-formula id="e20">
<mml:math id="m20">
<mml:mrow>
<mml:mi>RMSE</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:msqrt>
<mml:mrow>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mi>n</mml:mi>
</mml:mfrac>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:munderover>
<mml:mrow>
<mml:msup>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi mathvariant="normal">p</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi mathvariant="normal">r</mml:mi>
</mml:msub>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
</mml:mstyle>
</mml:mrow>
</mml:msqrt>
</mml:mrow>
</mml:math>
<label>(20)</label>
</disp-formula>
<disp-formula id="e21">
<mml:math id="m21">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3b7;</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mo>{</mml:mo>
<mml:mtable columnalign="left">
<mml:mtr>
<mml:mtd>
<mml:mn>1</mml:mn>
<mml:mtext>&#x2003;</mml:mtext>
<mml:mtext>&#x2003;</mml:mtext>
<mml:mrow>
<mml:mo>&#x7c;</mml:mo>
<mml:mrow>
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi mathvariant="normal">p</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi mathvariant="normal">r</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi mathvariant="normal">r</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
<mml:mo>&#x7c;</mml:mo>
</mml:mrow>
<mml:mo>&#x3c;</mml:mo>
<mml:mn>10</mml:mn>
<mml:mo>%</mml:mo>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mn>0</mml:mn>
<mml:mtext>&#x2003;</mml:mtext>
<mml:mtext>&#x2003;</mml:mtext>
<mml:mrow>
<mml:mo>&#x7c;</mml:mo>
<mml:mrow>
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi mathvariant="normal">p</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi mathvariant="normal">r</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi mathvariant="normal">r</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
<mml:mo>&#x7c;</mml:mo>
</mml:mrow>
<mml:mo>&#x2265;</mml:mo>
<mml:mn>10</mml:mn>
<mml:mo>%</mml:mo>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(21)</label>
</disp-formula>
<disp-formula id="e22">
<mml:math id="m22">
<mml:mrow>
<mml:mi mathvariant="normal">Q</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mi>n</mml:mi>
</mml:mfrac>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:munderover>
<mml:mrow>
<mml:msub>
<mml:mi>&#x3b7;</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mstyle>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>100</mml:mn>
<mml:mo>%</mml:mo>
</mml:mrow>
</mml:math>
<label>(22)</label>
</disp-formula>where <italic>P</italic>
<sub>p</sub> denotes the prediction value, <italic>P</italic>
<sub>r</sub> denotes the real value, and <italic>n</italic> denotes the length of the prediction&#x20;value.</p>
</sec>
</sec>
<sec id="s4">
<title>Experiment</title>
<p>The data from lots of wind power plants in a certain area of northern China are extracted from the November and December data of the current year. The unit is MW and the time resolution is 30&#xa0;min. Therefore, there are 48 regional wind power values each&#x20;day.</p>
<sec id="s4-1">
<title>Historical Data Acquisition and Processing</title>
<p>Wind power data have strong intermittentness, randomness, and volatility, making it difficult to obtain high prediction accuracy for ultra-short-term wind power prediction. The curve in <xref ref-type="fig" rid="F5">Figure&#x20;5</xref> is the regional wind power data within 1&#xa0;month. It can be seen that the data do not have obvious regularity but have a wide range of changes. The ultra-short-term sudden rise and sudden rise of nearly 4000&#xa0;MW can be achieved within half a day. It also explains the low prediction accuracy of most algorithm models to a certain extent.</p>
<fig id="F5" position="float">
<label>FIGURE 5</label>
<caption>
<p>Variation of regional wind power&#x20;data.</p>
</caption>
<graphic xlink:href="fenrg-10-840519-g005.tif"/>
</fig>
<p>In each prediction, 960 wind power data points for 20&#xa0;days are selected as the training data, and the prediction period is from 00:00 to 06:00 on the 21st day. Thirty-five comparative experiments have been conducted. The decomposition of the first CEEMDAN is made after removing the extension data, and six groups of IMFs and Res with frequency from high to low are obtained in <xref ref-type="fig" rid="F6">Figure&#x20;6</xref>.</p>
<fig id="F6" position="float">
<label>FIGURE 6</label>
<caption>
<p>Decomposition effect of CEEMDAN.</p>
</caption>
<graphic xlink:href="fenrg-10-840519-g006.tif"/>
</fig>
<p>
<xref ref-type="fig" rid="F6">Figure&#x20;6</xref> shows that the change of each subsequence is relatively stable, and there is no obvious modal aliasing phenomenon, which is in line with the expected assumption. Based on many experiments, we decided to set 2% as the component division threshold f&#x2a;. When the <italic>f</italic> of subsequence is greater than 2%, this subsequence is divided into fluctuant components. When the <italic>f</italic> of subsequence is less than 2%, this subsequence is divided into smooth components. With respect to the smooth components, using ARIMA instead of LSTM can not only eliminate the complex parameter tuning but also make the calculation faster. In <xref ref-type="fig" rid="F6">Figure&#x20;6</xref>, from IMF<sub>1</sub> to IMF<sub>4</sub> belong to the fluctuant components, and the rest belong to the smooth components.</p>
<p>The total number of subsequences decomposed during 35 ultra-short-term predictions are shown in <xref ref-type="fig" rid="F7">Figure&#x20;7</xref>. The numbers of subsequences are relatively stable, which are all between six and eight. Among them, seven groups had 25&#x20;times at most, accounting for 71.428%. Eight groups and six groups had six times and four times, respectively, accounting for 17.143% and 11.429% of the total. This also shows that after the training data are updated, the subsequence data decomposed by CEEMDAN are relatively stable, and there is no obvious difference in volatility. Therefore, it is reasonable for LSTM to train the subsequence following the first optimized hyperparameters.</p>
<fig id="F7" position="float">
<label>FIGURE 7</label>
<caption>
<p>Number of decomposed subsequences of CEEMDAN.</p>
</caption>
<graphic xlink:href="fenrg-10-840519-g007.tif"/>
</fig>
</sec>
<sec id="s4-2">
<title>Analysis of Prediction Results</title>
<p>In order to compare the performance of the combined prediction method in regional ultra-short-term wind power forecasting, ARIMA, SVR, BP, and LSTM are selected as comparative models, and actual project forecast data are added as a reference. The neural network model can obtain multiple outputs. BP and LSTM models all use 48 inputs and 12 outputs to train the models and use the TPE algorithm to determine the hyperparameters. Specifically, the hidden layer of BP is set as two layers with 36 neurons and 18 neurons, and the optimizer, activation function, and batch_size are Adam, tanh, and 64, respectively. For LSTM, the hidden layer is set as two layers with 48 neurons and 18 neurons. The optimizer, activation function, and batch_size are set to nadam, tanh, and 32. Moreover, the ARIMA and SVR models use rolling predictions to obtain 12 forecast data and use the grid search to achieve the best hyperparameters. The hyperparameters of the comparative model are optimized, and the results are as follows. <italic>p</italic>, <italic>d</italic>, and <italic>q</italic> of ARIMA are set as 4, 1, and 0, respectively. The kernel function, <italic>c</italic>, and <italic>epsilon</italic> of SVR are set as a linear kernel function, 1, and&#x20;0.05.</p>
<p>
<xref ref-type="table" rid="T1">Table&#x20;1</xref> shows the statistical results of the regional ultra-short-term wind power prediction within 1&#xa0;month.</p>
<table-wrap id="T1" position="float">
<label>TABLE 1</label>
<caption>
<p>
<bold>&#x7c;</bold> Model prediction accuracy comparison.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="left">Model</th>
<th align="center">MAE (MW)</th>
<th align="center">RMSE (MW)</th>
<th align="center">Q (%)</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="left">Engineering level</td>
<td align="char" char=".">341.301</td>
<td align="char" char=".">384.602</td>
<td align="char" char=".">70.556</td>
</tr>
<tr>
<td align="left">ARIMA</td>
<td align="char" char=".">356.532</td>
<td align="char" char=".">411.597</td>
<td align="char" char=".">70.833</td>
</tr>
<tr>
<td align="left">SVR</td>
<td align="char" char=".">401.565</td>
<td align="char" char=".">468.175</td>
<td align="char" char=".">61.944</td>
</tr>
<tr>
<td align="left">BP</td>
<td align="char" char=".">402.321</td>
<td align="char" char=".">464.033</td>
<td align="char" char=".">67.222</td>
</tr>
<tr>
<td align="left">LSTM</td>
<td align="char" char=".">308.035</td>
<td align="char" char=".">361.576</td>
<td align="char" char=".">71.944</td>
</tr>
<tr>
<td align="left">Combined prediction</td>
<td align="char" char=".">269.707</td>
<td align="char" char=".">304.271</td>
<td align="char" char=".">74.167</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>In <xref ref-type="table" rid="T1">Table&#x20;1</xref>, the combined prediction model has the best prediction effect when the hyperparameters of all the models are selected according to their respective optimization strategies. Compared with the engineering level, ARIMA, SVR, BP, and LSTM, the MAE of the combined prediction model is lower by 71.594, 86.825, 131.858, 132.614, and 38.328&#xa0;MW, respectively. The RMSE is lower by 80.331, 107.326, 163.904, 159.762, and 57.305&#xa0;MW, respectively. Q is higher by 3.611%, 3.334%, 12.223%, 6.945%, and 2.223% respectively. It indicates that CEEMDAN can effectively decompose the regional wind power historical data into several regular subsequences. At the same time, the fluctuant and smooth components are modeled by different methods, which can give full play to the predictive capabilities of LSTM and ARIMA. <xref ref-type="fig" rid="F8">Figure&#x20;8</xref> is a comparison of the prediction results for 1&#xa0;day. The combined prediction results are the closest to the real value, which can effectively follow the 12 points of wind power in the next 6&#xa0;h.</p>
<fig id="F8" position="float">
<label>FIGURE 8</label>
<caption>
<p>Comparison of prediction results.</p>
</caption>
<graphic xlink:href="fenrg-10-840519-g008.tif"/>
</fig>
<p>
<xref ref-type="fig" rid="F9">Figures 9</xref>&#x2013;<xref ref-type="fig" rid="F11">11</xref> give the box diagram of MAE, RMSE, and Q. It can be shown that the box height of the combined prediction model is the lowest among all the models, which demonstrates that the prediction error of the combined prediction model is more concentrated. In addition, in <xref ref-type="fig" rid="F9">Figures 9</xref>, <xref ref-type="fig" rid="F10">10</xref>, the lower quartile line, the upper quartile line, and the upper edge of the combined prediction model are lower than those of other models except for LSTM, which indicates that the changes in the MAE and RMSE of the combined prediction model are concentrated, and the error is generally lower than other models. <xref ref-type="fig" rid="F11">Figure&#x20;11</xref> shows that the lower quartile of the combined prediction model is also the highest among all models, and the median line is also higher than most models, which indicates that the Q of the combined prediction model is generally higher than other models. To sum up, the box diagrams for MAE, RMSE, and Q show that the combined prediction model is not the best in all aspects but can achieve a high prediction concentration.</p>
<fig id="F9" position="float">
<label>FIGURE 9</label>
<caption>
<p>MAE box diagram of each&#x20;model.</p>
</caption>
<graphic xlink:href="fenrg-10-840519-g009.tif"/>
</fig>
<fig id="F10" position="float">
<label>FIGURE 10</label>
<caption>
<p>RMSE box diagram of each&#x20;model.</p>
</caption>
<graphic xlink:href="fenrg-10-840519-g010.tif"/>
</fig>
<fig id="F11" position="float">
<label>FIGURE 11</label>
<caption>
<p>Q box diagram of each&#x20;model.</p>
</caption>
<graphic xlink:href="fenrg-10-840519-g011.tif"/>
</fig>
</sec>
</sec>
<sec sec-type="conclusion" id="s5">
<title>Conclusion</title>
<p>According to the variation characteristics of historical data of the regional wind power, this study proposes a combined prediction method based on CEEMDAN and the division of fluctuant/smooth components. The following studies have been completed.</p>
<p>1) In order to deeply explore the variation of historical data of the regional wind power, CEEMDAN is selected to decompose the data after extension processing, and the subsequences obtained are divided into the fluctuant and smooth components. LSTM is used to train the subsequences of the fluctuation components, while ARIMA is used to fit the subsequences of the smooth components directly. This method not only remedies the defect of the regularity of the regional wind power data but also gives full play to the advantages of LSTM and ARIMA.</p>
<p>2) The example shows that the combined prediction model can better follow the variation of the regional wind power data and can effectively improve the ultra-short-term prediction accuracy of regional wind&#x20;power.</p>
<p>In this article, the prediction speed needs to be improved. It is proposed to further study the neural network with a simple structure to realize fast prediction, such as the improved method based on&#x20;GRU.</p>
</sec>
</body>
<back>
<sec id="s6">
<title>Data Availability Statement</title>
<p>The original contributions presented in the study are included in the article/Supplementary Material, Further inquiries can be directed to the corresponding author.</p>
</sec>
<sec id="s7">
<title>Author Contributions</title>
<p>Conceptualization: YL and LY; methodology: YL and LY; software: YL and LY; validation: YL, WZ, and LY; formal analysis: YL; investigation: LY; resources: YL; data curation: HH; writing&#x2014;original draft preparation: LY; writing&#x2014;review and editing: YL, WZ, and LY; visualization: LY. All authors have read and agreed to the published version of the manuscript.</p>
</sec>
<sec id="s8">
<title>Funding</title>
<p>This research was funded by the National Natural Science Foundation of China (61703405).</p>
</sec>
<sec sec-type="COI-statement" id="s9">
<title>Conflict of Interest</title>
<p>HH was employed by State Grid Jiangxi Electric Power Co.,&#x20;Ltd.</p>
<p>The remaining authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p>
</sec>
<sec sec-type="disclaimer" id="s10">
<title>Publisher&#x2019;s Note</title>
<p>All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations or those of the publisher, the editors, and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.</p>
</sec>
<ref-list>
<title>References</title>
<ref id="B1">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Bedi</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Toshniwal</surname>
<given-names>D.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>Empirical Mode Decomposition Based Deep Learning for Electricity Demand Forecasting</article-title>. <source>IEEE Access</source> <volume>6</volume>, <fpage>49144</fpage>&#x2013;<lpage>49156</lpage>. <pub-id pub-id-type="doi">10.1109/access.2018.2867681</pub-id> </citation>
</ref>
<ref id="B2">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Chen</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Qi</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Zhu</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Xie</surname>
<given-names>D.</given-names>
</name>
<etal/>
</person-group> (<year>2021</year>). <article-title>Ultra-Short-Term Wind Power Prediction Based on Bidirectional Gated Recurrent Unit and Transfer Learning</article-title>. <source>Front. Energ. Res.</source> <volume>9</volume>, <fpage>808116</fpage>. <pub-id pub-id-type="doi">10.3389/fenrg.2021.808116</pub-id> </citation>
</ref>
<ref id="B3">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Elsaraiti</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Merabet</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Application of Long-Short-Term-Memory Recurrent Neural Networks to Forecast Wind Speed</article-title>. <source>Appl. Sci.</source> <volume>11</volume>, <fpage>2387</fpage>. <pub-id pub-id-type="doi">10.3390/app11052387</pub-id> </citation>
</ref>
<ref id="B4">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Fu</surname>
<given-names>Q.</given-names>
</name>
<name>
<surname>Jing</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>He</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Si</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>Fault Feature Selection and Diagnosis of Rolling Bearings Based on EEMD and Optimized Elman_AdaBoost Algorithm</article-title>. <source>IEEE Sensors J.</source> <volume>18</volume>, <fpage>5024</fpage>&#x2013;<lpage>5034</lpage>. <pub-id pub-id-type="doi">10.1109/jsen.2018.2830109</pub-id> </citation>
</ref>
<ref id="B5">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Gan</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>G. Y.</given-names>
</name>
<name>
<surname>Zhou</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2016</year>). <article-title>Coordinated Planning of Large-Scale Wind Farm Integration System and Transmission Network</article-title>. <source>CSEE J.&#x20;Power Energ. Syst.</source> <volume>2</volume>, <fpage>2530</fpage>&#x2013;<lpage>2539</lpage>. <pub-id pub-id-type="doi">10.17775/cseejpes.2016.00005</pub-id> </citation>
</ref>
<ref id="B6">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Hochreiter</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Schmidhuber</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>1997</year>). <article-title>Long Short-Term Memory</article-title>. <source>Neural Comput.</source> <volume>9</volume>, <fpage>1735</fpage>&#x2013;<lpage>1780</lpage>. <pub-id pub-id-type="doi">10.1162/neco.1997.9.8.1735</pub-id> </citation>
</ref>
<ref id="B7">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Huang</surname>
<given-names>N. E.</given-names>
</name>
<name>
<surname>Shen</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Long</surname>
<given-names>S. R.</given-names>
</name>
<name>
<surname>Wu</surname>
<given-names>M. C.</given-names>
</name>
<name>
<surname>Shih</surname>
<given-names>H. H.</given-names>
</name>
<name>
<surname>Zheng</surname>
<given-names>Q.</given-names>
</name>
<etal/>
</person-group> (<year>1998</year>). <article-title>The Empirical Mode Decomposition and the hilbert Spectrum for Nonlinear and Non-stationary Time Series Analysis</article-title>. <source>Proc. R. Soc. Lond. A.</source> <volume>454</volume>, <fpage>903</fpage>&#x2013;<lpage>995</lpage>. <pub-id pub-id-type="doi">10.1098/rspa.1998.0193</pub-id> </citation>
</ref>
<ref id="B8">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Huang</surname>
<given-names>N. E.</given-names>
</name>
<name>
<surname>Wu</surname>
<given-names>M.-L. C.</given-names>
</name>
<name>
<surname>Long</surname>
<given-names>S. R.</given-names>
</name>
<name>
<surname>Shen</surname>
<given-names>S. S. P.</given-names>
</name>
<name>
<surname>Qu</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Gloersen</surname>
<given-names>P.</given-names>
</name>
<etal/>
</person-group> (<year>2003</year>). <article-title>A Confidence Limit for the Empirical Mode Decomposition and hilbert Spectral Analysis</article-title>. <source>Proc. R. Soc. Lond. A.</source> <volume>459</volume>, <fpage>2317</fpage>&#x2013;<lpage>2345</lpage>. <pub-id pub-id-type="doi">10.1098/rspa.2003.1123</pub-id> </citation>
</ref>
<ref id="B9">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Liu</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Guan</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Hou</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Han</surname>
<given-names>H.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Wind Power Short-Term Prediction Based on LSTM and Discrete Wavelet Transform</article-title>. <source>Appl. Sci.</source> <volume>9</volume>, <fpage>1108</fpage>. <pub-id pub-id-type="doi">10.3390/app9061108</pub-id> </citation>
</ref>
<ref id="B10">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Lobo</surname>
<given-names>M. G.</given-names>
</name>
<name>
<surname>Sanchez</surname>
<given-names>I.</given-names>
</name>
</person-group> (<year>2012</year>). <article-title>Regional Wind Power Forecasting Based on Smoothing Techniques, with Application to the Spanish Peninsular System</article-title>. <source>IEEE Trans. Power Syst.</source> <volume>27</volume>, <fpage>1990</fpage>&#x2013;<lpage>1997</lpage>. <pub-id pub-id-type="doi">10.1109/tpwrs.2012.2189418</pub-id> </citation>
</ref>
<ref id="B11">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Lu</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Ye</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Tang</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Zhao</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Zhong</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Qu</surname>
<given-names>Y.</given-names>
</name>
<etal/>
</person-group> (<year>2021</year>). <article-title>Ultra-short-term Combined Prediction Approach Based on Kernel Function Switch Mechanism</article-title>. <source>Renew. Energ.</source> <volume>164</volume>, <fpage>842</fpage>&#x2013;<lpage>866</lpage>. <pub-id pub-id-type="doi">10.1016/j.renene.2020.09.110</pub-id> </citation>
</ref>
<ref id="B12">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Mahmoud</surname>
<given-names>T. K.</given-names>
</name>
<name>
<surname>Dong</surname>
<given-names>Z. Y.</given-names>
</name>
<name>
<surname>Ma</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2017</year>). <article-title>A Developed Integrated Scheme Based Approach for Wind Turbine Intelligent Control</article-title>. <source>IEEE Trans. Sustain. Energ.</source> <volume>8</volume>, <fpage>927</fpage>&#x2013;<lpage>937</lpage>. <pub-id pub-id-type="doi">10.1109/tste.2016.2632104</pub-id> </citation>
</ref>
<ref id="B13">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Qu</surname>
<given-names>Z. X.</given-names>
</name>
<name>
<surname>Mao</surname>
<given-names>W. Q.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>K. Q.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>W. Y.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>Z. P.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>Multi-step Wind Speed Forecasting Based on a Hybrid Decomposition Technique and an Improved Back-Propagation Neural Network</article-title>. <source>Renew. Energ.</source> <volume>133</volume>, <fpage>919</fpage>&#x2013;<lpage>929</lpage>. <pub-id pub-id-type="doi">10.1016/j.renene.2018.10.043</pub-id> </citation>
</ref>
<ref id="B14">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Safari</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Chung</surname>
<given-names>C. Y.</given-names>
</name>
<name>
<surname>Price</surname>
<given-names>G. C. D.</given-names>
</name>
</person-group> (<year>2017</year>). <article-title>Novel Multi-step Short-Term Wind Power Prediction Framework Based on Chaotic Time Series Analysis and Singular Spectrum Analysis</article-title>. <source>IEEE Trans. Power Syst.</source> <volume>33</volume>, <fpage>590</fpage>&#x2013;<lpage>601</lpage>. <pub-id pub-id-type="doi">10.1109/TPWRS.2017.2694705</pub-id> </citation>
</ref>
<ref id="B15">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Torres</surname>
<given-names>M. E.</given-names>
</name>
<name>
<surname>Colominas</surname>
<given-names>M. A.</given-names>
</name>
<name>
<surname>Schlotthauer</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Flandrin</surname>
<given-names>P.</given-names>
</name>
</person-group> (<year>2011</year>). <article-title>A Complete Ensemble Empirical Mode Decomposition with Adaptive Noise</article-title>. <conf-name>Proceedings of the 2011 IEEE International Conference on Acoustics, Speech and Signal Processing</conf-name>. <publisher-loc>Prague</publisher-loc>: <publisher-name>Czech Republic</publisher-name>, <fpage>22</fpage>&#x2013;<lpage>27</lpage>. <pub-id pub-id-type="doi">10.1109/icassp.2011.5947265</pub-id> </citation>
</ref>
<ref id="B16">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Fan</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Ma</surname>
<given-names>P.</given-names>
</name>
</person-group> (<year>2017</year>). <article-title>A New Chaotic Time Series Hybrid Prediction Method of Wind Power Based on EEMD-SE and Full-Parameters Continued Fraction</article-title>. <source>Energy</source> <volume>138</volume>, <fpage>977</fpage>&#x2013;<lpage>990</lpage>. <pub-id pub-id-type="doi">10.1016/j.energy.2017.07.112</pub-id> </citation>
</ref>
<ref id="B17">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>H.-z.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>G.-q.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>G.-b.</given-names>
</name>
<name>
<surname>Peng</surname>
<given-names>J.-c.</given-names>
</name>
<name>
<surname>Jiang</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>Y.-t.</given-names>
</name>
</person-group> (<year>2017</year>). <article-title>Deep Learning Based Ensemble Approach for Probabilistic Wind Power Forecasting</article-title>. <source>Appl. Energ.</source> <volume>188</volume>, <fpage>56</fpage>&#x2013;<lpage>70</lpage>. <pub-id pub-id-type="doi">10.1016/j.apenergy.2016.11.111</pub-id> </citation>
</ref>
<ref id="B18">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Tao</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Hu</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Zeng</surname>
<given-names>Y.-R.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Effective Wind Power Prediction Using Novel Deep Learning Network: Stacked Independently Recurrent Autoencoder</article-title>. <source>Renew. Energ.</source> <volume>164</volume>, <fpage>642</fpage>&#x2013;<lpage>655</lpage>. <pub-id pub-id-type="doi">10.1016/j.renene.2020.09.108</pub-id> </citation>
</ref>
<ref id="B19">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Sun</surname>
<given-names>Y. H.</given-names>
</name>
<name>
<surname>Thai</surname>
<given-names>S. W.</given-names>
</name>
<name>
<surname>Wu</surname>
<given-names>X. P.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Ultra Short Term Probability Prediction of Wind Power Based on Wavelet Decomposition and Long Short-Term Memory Network. In Proceedings of the 2019&#x20;31st Chinese Control and Decision Conference (CCDC 2019)</article-title>, <source>Nanchang, China</source>, <volume>3-5</volume>, <fpage>2061</fpage>&#x2013;<lpage>2066</lpage>.<pub-id pub-id-type="doi">10.1109/ccdc.2019.8832903</pub-id> </citation>
</ref>
<ref id="B20">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wu</surname>
<given-names>Q.</given-names>
</name>
<name>
<surname>Guan</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Lv</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Huang</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Ultra&#x2010;short&#x2010;term Multi&#x2010;step Wind Power Forecasting Based on CNN&#x2010;LSTM</article-title>. <source>IET Renew. Power Generation</source> <volume>15</volume>, <fpage>1019</fpage>&#x2013;<lpage>1029</lpage>. <pub-id pub-id-type="doi">10.1049/rpg2.12085</pub-id> </citation>
</ref>
<ref id="B21">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wu</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Huang</surname>
<given-names>N. E.</given-names>
</name>
</person-group> (<year>2011</year>). <article-title>Ensemble Empirical Mode Decomposition: a Noise-Assisted Data Analysis Method</article-title>. <source>Adv. Adapt. Data Anal.</source> <volume>01</volume>, <fpage>1</fpage>&#x2013;<lpage>41</lpage>. <pub-id pub-id-type="doi">10.1142/S1793536909000047</pub-id> </citation>
</ref>
<ref id="B22">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Xu</surname>
<given-names>H. Y.</given-names>
</name>
<name>
<surname>Chang</surname>
<given-names>Y. Q.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>F. L.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Univariate and Multivariable Forecasting Models for Ultra-short-term Wind Power Prediction Based on the Similar Day and LSTM Network</article-title>. <source>J.&#x20;Renew. Sust. Energ.</source> <volume>13</volume>, <fpage>063307</fpage>. <pub-id pub-id-type="doi">10.1063/5.0027130</pub-id> </citation>
</ref>
<ref id="B23">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zalzar</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Bompard</surname>
<given-names>E.</given-names>
</name>
<name>
<surname>Purvins</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Masera</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>The Impacts of an Integrated European Adjustment Market for Electricity under High Share of Renewables</article-title>. <source>Energy Policy</source> <volume>136</volume>, <fpage>111055</fpage>. <pub-id pub-id-type="doi">10.1016/j.enpol.2019.111055</pub-id> </citation>
</ref>
<ref id="B24">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Peng</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Tian</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Ultra-short-term Prediction of Wind Power Based on Error Following Forget Gate-Based Long Short-Term Memory</article-title>. <source>Energies</source> <volume>13</volume>, <fpage>5400</fpage>. <pub-id pub-id-type="doi">10.3390/en13205400</pub-id> </citation>
</ref>
</ref-list>
</back>
</article>