# Short-Term Power Load Point Prediction Based on the Sharp Degree and Chaotic RBF Neural Network

Authors: Dongxiao Niu; Yan Lu; Xiaomin Xu; Bingjie Li
Journal: Mathematical Problems in Engineering
 (2015)

---

## Abstract

In order to realize the predicting and positioning of short-term load inflection point, this paper made reference to related research in the field of computer image recognition. It got a load sharp degree sequence by the transformation of the original load sequence based on the algorithm of sharp degree. Then this paper designed a forecasting model based on the chaos theory and RBF neural network. It predicted the load sharp degree sequence based on the forecasting model to realize the positioning of short-term load inflection point. Finally, in the empirical example analysis, this paper predicted the daily load point of a region using the actual load data of the certain region to verify the effectiveness and applicability of this method. Prediction results showed that most of the test sample load points could be accurately predicted.


---

## Body

## 1. Introduction

Short-term load forecasting (STLF) plays a key role in power dispatching work. It is the foundation of power grid planning, grid control, system safety analysis, and the economic operation. The forecasting accuracy is closely related to the grid running safety and economy [1, 2]. At present, many scholars and experts have already done a lot of theoretical researches and practical simulations on short-term load forecasting [3–20]. More common short-term load forecasting models include regression prediction model [3], time series prediction model [4], artificial neural network prediction model [5], fuzzy logic and expert system [6, 7], the wavelet analysis model [8], chaos theory [9], and combination prediction model [10–12]. Literature [13] analyzed the power factors and predicted the short-term load based on rough set method. Literature [14, 15] introduced data mining techniques for short-term load forecasting. Literature [16] proposed a novel combination prediction model for short-term load forecasting which mainly studied the weight of combination prediction model with different scenarios. Literature [17] established a combination of modified firefly algorithm and support vector regression model which was used for the STLF. Literature [18] studied the short-term forecasting of categorical changes in wind power based on Markov chain models. Literature [19] studied the short-term load forecasting based on the wavelet transform and grey model improved by PSO. Literature [20] proposed a relevance vector machine short-term load forecasting model based on nonnegative matrix decomposition.On the whole, research on short-term load forecasting has been relatively mature. The models are more complicated and intelligent. Combination forecasting model is a research trend [21]. Inflection point is usually the most concern of the dispatch staff in short-term load forecasting. How to identify and predict inflection point of short-term load is a challenge problem. At present, there is no mature solution to the short-term load forecasting of inflection point. This paper gets a load sharp degree sequence by the transformation of the original load sequence based on the algorithm of sharp degree. Then, it forecasts the load sharp degree sequence by designing and training the forecasting model of chaotic RBF neural network to realize the short-term load forecasting of inflection point.


## 2. Inflection Point Identification Algorithm Based on Sharp Degree

Inflection point is the most important features of load curve. The inflection point in this paper is the point that changes the direction of load curve upward or downward in a certain time interval. This paper identifies the inflection point according to the sharp degree of each point on the load curve. Set the function of load curve asP
=
p
(
t
), in which the independent variable t means time and the dependent variable P represents the load time series.Randomly select a pointP
i on the curve as the center. P
i
-
k is the point in front of P
i a distance of k. And P
i
+
k is the point behind P
i a distance of k.Define the vectork:
(1)
a
i
k
=
T
i
-
T
i
+
k
,
P
i
-
P
i
+
k
,
b
i
k
=
T
i
-
T
i
-
k
,
P
i
-
P
i
-
k
,
c
i
k
=
T
i
-
k
-
T
i
+
k
,
P
i
-
k
-
P
i
+
k
.
Define α, the angle of a
i
k and b
i
k, as the angle consisting of P
i
-
k, P
i, and P
i
+
k on the load curve. Figure 1 shows the part outline figure of the load curve. The peripheral solid line is composed of load time series. The dotted line is the circular arc fitted by P
i
-
k, P
i, and P
i
+
k. And O is the center of circular arc. Usually, the value of k is set in the range of 3–5. For the endpoint of load curve, we will take 3 to 5 sample values forward and backward on the sample load data. On the actual curve, the points P
i
-
k, P
i, and P
i
+
k can be approximately regarded as three points on the circular arc as the interval of the three points is very small [22].Figure 1
Part outline figure of the load curve.Assuming that|
P
i
P
i
-
k
|
=
|
P
i
P
i
+
k
|, then
(2)
sin
α
2
=
P
i
-
k
P
i
+
k
/
2
P
i
P
i
-
k
=
P
i
-
k
P
i
+
k
/
2
P
i
P
i
+
k
=
P
i
-
k
P
i
+
k
P
i
P
i
-
k
+
P
i
P
i
+
k
.
In this function, 0
<
α
≤
180.WhenP
i
-
k, P
i, and P
i
+
k are in a straight line, α
=
180, then
(3)
P
i
-
k
P
i
+
k
P
i
P
i
-
k
+
P
i
P
i
+
k
=
sin
α
2
=
sin
⁡
90
=
1
.
When the value of α decreases tending to zero,
(4)
P
i
-
k
P
i
+
k
P
i
P
i
-
k
+
P
i
P
i
+
k
=
sin
⁡
α
2
=
sin
⁡
0
=
0
.
Therefore, in a very small load curve, the variable sharp can be defined as sharp degree of α
(5)
sharp
=
1
-
ang
=
1
-
P
i
-
k
P
i
+
k
P
i
P
i
-
k
+
P
i
P
i
+
k
.
The larger the value of sharp, the smaller the value of α, and the curve would be more sharp. On the contrary, the curve would be more smooth. Because of the continuity of load, the identification of inflection point is closely related to the interval of load curve sequence and the set threshold value. Therefore, the threshold value can be set according to the load curve characteristics and actual situation. If sharp (
P
i
)
>
T, the P
i can be regarded as inflection point.


## 3. Prediction Model Based on Chaotic RBF Neural Network

Artificial neural network is a common type of load forecasting methods. This method is highly intelligent which has strong ability to look for patterns [23]. Radical basis function (RBF) neural network is a kind of highly efficient feed-forward neural network. It has the best approximation performance and global optimal property. And the structure is simple; the training speed is fast [24]. Chaos prediction algorithm applied to power load is a very hot research field which is caused by the intrinsic characteristics of systems. It can be predicted in the short term [25]. It predicts directly according to the laws of the objective extracting data sequence itself and does not need to establish the mapping relation model of influence factors. In theory, it not only can decrease the cost of prediction, but can improve the prediction accuracy as well [26]. The method combining chaos and RBF neural network can make full use of the randomicity and initial value sensitivity of chaos. In addition, it can make full use of the function of RBF, such as massively parallel processing, self-organizing, and self-adapting [27].Although sharp degree sequence is turbulent, it can be used to identify the inflection point. Chaotic time series are similar to random noise which is chaotic and unpredictable. But its inherent nonlinear dynamics structure makes it meet the short-term predictability [28]. Use phase space reconstruction to find the internal of regularity conversion sequences that can be described by a nonlinear mapping, and then approximate the nonlinear mapping by applying radial basis to forecast the inflection point. The process of the model established in this paper is shown in Figure 2.Figure 2
The steps of chaotic RBF neural network.First of all, we can get the sharp degree sequence which can identify the inflection point on the basis of Section2. Then, reconstruct phase space and identify chaos based on chaos theory. This paper selects mutual information method to calculate delay time,Cao method to determine embedding dimension, and the computing of largestLyapunov exponent to identify the chaos. Thirdly, the input layer of RBF neural network can be determined based on the delay time and embedding dimension. Then, train the RBF neural network and predict the sharp degree sequence making use of the trained network. Finally, determine the threshold and position the inflection point.


### 3.1. Phase Space Reconstruction and Chaos Identification

Extend the time series to three-dimension or higher dimension space by using delay-coordinate method to reconstruct state space which can find information and rules contained in the original time series. And by “Takens” theorem, the dynamic characteristic of attractor of the system can be restored in the sense of topological equivalence [29, 30]. Assume that the time sequence is x
1
,
x
2
,
x
3
,
…
,
x
n; properly select embedding dimension m and time delay τ; the reconstructed phase space is as follows:
(6)
Y
1
=
x
1
,
x
1
+
τ
,
…
,
x
1
+
m
-
1
τ
T
,
Y
2
=
x
2
,
x
2
+
τ
,
…
,
x
2
+
m
-
1
τ
T
,
⋮
Y
N
=
x
N
,
x
N
+
τ
,
…
,
x
N
+
m
-
1
τ
T
,
of which N
=
n
-
(
m
-
1
)
*
τ is the length of the vector sequence.


#### 3.1.1. Delay Time Calculated by Mutual Information Method

Mutual information method is a kind of commonly used methods to calculate delay time [31]. It is suitable for large data sets and nonlinear problem. Set offline random variables X, Y. The mutual information I
(
X
,
Y
) is as follows:
(7)
I
X
,
Y
=
H
X
+
H
Y
-
H
X
,
Y
,
H
X
=
∑
i
=
1
q
P
x
i
log
⁡
⁡
P
x
i
.
In the functions, P
(
x
i
) is the probability of happening x
i, q is the total number of possible things or states, and the logarithmic function often takes 2 for base number.For the time seriesx
i and delay time τ with an interval of n, set P
(
x
i
) as the probability of the x
i in x
i, and P
(
x
i
+
τ
), the probability of x
i
+
τ in x
i, can be calculated through the frequency in the corresponding time sequence, and P
(
x
i
,
x
i
+
τ
), the joint probability of common presence of x
i and x
i
+
τ in these two sequences, can be found in the corresponding grid on plane (
x
i
,
x
i
+
τ
). Therefore, the mutual information I
(
x
i
,
x
i
+
τ
) can be regarded as the function of delay time τ, I
(
τ
). When the I
(
τ
) meets the minimum for the first time, the lag time is the time delay of phase space reconstruction.


#### 3.1.2. Embedding Dimension Determined byCao Method

There are some methods to determine embedding dimension, such as the pseudo adjacent point method.G-P algorithm, andC-C method.Cao algorithm is a mature method which was put forward byCao Liangyue[32]. When usingCao method, firstly set a delay time, and the embedding dimension and delay time are relatively independent [33]. Define
(8)
a
i
,
m
=
X
i
m
+
1
-
X
n
i
,
m
m
+
1
X
i
m
-
X
n
i
,
m
m
.
In the function, X
i
(
m
+
1
) is a vector that i is in a space of (
m
+
1
) dimensions,  n
(
i
,
m
) is the integer that makes X
n
i
,
m
(
m
) be the nearest neighbor domain of X
i
(
m
) in the m-dimensional reconstruction space. n
i
,
m depends on i and m; and • means the Euclidean distance.Define the average of alla
i
,
m as
(9)
E
m
=
1
N
-
m
τ
∑
i
=
1
N
-
m
τ
a
i
,
m
.
Define the change of m dimensional to m
+
1 dimensional as
(10)
E
1
m
=
E
m
+
1
E
m
.
If the time series are generated by the chaotic attractor, when E
1
(
m
) saturated with the increases of m, the value of m
+
1 is the minimum embedding dimension. Define E
2
(
m
) to distinguish deterministic chaotic signal and random signal:
(11)
E
*
m
=
1
N
-
m
τ
∑
i
=
1
N
-
m
τ
x
i
+
m
τ
-
x
n
i
,
m
+
m
τ
,
E
2
m
=
E
*
m
+
1
E
*
m
.
For the random sequence, to all of the values of m, the values of E
2
(
m
) always equal about 1, while for the chaotic sequence, the values of E
2
(
m
) are related to values of m. Namely, values of E
2
(
m
) are not constant to all of m in chaotic sequence [34].


#### 3.1.3. Identify the Chaos by Computing the LargestLyapunov Exponent

The fundamental characteristics of chaos are the extreme sensitivity to initial values. The sensitivity can be measured by the exponent ofLyapunov. It reflects the divergence speed close to the initial orbit. The exponent ofLyapunov exponent reflects the contracting and tensile properties of the system in all directions. This paper calculatesLyapunov exponent based on theWolf method to judge whether the original sequence is with chaos characteristics [35].Wolf method is based on phase trajectory, phase plane, and phase volume. The process is as follows.(1)
Determine the embedding dimension and delay time to reconstruct phase space.
(2)
Track the evolution of the distance from initial point and its closest point. Limit the short separation.
(3)
Continue to the front steps until the end of the time series.
(4)
Get the maximumLyapunovexponent.


### 3.2. Chaotic Time Series Predicted by RBF Neural Network

#### 3.2.1. The Basic Principle of RBF Neural Network

RBF neural network is a feed-forward neural network consisting of input layer, hidden layer, and output layer [36, 37], as shown in Figure 3.Figure 3
RBF neural network structure.Input layer to hidden layer is linear connection. And hidden layer to output layer is nonlinear connection.


#### 3.2.2. Chaotic RBF Neural Network Prediction Steps

The specific steps of chaotic RBF neural network prediction are as follows.(
1) Establish the Network. Determine the input and output according to the calculated embedding dimension m and delay time τ. The input is a vector [
x
i
,
x
i
+
τ
,
…
,
x
i
+
(
m
-
1
)
τ
]. The output is a data x
2
+
(
m
-
1
)
τ. RBF neural network is a mapping from m-dimension to 1-dimension. In this paper, the number of input layer nodes is m. The number of output layer nodes is 1. The input matrix X and output matrix Y are as follows:
(12)
X
=
x
1
x
1
+
τ
⋯
x
1
+
(
m
-
1
)
τ
x
2
x
2
+
τ
⋯
x
2
+
(
m
-
1
)
τ
⋯
⋯
⋯
⋮
x
n
-
(
m
-
1
)
τ
x
n
-
(
m
-
2
)
τ
⋯
x
n
,
Y
=
x
2
+
(
m
-
1
)
τ
x
3
+
(
m
-
1
)
τ
⋮
x
n
+
1
.(2) Training Stage. Select a certain length of time series; set matrix X as input and vector Y as output to train the network.(3) Forecasting Stage. Set X
′
=
[
x
n
+
1
-
m
-
1
τ
,
x
n
+
1
-
m
-
2
τ
,
…
,
x
n
+
1
] as the input of the neural network, and the output Y
′
=
x
n
+
2 is the actual predictive value of the sequence. Then iterate the network with the predictive value as a new network input.


## 3.1. Phase Space Reconstruction and Chaos Identification

Extend the time series to three-dimension or higher dimension space by using delay-coordinate method to reconstruct state space which can find information and rules contained in the original time series. And by “Takens” theorem, the dynamic characteristic of attractor of the system can be restored in the sense of topological equivalence [29, 30]. Assume that the time sequence is x
1
,
x
2
,
x
3
,
…
,
x
n; properly select embedding dimension m and time delay τ; the reconstructed phase space is as follows:
(6)
Y
1
=
x
1
,
x
1
+
τ
,
…
,
x
1
+
m
-
1
τ
T
,
Y
2
=
x
2
,
x
2
+
τ
,
…
,
x
2
+
m
-
1
τ
T
,
⋮
Y
N
=
x
N
,
x
N
+
τ
,
…
,
x
N
+
m
-
1
τ
T
,
of which N
=
n
-
(
m
-
1
)
*
τ is the length of the vector sequence.


### 3.1.1. Delay Time Calculated by Mutual Information Method

Mutual information method is a kind of commonly used methods to calculate delay time [31]. It is suitable for large data sets and nonlinear problem. Set offline random variables X, Y. The mutual information I
(
X
,
Y
) is as follows:
(7)
I
X
,
Y
=
H
X
+
H
Y
-
H
X
,
Y
,
H
X
=
∑
i
=
1
q
P
x
i
log
⁡
⁡
P
x
i
.
In the functions, P
(
x
i
) is the probability of happening x
i, q is the total number of possible things or states, and the logarithmic function often takes 2 for base number.For the time seriesx
i and delay time τ with an interval of n, set P
(
x
i
) as the probability of the x
i in x
i, and P
(
x
i
+
τ
), the probability of x
i
+
τ in x
i, can be calculated through the frequency in the corresponding time sequence, and P
(
x
i
,
x
i
+
τ
), the joint probability of common presence of x
i and x
i
+
τ in these two sequences, can be found in the corresponding grid on plane (
x
i
,
x
i
+
τ
). Therefore, the mutual information I
(
x
i
,
x
i
+
τ
) can be regarded as the function of delay time τ, I
(
τ
). When the I
(
τ
) meets the minimum for the first time, the lag time is the time delay of phase space reconstruction.


### 3.1.2. Embedding Dimension Determined byCao Method

There are some methods to determine embedding dimension, such as the pseudo adjacent point method.G-P algorithm, andC-C method.Cao algorithm is a mature method which was put forward byCao Liangyue[32]. When usingCao method, firstly set a delay time, and the embedding dimension and delay time are relatively independent [33]. Define
(8)
a
i
,
m
=
X
i
m
+
1
-
X
n
i
,
m
m
+
1
X
i
m
-
X
n
i
,
m
m
.
In the function, X
i
(
m
+
1
) is a vector that i is in a space of (
m
+
1
) dimensions,  n
(
i
,
m
) is the integer that makes X
n
i
,
m
(
m
) be the nearest neighbor domain of X
i
(
m
) in the m-dimensional reconstruction space. n
i
,
m depends on i and m; and • means the Euclidean distance.Define the average of alla
i
,
m as
(9)
E
m
=
1
N
-
m
τ
∑
i
=
1
N
-
m
τ
a
i
,
m
.
Define the change of m dimensional to m
+
1 dimensional as
(10)
E
1
m
=
E
m
+
1
E
m
.
If the time series are generated by the chaotic attractor, when E
1
(
m
) saturated with the increases of m, the value of m
+
1 is the minimum embedding dimension. Define E
2
(
m
) to distinguish deterministic chaotic signal and random signal:
(11)
E
*
m
=
1
N
-
m
τ
∑
i
=
1
N
-
m
τ
x
i
+
m
τ
-
x
n
i
,
m
+
m
τ
,
E
2
m
=
E
*
m
+
1
E
*
m
.
For the random sequence, to all of the values of m, the values of E
2
(
m
) always equal about 1, while for the chaotic sequence, the values of E
2
(
m
) are related to values of m. Namely, values of E
2
(
m
) are not constant to all of m in chaotic sequence [34].


### 3.1.3. Identify the Chaos by Computing the LargestLyapunov Exponent

The fundamental characteristics of chaos are the extreme sensitivity to initial values. The sensitivity can be measured by the exponent ofLyapunov. It reflects the divergence speed close to the initial orbit. The exponent ofLyapunov exponent reflects the contracting and tensile properties of the system in all directions. This paper calculatesLyapunov exponent based on theWolf method to judge whether the original sequence is with chaos characteristics [35].Wolf method is based on phase trajectory, phase plane, and phase volume. The process is as follows.(1)
Determine the embedding dimension and delay time to reconstruct phase space.
(2)
Track the evolution of the distance from initial point and its closest point. Limit the short separation.
(3)
Continue to the front steps until the end of the time series.
(4)
Get the maximumLyapunovexponent.


## 3.1.1. Delay Time Calculated by Mutual Information Method

Mutual information method is a kind of commonly used methods to calculate delay time [31]. It is suitable for large data sets and nonlinear problem. Set offline random variables X, Y. The mutual information I
(
X
,
Y
) is as follows:
(7)
I
X
,
Y
=
H
X
+
H
Y
-
H
X
,
Y
,
H
X
=
∑
i
=
1
q
P
x
i
log
⁡
⁡
P
x
i
.
In the functions, P
(
x
i
) is the probability of happening x
i, q is the total number of possible things or states, and the logarithmic function often takes 2 for base number.For the time seriesx
i and delay time τ with an interval of n, set P
(
x
i
) as the probability of the x
i in x
i, and P
(
x
i
+
τ
), the probability of x
i
+
τ in x
i, can be calculated through the frequency in the corresponding time sequence, and P
(
x
i
,
x
i
+
τ
), the joint probability of common presence of x
i and x
i
+
τ in these two sequences, can be found in the corresponding grid on plane (
x
i
,
x
i
+
τ
). Therefore, the mutual information I
(
x
i
,
x
i
+
τ
) can be regarded as the function of delay time τ, I
(
τ
). When the I
(
τ
) meets the minimum for the first time, the lag time is the time delay of phase space reconstruction.


## 3.1.2. Embedding Dimension Determined byCao Method

There are some methods to determine embedding dimension, such as the pseudo adjacent point method.G-P algorithm, andC-C method.Cao algorithm is a mature method which was put forward byCao Liangyue[32]. When usingCao method, firstly set a delay time, and the embedding dimension and delay time are relatively independent [33]. Define
(8)
a
i
,
m
=
X
i
m
+
1
-
X
n
i
,
m
m
+
1
X
i
m
-
X
n
i
,
m
m
.
In the function, X
i
(
m
+
1
) is a vector that i is in a space of (
m
+
1
) dimensions,  n
(
i
,
m
) is the integer that makes X
n
i
,
m
(
m
) be the nearest neighbor domain of X
i
(
m
) in the m-dimensional reconstruction space. n
i
,
m depends on i and m; and • means the Euclidean distance.Define the average of alla
i
,
m as
(9)
E
m
=
1
N
-
m
τ
∑
i
=
1
N
-
m
τ
a
i
,
m
.
Define the change of m dimensional to m
+
1 dimensional as
(10)
E
1
m
=
E
m
+
1
E
m
.
If the time series are generated by the chaotic attractor, when E
1
(
m
) saturated with the increases of m, the value of m
+
1 is the minimum embedding dimension. Define E
2
(
m
) to distinguish deterministic chaotic signal and random signal:
(11)
E
*
m
=
1
N
-
m
τ
∑
i
=
1
N
-
m
τ
x
i
+
m
τ
-
x
n
i
,
m
+
m
τ
,
E
2
m
=
E
*
m
+
1
E
*
m
.
For the random sequence, to all of the values of m, the values of E
2
(
m
) always equal about 1, while for the chaotic sequence, the values of E
2
(
m
) are related to values of m. Namely, values of E
2
(
m
) are not constant to all of m in chaotic sequence [34].


## 3.1.3. Identify the Chaos by Computing the LargestLyapunov Exponent

The fundamental characteristics of chaos are the extreme sensitivity to initial values. The sensitivity can be measured by the exponent ofLyapunov. It reflects the divergence speed close to the initial orbit. The exponent ofLyapunov exponent reflects the contracting and tensile properties of the system in all directions. This paper calculatesLyapunov exponent based on theWolf method to judge whether the original sequence is with chaos characteristics [35].Wolf method is based on phase trajectory, phase plane, and phase volume. The process is as follows.(1)
Determine the embedding dimension and delay time to reconstruct phase space.
(2)
Track the evolution of the distance from initial point and its closest point. Limit the short separation.
(3)
Continue to the front steps until the end of the time series.
(4)
Get the maximumLyapunovexponent.


## 3.2. Chaotic Time Series Predicted by RBF Neural Network

### 3.2.1. The Basic Principle of RBF Neural Network

RBF neural network is a feed-forward neural network consisting of input layer, hidden layer, and output layer [36, 37], as shown in Figure 3.Figure 3
RBF neural network structure.Input layer to hidden layer is linear connection. And hidden layer to output layer is nonlinear connection.


### 3.2.2. Chaotic RBF Neural Network Prediction Steps

The specific steps of chaotic RBF neural network prediction are as follows.(
1) Establish the Network. Determine the input and output according to the calculated embedding dimension m and delay time τ. The input is a vector [
x
i
,
x
i
+
τ
,
…
,
x
i
+
(
m
-
1
)
τ
]. The output is a data x
2
+
(
m
-
1
)
τ. RBF neural network is a mapping from m-dimension to 1-dimension. In this paper, the number of input layer nodes is m. The number of output layer nodes is 1. The input matrix X and output matrix Y are as follows:
(12)
X
=
x
1
x
1
+
τ
⋯
x
1
+
(
m
-
1
)
τ
x
2
x
2
+
τ
⋯
x
2
+
(
m
-
1
)
τ
⋯
⋯
⋯
⋮
x
n
-
(
m
-
1
)
τ
x
n
-
(
m
-
2
)
τ
⋯
x
n
,
Y
=
x
2
+
(
m
-
1
)
τ
x
3
+
(
m
-
1
)
τ
⋮
x
n
+
1
.(2) Training Stage. Select a certain length of time series; set matrix X as input and vector Y as output to train the network.(3) Forecasting Stage. Set X
′
=
[
x
n
+
1
-
m
-
1
τ
,
x
n
+
1
-
m
-
2
τ
,
…
,
x
n
+
1
] as the input of the neural network, and the output Y
′
=
x
n
+
2 is the actual predictive value of the sequence. Then iterate the network with the predictive value as a new network input.


## 3.2.1. The Basic Principle of RBF Neural Network

RBF neural network is a feed-forward neural network consisting of input layer, hidden layer, and output layer [36, 37], as shown in Figure 3.Figure 3
RBF neural network structure.Input layer to hidden layer is linear connection. And hidden layer to output layer is nonlinear connection.


## 3.2.2. Chaotic RBF Neural Network Prediction Steps

The specific steps of chaotic RBF neural network prediction are as follows.(
1) Establish the Network. Determine the input and output according to the calculated embedding dimension m and delay time τ. The input is a vector [
x
i
,
x
i
+
τ
,
…
,
x
i
+
(
m
-
1
)
τ
]. The output is a data x
2
+
(
m
-
1
)
τ. RBF neural network is a mapping from m-dimension to 1-dimension. In this paper, the number of input layer nodes is m. The number of output layer nodes is 1. The input matrix X and output matrix Y are as follows:
(12)
X
=
x
1
x
1
+
τ
⋯
x
1
+
(
m
-
1
)
τ
x
2
x
2
+
τ
⋯
x
2
+
(
m
-
1
)
τ
⋯
⋯
⋯
⋮
x
n
-
(
m
-
1
)
τ
x
n
-
(
m
-
2
)
τ
⋯
x
n
,
Y
=
x
2
+
(
m
-
1
)
τ
x
3
+
(
m
-
1
)
τ
⋮
x
n
+
1
.(2) Training Stage. Select a certain length of time series; set matrix X as input and vector Y as output to train the network.(3) Forecasting Stage. Set X
′
=
[
x
n
+
1
-
m
-
1
τ
,
x
n
+
1
-
m
-
2
τ
,
…
,
x
n
+
1
] as the input of the neural network, and the output Y
′
=
x
n
+
2 is the actual predictive value of the sequence. Then iterate the network with the predictive value as a new network input.


## 4. The Empirical Example Analysis

To do empirical analysis, this paper selects the load on May 2, 2011, May 9, May 16, and May 23, and May 30 (Monday) of a region and collects 96 points per day, a total of 480 load data to calculate. Among them, set the data of first four days, a total of 384 data as the training sample, the data of last day, and a total of 96 as test samples, to verify and analyze the load prediction model of inflection points.Firstly, compose the load data of May 2, 9, 16, and 23 to a load sequence. Then, calculate the sharp degree of every point of the load data according to the identification algorithm of inflection point based on sharp degree that was mentioned above. The load sequence and sharp degree sequence are, respectively, shown in Figures4 and 5.Figure 4
The original load trend chart of a region.Figure 5
The sharp degree of load sequence diagram chart.As can be seen from Figure5, the polarization phenomenon of sharp degree sequence is obvious. The point of sharp degree sequence is corresponding to the point of original sequence. Most of the values in Figure 5 are less than 0.1, which are corresponding to the flat load curve in Figure 4. Only a few values in Figure 5 are between 0.1 and 1, which are corresponding to the inflection points in Figure 4. Therefore set the threshold as 0.1. The load point with a sharp degree value greater than 0.1 is the inflection point defined in this paper. Thus, inflection point can be effectively identified by the sharp degree sequence.According to the mutual information method, the delay timeτ
=
4. And calculate the minimum embedding dimension withCao method. It can be seen in Figure 6 that E
1 tends to be saturate along with the increase of m. When m
≥
5, E
1 remains the same. So the minimum embedding dimension is 6 (m
=
5
+
1
=
6). At the same time, it also can be seen in the diagram that, with different values of m, E
2 is not always equal to 1. The value ofLyapunov exponent is 0.3017 after being calculated byWolf method, which is greater than zero. So the conversion sequences of input can be judged as chaotic sequence.Figure 6
Cao method for minimum embedding dimension.Reconstruct the phase space according to the minimum embedding dimension and delay time. Then we can predict the sharp degree of load sequence based on RBF neural network. The most critical part of determining RBF network is the choice of nonlinear excitation function. In some typical excitation functions, this paper uses the Gaussian function as the excitation function for its radial symmetry, smoothness, and simple expression formula. Set the error of training system to 0.001. Select the self-organizing selection center method to determine the network center, width, and weight. Then train the training sample with RBF neural network. The convergence curve in training process is shown in Figure7. We can see that the blue trace is the convergence curve of training. The red horizontal line which parallels the x-axis and equals 10−3 is the goal of training. The green vertical line which parallels the y-axis and equals 285 epochs at the far right side of the plot means that best training performance is 0.00099767 at epoch 285. The forecasting result of test samples of the load sharp degree sequence is shown in Figure 8.Figure 7
The convergence curve in training process.Figure 8
Contrast figure of chaotic RBF inflection point sequence predicted values and the real values.This paper uses the average absolute percentage error MAPE and the root mean square error RMSE to evaluate the forecasting effect, and the formula is(13)
MAPE
=
1
N
∑
n
=
1
N
n
y
^
n
-
y
n
y
n
,
RMSE
=
1
N
∑
n
=
1
N
y
^
n
-
y
n
2
1
/
2
.
The calculation shows that the MAPE is 5.293% and the RMSE is 6.391%. The predicting is with a high accuracy.The forecasting error curve of load sharp degree sequence test samples based on chaotic RBF is shown in Figure9. It can be seen that there is one point whose error value is bigger than others. The point is the ninth point of prediction sequence. The actual value of this point is less than 0.001. However, the predicted value is 0.576. The reason of this situation is that the ninth point of 96 points in the historical everyday data is inflection point. The ninth point of forecasting sequence is an abnormal point.Figure 9
Error graph of chaotic RBF inflection.This paper selects BP neural network model in order to verify the effectiveness and superiority of the proposed algorithm. BP neural network is one of the most commonly used kinds of artificial neural network. The forecasting result of test samples based on chaotic RBF and BP is shown in Figure10. The MAPE of the results based on BP neural network is 9.149%, which is much higher than the MAPE of chaotic RBF. Thus, the superiority of chaotic RBF algorithm is evident particularly.Figure 10
Contrast figure of the real values, predicted values based on chaotic RBF, and predicted values based on BP.Set the inflection point thresholdT
=
0.1, extract the points with a predictive value greater than 0.1 in sharp degree sequence, and then locate and highlight the points in the known load curve on May 30, as shown in Figure 11.Figure 11
The inflection point location map according to the predicted results.It can be seen from Figure11 that most of the inflection points of test samples can be accurately predicted by either using inflection point identification algorithm based on contour sharp degree or forecasting model based on chaotic RBF neural network and that verified that inflection point prediction model proposed in this paper is of high accuracy.In order to further validate the applicability and effectiveness of model, this paper selected representative load curves of different seasons to carry out the empirical researches. The prediction training sample contains 96 points per day of the same week type 4 weeks before the prediction, and the training data totally contains 384 points. The prediction error results are shown in Table1.Table 1
Results of empirical study in 2011.
Number
Time
MAPE
RMSE
Number
Time
MAPE
RMSE
1
January 3
6.322
2.647
9
August 9
3.095
2.191
2
January 11
3.769
5.97
10
August 16
3.616
2.094
3
January 19
6.937
3.969
11
August 25
2.31
5.967
4
January 28
4.723
6.162
12
August 31
3.202
1.987
5
May 4
3.11
2.217
13
October 8
2.459
5.967
6
May 18
8.468
4.392
14
October 19
4.193
2.228
7
May 24
4.271
2.344
15
October 22
2.719
5.969
8
May 31
5.187
6.153
16
October 28
3.616
2.092
The mean of MAPE
4.25%
The mean of RMSE
3.897%The forecasting of 16 groups data shows that the average MAPE of the model proposed in this paper is 4.25%. The average RMSE is 3.897%. It suggests that the forecast effect is fine and the model is with strong practicability and applicability.


## 5. Conclusion

This paper puts forward a feasible load inflection point prediction method by proposing an inflection point forecasting model that can realize effective prediction of inflection point based on the algorithm of sharp degree and chaotic RBF neural network on the basis of research on short-term power load.In the calculation example, the paper proposed an empirical analysis method of 96 points per day, and the algorithm can be also applied to the inflection point prediction of a shorter or a longer time interval. However, the time interval and different threshold selection will directly affect the inflection point identification based on the forecasted sharp degree sequence. According to actual needs, the original load time interval and the value of threshold can be adjusted.Although forecasting of the load curve contains the information of inflection point, during the ordinary load forecasting, the prediction error of inflection points is slightly larger than other points. This paper transformed the original load sequence based on the sharp degree. And after transformation, the polarization phenomenon of the sequence is obvious that highlights the regularity of the change of the inflection point. In the later research work, the inflection point forecast correction, the improvement of original load curve forecasting results, and mining of the influence factors of inflection point to increase the input dimension of inflection point prediction can be considered to further improve the prediction accuracy.



---

*Source: 231765-2015-01-08.xml*