Academic Journal of Science and Technology ISSN: 2771-3032 | Vol. 6, No. 3, 2023 77 Short Term Wind Power Prediction Based on CEEMDAN‐LSTM Congming Zhang, Zicheng Yang, Shaofei Gao Department of computer, North China Electric Power University, Baoding 071000, China Abstract: To improve the accuracy of wind power prediction, a wind power prediction method based on time series decomposition and error correction is proposed. Firstly, the maximum information coefficient (MIC) method was used to select the features that have strong correlation with wind power to reduce the complexity of the original data; Then, according to the non-stationary characteristics of wind power, complete ensemble empirical mode decomposition with adaptive noise(CEEMDAN) was used to decompose wind power into several stationary subsequences; Finally, the long short memory network (LSTM) was used to dynamically model the wind power multivariable time series; Add the predicted values of each subsequence to get the final predicted value. Combined with the measured data of a domestic wind farm, the simulation results showed that the proposed method had higher short-term wind power prediction accuracy compared with other prediction models. Keywords: Wind power prediction, CEEMDAN, Deep Learning, LSTM; MIC. 1. Introduction By the end of 2020, China's installed wind power capacity was 281 million kilowatts, and the wind power generation capacity is 466.5 billion kilowatt hours, accounting for 6.1% of the total power generation [1]. Wind power gradually changes from 'auxiliary power supply' to 'main power supply' [2]. However, due to the time-varying characteristics of wind, wind power has strong randomness, intermittency and uncertainty [3]. Therefore, accurate prediction of wind power was of great significance to the safe and economic operation of power system [4]. Wind power time series data were non-stationary series, and it was difficult to capture their change characteristics and autocorrelation in time series. Therefore, the direct prediction of wind power data is not ideal[5]. In view of the random volatility of wind power data, the literature[6] used the Complex Ensemble Empirical Model Decomposition (CEEMD) to decompose the wind power sequence, and used the Satin Gardener algorithm to optimize the least squares support vector machine to predict the wind power. In reference[7], the serial information such as historical wind power was decomposed into modal components of specified layers by using variational mode decomposition(VMD).Different modal components represent features of different scales. Weight sharing gate recurrent unit (WSGRU) was used for modeling. Finally, ANN was used to correct and obtain the prediction results of wind power. In reference[8], for the low adaptability of VMD method, the Enhanced Colliding Bodies Optimization (ECBO) algorithm was used to optimize the core parameters of the variational mode. After decomposition, the wavelet kernel limit learning machine prediction model is used for prediction. In order to improve the accuracy of wind power prediction, a short-term wind power prediction method based on fully adaptive noise ensemble empirical decomposition (CEEMDAN) and long short memory network (LSTM) prediction was proposed in this paper. The CEEMDAN was used to decompose the wind power into several subsequences, establish the LSTM wind power prediction model of subsequences, and stack the predicted values of subsequences to obtain the final predicted value. The proposed method was compared with LSTM and EMD-LSTM to verify that the proposed model has higher accuracy. 2. Data Preprocessing 2.1. MIC feature selection Reshef et al. proposed the maximum information coefficient (MIC) method basedon mutual information [9]. Mutual information is a measure that describes the mutual relationship between two random variables x and y. The greater the mutual information value, the stronger the correlation between the two variables. Mutual information is defined as: ( , ) ( , ) ( , )log ( ) ( )x X y Y p x y I x y p x y p x p y   (1) In the formula: p(x,y) is the joint probability density function of x, y; p(x) and p (y) are edge density functions of x and y, respectively. The maximum information coefficient is defined as follows: assuming that D(x,y) is a finite two-dimensional data set, the current two-dimensional space was divided into m intervals and n intervals in the x and y directions, respectively, to form a grid of m * n. There are multiple ways to divide grids with the same interval [9]. Under grids of different scales, the maximum mutual information value was selected for calculation, and the maximum information coefficient is defined as: ( , ) ( , ) max log(min( , ))m n B I x y MIC x y m n   (2) In the formula, m*n