# Application of Data Mining Algorithm in Electric Power Marketing Inspection Forecast Analysis

Authors: Weijiang Wu; Gaojun Xu; Xusheng Qian; Chengbo Chu
Journal: International Transactions on Electrical Energy Systems
 (2022)

---

## Abstract

In order to improve the accuracy of power load forecasting and deal with the challenge of insufficient stand-alone computing resources brought by the intelligent power system, data extraction algorithms are used in energy market analysis. Preliminary weather performance algorithms are optimized online based on the nature of the power load data. In order to improve the accuracy of the computational algorithms, the concept of classification and various agents was introduced. The MapReduce cloud computing programming framework is used simultaneously to improve design algorithms to improve the ability to process large amounts of data. The actual electronic data provided by EUNITE was selected as a sample analysis and a complete experiment of the 32-node cloud computing group. The results of the experiment show that the load data provided by EUNITE was expanded into four different data sets: 1000 times, 2000 times, 4000 times, and 8000 times. Works on older data and the cloud. Platforms with groups of 4, 8, 16, and 32 nodes are designed to calculate acceleration ratios and scale speeds. The acceleration ratio of a perfectly parallel system algorithm can reach 1. However, in practical applications, as the number of cluster nodes increases, so does the transmission cost of the node network.Conclusions. Accuracy assumptions based on this model are better than the general evaluation of supported vector regression prediction algorithms and neural network algorithms, and the planning process is well underway.


---

## Body

## 1. Introduction

In recent years, the power system accumulated tens of thousands or even hundreds of millions of pieces of data information in the database, and there are many useful information in the database data. This information is of great help to leaders in making decisions. Nowadays, information technology is so advanced that the use of these data resources provides technical support. People also try to find the possible internal laws from these data resources. If appropriate information technology is adopted to process these data, power enterprises can better serve people. Electric power is an industry related to national economy and people’s livelihood. The quality of its service greatly affects people’s quality of life. The data could also help power companies cut costs and boost profits. By studying the law of market change, China’s electric power enterprises represented by State Grid Corporation are implementing informatization [1]. It also includes research on how to extract useful information from this vast amount of data through effective information technology. China is now a socialist market economy; the power enterprise information is also to serve the market economy. How to make the power enterprises and customers between the win-win is the problem that China’s power enterprises face. The market orientation replaces the original production orientation, improves efficiency and reduces costs internally, improves service level externally, and expands the market [2]. Therefore, it puts forward new requirements for the functions of electric power marketing system of enterprises. Electric power industry is a basic industry, which affects all sectors of society. Whether electric power forecast is accurate or not has great influence on society and electric power enterprise itself. For example, China has experienced a serious shortage of power supply due to insufficient investment in power facilities due to insufficient prediction of future electricity demand, which has a great negative impact on the development of the 11th Five-Year Plan [3]. The importance of power demand forecasting can be seen. Demand forecasting is a key component of electric power marketing system. The forecast of electricity demand plays a key role in the construction of electric power facilities, the formulation of electric power marketing strategy, and the decision and subordinate of electric power production schedule tracking. So, how to improve the accuracy of electricity demand prediction becomes an important topic.


## 2. Literature Review

Tai et al. developed the concept of using smart decision-making technology in the field of electronics and developed the “DSS + problem-solving + knowledge base” smart decision-making process (IDSS) to fulfill decision-making tasks [4]. In studying the principles and algorithms of systems to support decision-making in the energy sector based on data mining [5], Wolf et al. integrated the real issues of the energy market in China. Based on a view of the nature and multidimensionality of big data in different data mining models, a power system decision-making system design process model was developed that combines neural network structure and spatial selection algorithms for data mining and organically integrates problem solving and interpretation functions [6]. In a short-term load hypothesis based on an uncertain neural network, Wang et al., in the study of short-term prediction, the BP algorithm was introduced using a neural network, and a holiday model was developed to calculate the specific holiday load. Based on the data from the analysis of the power plant in Guangxi, the concept of energy load calculation based on the neural network was well received [7]. Sharma conducted research on topics related to power decision-making support system in recent years, for example, support for decision-making in the energy sector based on data warehousing technology, forecasting of electricity production load, use of group research in the sector, use of electricity, structural research, use of electrical decision-making industry, etc. Some research progress has been made [8]. Shafiei Chafi and Afrakhte developed a three-stage DSS system: a language system (LS), a problem system (PPS), and a knowledge system (KS). This model is “problem-solving,” “conscious,” and in some cases has consequences [9].Aiming at the actual application scenarios of power load prediction, this article proposes a distributed extreme learning machine power load prediction algorithm based on MapReduce, which applies online sequence optimization extreme learning machine to power load prediction, and introduces cloud computing technology and multiagent technology to improve its ability to process massive high-dimensional data and improve the accuracy of load prediction [10]. The parallel performance and load prediction accuracy of the improved algorithm were tested on a cluster built in the laboratory, and an example was used to analyze the real power load data.


## 3. Research Methods

### 3.1. Cloud Computing

The Hadoop cloud computing platform developed by the Apache Foundation is a fully open-source application that supports the MapReduce framework and data exchange. MapReduce is a sample program that processes large files in batches. This was the first request from Google to address the issue of distribution and counting [11]. The MapReduce framework makes it easy to use by protecting the content from being used. In large groups, complex parallel computations are abstracted into two user-written functions, the Map and the Reduction function.The specific explanation is as follows:(1)
Access. The input file is first read from the fragmented file and then truncated. The MapReduce framework allocates data slices to each worksheet.(2)
Schedule. The MapReduce framework fixes the data format as a set of Content and Value pairs, runs, and executes framework shared key-value (key, value) processes according to user-defined operating system requirements [12]. Finally, a new pair of averages (Key, Value) is created.(3)
Competition. At this stage, it takes more time to convert a mean-value pair from a Map node to a Reduced node, depending on bandwidth and CPU speed, rather than Map and Reduce. At this stage, the intermediate values corresponding to the same average concept are combined and generated (main, list of results), and the values are determined.(4)
Reduction. Performs the user-written reduce function. Repeat all intermediate values and their intermediate keys or product names, run user processing data, and generate new content and double values. [13].(5)
Output. Export the reduced output to a distributed file system.


### 3.2. Extreme Learning Machine Algorithm

#### 3.2.1. Description of Extreme Learning Machine Algorithm

Cloud learning technology algorithms are different from traditional direct feedback neural network education. The team does not require repetition and carefully selects and adjusts difficult techniques and procedures to conceal injustice. To minimize training errors, the weight concealment procedure is defined by an algorithm [14]. The special weather training algorithm is described as follows.N arbitrary data xi,ti, where xi=xi1,xi2,…,xinT∈Rn and ti=ti1,ti2,…,timT∈Rm contain Nn hidden layer nodes and the regression model of extreme learning machine whose excitation function is GG can be expressed as(1)fN¯=∑i=1N¯βiGai,bi,xj=tj,j=1,…,N,where ai=a1,a2,…,anT is the weight vector of thei th hidden node and the input node; βi=β1,β2,…,βnT is the weight vector of the i th hidden layer node and the output node. bi is bias of the i th hidden layer node; N¯ is the number of hidden layer nodes. Formula (1) can be abbreviated as (2)Hβ=T,(3)Ha1,…,aN˜,b1,…,bN˜,x1,…,xN=Ga1,b1,x1⋯GaN˜,bN˜,x1⋮⋮⋮Ga1,b1,xN⋯GaN˜,bN˜,xNN⋅N^,(4)β=β1T⋯βN¯TN¯⋅m,T=t1T⋯tNTN⋅m,where H is the output matrix of the hidden layer, and the i th column of H corresponds to the output vector of the i th hidden layer of inputx1,x2,…,xn. The weighted output can be obtained by solving the least-squares solution of the linear equation.(5)Hβ−T=HH†T−T=minβHβ−T.The least squares solution is(6)β=H†T,where H† is the general Moore–Penrose inverse of the output matrix of H hidden layers.


#### 3.2.2. Disadvantages of Extreme Learning Machine Algorithm

Although the ELM training algorithm is superior to the SVM and BP algorithms in regression policy in terms of counting, accuracy, training algorithms, and time-tested performance, the ELM training algorithm has been introduced into energy prediction and improved weather performance. However, the ELM training algorithm is a package training algorithm, and online optimization is very important as it is not completely suitable for the power load prediction scenario in the actual power load calculation. The online optimization ELM algorithm does not need to be repeated to add new data to the learning process [15]. In addition, the ability to generate large data of the adjustment algorithm using cloud computing technology and multiagent distribution technology has been improved to prevent discrepancies between data values and high-dimensional data of electronic information, and the accuracy of load calculations has been improved. This algorithm is called MapReudce based on MapReduce weighted online sequential extreme learning machine, Noyon, OSELM-WA.


### 3.3. Design MR-OSELM-WA Algorithm Based on Cloud Computing

#### 3.3.1. Online Sequential Extreme Learning Machine Algorithm

The steps of the online education system are as follows:(1)
Initial phase: part of the data set is defined as the initial training, and the number of nodes in the hidden stageN˜ is set manually. Let k=0. Firstly, weight vector wi=w1,w2,…,wnT of the i th hidden layer node and input node and parameters of excitation function are generated randomly [16]. Then, the initial hidden the layer output matrix H0 is calculated. Compute the initial output weight vector β0. (7)P0=H0TH0−1,(8)β0=P0H0T0,whereT0=t1,t2,…,tN is the output vector of the target value.(2)
Online elementary education: when the new training data arrives, it is considered as thek+1 sample of the entire training process.Firstly, calculate the output matrix of the new hidden layer:(9)Hk+1=Ga1,b1,xk,…,GaL,bL,xk+1.Then, letTk+1=t∑j=0kNj+1,…,t∑j=0kNj+jT.(3)
Through the following formula, calculate the output weight vectorβ0k+1:(10)Pk+1=Pk−PkHk+1TI+Hk+1PkHk+1T−1Hk+1Pk,βk+1=βk+Kk+1−1Hk+1TTk+1−Hk+1βk.(4)
Setk=k+1, go back to step 1, and continue to train the next training data.


#### 3.3.2. MR-OSELM-WA Algorithm Based on Cloud Computing

(1) MR-OSELM-WA Algorithm Idea. As the power of intelligence deepens, the power of data transport increases geometrically, and the use of online sequential extreme learning machine (OSELM) algorithms for power failure prediction is not enough [17]. As the smart grid cloud computing model continues to mature, this paper uses the multiagent concept and cloud computing to develop a hyperlearning algorithm.The idea of MR-OSELM-WA algorithm is that the multiagent runs the weight balance of OS-ELM to execute, and the OSELM node with higher prediction accuracy should get higher weight when calculating the final predicted value. The OSELM predicted value of each node is calculated by weighted average to get the final predicted value. The weight of each node is(11)y¯=∑k=1Kαkyk∑kKαk.y¯, yk, and αk are, respectively, the final predicted value, the predicted value of the k th OSELM. and the predicted weight of the k th OSELM. The predicted weight is calculated by standard error function E and gradient rise method:(12)E=12t−y¯2,where t is the target value of the input training set of each OSELM agent. According to the gradient ascent strategy, αk is(13)Δαk=−η∂E∂αk=−η∂E∂y¯⋅∂y¯∂αk,where η is the learning rate; set η=0.1. According to equation (14), it can be concluded that(14)Δαk=ηt−y¯yk∑i=1Kαi−∑i=1Kαiyi∑i=1Kαi2,where αk can be updated by αk←αk+Δαk.(2) Detailed Steps of MR-OSELM-WA Algorithm. The main idea of the MapReduce programming framework is to use the parallel structure by writing the corresponding text and Reduce functions. The average results of the MR-OSELM-WA algorithm are stored in the HBase data distribution and distribution cache. The distributed MR-OSELM-WA prediction and decision model based on MapReduce is shown in Figure 1:(1)
Large instructional packages can be read from the data distribution on the cloud computing platform, and different learning sessions can be obtained by segmenting training packages through a simple process of the MapReduce programming system [18]. Number is the number of map locations in a cloud group.(2)
Subpackage training is taught in parallel according to the step logic of the map function, such as the logic of OS-ELM training machine learning algorithm, which is equivalent to machine training which is different.(3)
The benefits of working in the diagram, which is an estimate of the importance of different training systems, were passed from the Shuffle phase of the MapReduce programming frame to the Reduced phase, and the weight of the estimated values generated by the MapReduce function was determined accordingly. According to the above weight calculation method, the predicted value weight of each Map operation output is determined, and then the final predicted value is calculated.(4)
Learn the routine procedure for estimating average and long-term loads along the specified axis, slide as required, and return to step 1. Estimate the next day behind the load data on a regular basis.Figure 1
Distributed MR-OSELM-WA predictive decision model based on MapReduce.


## 3.1. Cloud Computing

The Hadoop cloud computing platform developed by the Apache Foundation is a fully open-source application that supports the MapReduce framework and data exchange. MapReduce is a sample program that processes large files in batches. This was the first request from Google to address the issue of distribution and counting [11]. The MapReduce framework makes it easy to use by protecting the content from being used. In large groups, complex parallel computations are abstracted into two user-written functions, the Map and the Reduction function.The specific explanation is as follows:(1)
Access. The input file is first read from the fragmented file and then truncated. The MapReduce framework allocates data slices to each worksheet.(2)
Schedule. The MapReduce framework fixes the data format as a set of Content and Value pairs, runs, and executes framework shared key-value (key, value) processes according to user-defined operating system requirements [12]. Finally, a new pair of averages (Key, Value) is created.(3)
Competition. At this stage, it takes more time to convert a mean-value pair from a Map node to a Reduced node, depending on bandwidth and CPU speed, rather than Map and Reduce. At this stage, the intermediate values corresponding to the same average concept are combined and generated (main, list of results), and the values are determined.(4)
Reduction. Performs the user-written reduce function. Repeat all intermediate values and their intermediate keys or product names, run user processing data, and generate new content and double values. [13].(5)
Output. Export the reduced output to a distributed file system.


## 3.2. Extreme Learning Machine Algorithm

### 3.2.1. Description of Extreme Learning Machine Algorithm

Cloud learning technology algorithms are different from traditional direct feedback neural network education. The team does not require repetition and carefully selects and adjusts difficult techniques and procedures to conceal injustice. To minimize training errors, the weight concealment procedure is defined by an algorithm [14]. The special weather training algorithm is described as follows.N arbitrary data xi,ti, where xi=xi1,xi2,…,xinT∈Rn and ti=ti1,ti2,…,timT∈Rm contain Nn hidden layer nodes and the regression model of extreme learning machine whose excitation function is GG can be expressed as(1)fN¯=∑i=1N¯βiGai,bi,xj=tj,j=1,…,N,where ai=a1,a2,…,anT is the weight vector of thei th hidden node and the input node; βi=β1,β2,…,βnT is the weight vector of the i th hidden layer node and the output node. bi is bias of the i th hidden layer node; N¯ is the number of hidden layer nodes. Formula (1) can be abbreviated as (2)Hβ=T,(3)Ha1,…,aN˜,b1,…,bN˜,x1,…,xN=Ga1,b1,x1⋯GaN˜,bN˜,x1⋮⋮⋮Ga1,b1,xN⋯GaN˜,bN˜,xNN⋅N^,(4)β=β1T⋯βN¯TN¯⋅m,T=t1T⋯tNTN⋅m,where H is the output matrix of the hidden layer, and the i th column of H corresponds to the output vector of the i th hidden layer of inputx1,x2,…,xn. The weighted output can be obtained by solving the least-squares solution of the linear equation.(5)Hβ−T=HH†T−T=minβHβ−T.The least squares solution is(6)β=H†T,where H† is the general Moore–Penrose inverse of the output matrix of H hidden layers.


### 3.2.2. Disadvantages of Extreme Learning Machine Algorithm

Although the ELM training algorithm is superior to the SVM and BP algorithms in regression policy in terms of counting, accuracy, training algorithms, and time-tested performance, the ELM training algorithm has been introduced into energy prediction and improved weather performance. However, the ELM training algorithm is a package training algorithm, and online optimization is very important as it is not completely suitable for the power load prediction scenario in the actual power load calculation. The online optimization ELM algorithm does not need to be repeated to add new data to the learning process [15]. In addition, the ability to generate large data of the adjustment algorithm using cloud computing technology and multiagent distribution technology has been improved to prevent discrepancies between data values and high-dimensional data of electronic information, and the accuracy of load calculations has been improved. This algorithm is called MapReudce based on MapReduce weighted online sequential extreme learning machine, Noyon, OSELM-WA.


## 3.2.1. Description of Extreme Learning Machine Algorithm

Cloud learning technology algorithms are different from traditional direct feedback neural network education. The team does not require repetition and carefully selects and adjusts difficult techniques and procedures to conceal injustice. To minimize training errors, the weight concealment procedure is defined by an algorithm [14]. The special weather training algorithm is described as follows.N arbitrary data xi,ti, where xi=xi1,xi2,…,xinT∈Rn and ti=ti1,ti2,…,timT∈Rm contain Nn hidden layer nodes and the regression model of extreme learning machine whose excitation function is GG can be expressed as(1)fN¯=∑i=1N¯βiGai,bi,xj=tj,j=1,…,N,where ai=a1,a2,…,anT is the weight vector of thei th hidden node and the input node; βi=β1,β2,…,βnT is the weight vector of the i th hidden layer node and the output node. bi is bias of the i th hidden layer node; N¯ is the number of hidden layer nodes. Formula (1) can be abbreviated as (2)Hβ=T,(3)Ha1,…,aN˜,b1,…,bN˜,x1,…,xN=Ga1,b1,x1⋯GaN˜,bN˜,x1⋮⋮⋮Ga1,b1,xN⋯GaN˜,bN˜,xNN⋅N^,(4)β=β1T⋯βN¯TN¯⋅m,T=t1T⋯tNTN⋅m,where H is the output matrix of the hidden layer, and the i th column of H corresponds to the output vector of the i th hidden layer of inputx1,x2,…,xn. The weighted output can be obtained by solving the least-squares solution of the linear equation.(5)Hβ−T=HH†T−T=minβHβ−T.The least squares solution is(6)β=H†T,where H† is the general Moore–Penrose inverse of the output matrix of H hidden layers.


## 3.2.2. Disadvantages of Extreme Learning Machine Algorithm

Although the ELM training algorithm is superior to the SVM and BP algorithms in regression policy in terms of counting, accuracy, training algorithms, and time-tested performance, the ELM training algorithm has been introduced into energy prediction and improved weather performance. However, the ELM training algorithm is a package training algorithm, and online optimization is very important as it is not completely suitable for the power load prediction scenario in the actual power load calculation. The online optimization ELM algorithm does not need to be repeated to add new data to the learning process [15]. In addition, the ability to generate large data of the adjustment algorithm using cloud computing technology and multiagent distribution technology has been improved to prevent discrepancies between data values and high-dimensional data of electronic information, and the accuracy of load calculations has been improved. This algorithm is called MapReudce based on MapReduce weighted online sequential extreme learning machine, Noyon, OSELM-WA.


## 3.3. Design MR-OSELM-WA Algorithm Based on Cloud Computing

### 3.3.1. Online Sequential Extreme Learning Machine Algorithm

The steps of the online education system are as follows:(1)
Initial phase: part of the data set is defined as the initial training, and the number of nodes in the hidden stageN˜ is set manually. Let k=0. Firstly, weight vector wi=w1,w2,…,wnT of the i th hidden layer node and input node and parameters of excitation function are generated randomly [16]. Then, the initial hidden the layer output matrix H0 is calculated. Compute the initial output weight vector β0. (7)P0=H0TH0−1,(8)β0=P0H0T0,whereT0=t1,t2,…,tN is the output vector of the target value.(2)
Online elementary education: when the new training data arrives, it is considered as thek+1 sample of the entire training process.Firstly, calculate the output matrix of the new hidden layer:(9)Hk+1=Ga1,b1,xk,…,GaL,bL,xk+1.Then, letTk+1=t∑j=0kNj+1,…,t∑j=0kNj+jT.(3)
Through the following formula, calculate the output weight vectorβ0k+1:(10)Pk+1=Pk−PkHk+1TI+Hk+1PkHk+1T−1Hk+1Pk,βk+1=βk+Kk+1−1Hk+1TTk+1−Hk+1βk.(4)
Setk=k+1, go back to step 1, and continue to train the next training data.


### 3.3.2. MR-OSELM-WA Algorithm Based on Cloud Computing

(1) MR-OSELM-WA Algorithm Idea. As the power of intelligence deepens, the power of data transport increases geometrically, and the use of online sequential extreme learning machine (OSELM) algorithms for power failure prediction is not enough [17]. As the smart grid cloud computing model continues to mature, this paper uses the multiagent concept and cloud computing to develop a hyperlearning algorithm.The idea of MR-OSELM-WA algorithm is that the multiagent runs the weight balance of OS-ELM to execute, and the OSELM node with higher prediction accuracy should get higher weight when calculating the final predicted value. The OSELM predicted value of each node is calculated by weighted average to get the final predicted value. The weight of each node is(11)y¯=∑k=1Kαkyk∑kKαk.y¯, yk, and αk are, respectively, the final predicted value, the predicted value of the k th OSELM. and the predicted weight of the k th OSELM. The predicted weight is calculated by standard error function E and gradient rise method:(12)E=12t−y¯2,where t is the target value of the input training set of each OSELM agent. According to the gradient ascent strategy, αk is(13)Δαk=−η∂E∂αk=−η∂E∂y¯⋅∂y¯∂αk,where η is the learning rate; set η=0.1. According to equation (14), it can be concluded that(14)Δαk=ηt−y¯yk∑i=1Kαi−∑i=1Kαiyi∑i=1Kαi2,where αk can be updated by αk←αk+Δαk.(2) Detailed Steps of MR-OSELM-WA Algorithm. The main idea of the MapReduce programming framework is to use the parallel structure by writing the corresponding text and Reduce functions. The average results of the MR-OSELM-WA algorithm are stored in the HBase data distribution and distribution cache. The distributed MR-OSELM-WA prediction and decision model based on MapReduce is shown in Figure 1:(1)
Large instructional packages can be read from the data distribution on the cloud computing platform, and different learning sessions can be obtained by segmenting training packages through a simple process of the MapReduce programming system [18]. Number is the number of map locations in a cloud group.(2)
Subpackage training is taught in parallel according to the step logic of the map function, such as the logic of OS-ELM training machine learning algorithm, which is equivalent to machine training which is different.(3)
The benefits of working in the diagram, which is an estimate of the importance of different training systems, were passed from the Shuffle phase of the MapReduce programming frame to the Reduced phase, and the weight of the estimated values generated by the MapReduce function was determined accordingly. According to the above weight calculation method, the predicted value weight of each Map operation output is determined, and then the final predicted value is calculated.(4)
Learn the routine procedure for estimating average and long-term loads along the specified axis, slide as required, and return to step 1. Estimate the next day behind the load data on a regular basis.Figure 1
Distributed MR-OSELM-WA predictive decision model based on MapReduce.


## 3.3.1. Online Sequential Extreme Learning Machine Algorithm

The steps of the online education system are as follows:(1)
Initial phase: part of the data set is defined as the initial training, and the number of nodes in the hidden stageN˜ is set manually. Let k=0. Firstly, weight vector wi=w1,w2,…,wnT of the i th hidden layer node and input node and parameters of excitation function are generated randomly [16]. Then, the initial hidden the layer output matrix H0 is calculated. Compute the initial output weight vector β0. (7)P0=H0TH0−1,(8)β0=P0H0T0,whereT0=t1,t2,…,tN is the output vector of the target value.(2)
Online elementary education: when the new training data arrives, it is considered as thek+1 sample of the entire training process.Firstly, calculate the output matrix of the new hidden layer:(9)Hk+1=Ga1,b1,xk,…,GaL,bL,xk+1.Then, letTk+1=t∑j=0kNj+1,…,t∑j=0kNj+jT.(3)
Through the following formula, calculate the output weight vectorβ0k+1:(10)Pk+1=Pk−PkHk+1TI+Hk+1PkHk+1T−1Hk+1Pk,βk+1=βk+Kk+1−1Hk+1TTk+1−Hk+1βk.(4)
Setk=k+1, go back to step 1, and continue to train the next training data.


## 3.3.2. MR-OSELM-WA Algorithm Based on Cloud Computing

(1) MR-OSELM-WA Algorithm Idea. As the power of intelligence deepens, the power of data transport increases geometrically, and the use of online sequential extreme learning machine (OSELM) algorithms for power failure prediction is not enough [17]. As the smart grid cloud computing model continues to mature, this paper uses the multiagent concept and cloud computing to develop a hyperlearning algorithm.The idea of MR-OSELM-WA algorithm is that the multiagent runs the weight balance of OS-ELM to execute, and the OSELM node with higher prediction accuracy should get higher weight when calculating the final predicted value. The OSELM predicted value of each node is calculated by weighted average to get the final predicted value. The weight of each node is(11)y¯=∑k=1Kαkyk∑kKαk.y¯, yk, and αk are, respectively, the final predicted value, the predicted value of the k th OSELM. and the predicted weight of the k th OSELM. The predicted weight is calculated by standard error function E and gradient rise method:(12)E=12t−y¯2,where t is the target value of the input training set of each OSELM agent. According to the gradient ascent strategy, αk is(13)Δαk=−η∂E∂αk=−η∂E∂y¯⋅∂y¯∂αk,where η is the learning rate; set η=0.1. According to equation (14), it can be concluded that(14)Δαk=ηt−y¯yk∑i=1Kαi−∑i=1Kαiyi∑i=1Kαi2,where αk can be updated by αk←αk+Δαk.(2) Detailed Steps of MR-OSELM-WA Algorithm. The main idea of the MapReduce programming framework is to use the parallel structure by writing the corresponding text and Reduce functions. The average results of the MR-OSELM-WA algorithm are stored in the HBase data distribution and distribution cache. The distributed MR-OSELM-WA prediction and decision model based on MapReduce is shown in Figure 1:(1)
Large instructional packages can be read from the data distribution on the cloud computing platform, and different learning sessions can be obtained by segmenting training packages through a simple process of the MapReduce programming system [18]. Number is the number of map locations in a cloud group.(2)
Subpackage training is taught in parallel according to the step logic of the map function, such as the logic of OS-ELM training machine learning algorithm, which is equivalent to machine training which is different.(3)
The benefits of working in the diagram, which is an estimate of the importance of different training systems, were passed from the Shuffle phase of the MapReduce programming frame to the Reduced phase, and the weight of the estimated values generated by the MapReduce function was determined accordingly. According to the above weight calculation method, the predicted value weight of each Map operation output is determined, and then the final predicted value is calculated.(4)
Learn the routine procedure for estimating average and long-term loads along the specified axis, slide as required, and return to step 1. Estimate the next day behind the load data on a regular basis.Figure 1
Distributed MR-OSELM-WA predictive decision model based on MapReduce.


## 4. Result Analysis

### 4.1. Experimental Preparation Stage

The newly built Hadoop platform has 32 nodes, each with Intel (R) Core (TM) I5-2400 4-coreCPU@2.60 GHz, 4 GBRAM, and 100 Mbit/s network bandwidth. Hadoop version is 0.20.2.


#### 4.1.1. Example Analysis Data Set

The actual regional load data for 1997-1998 were selected from a 2001 Medium-Term Load Prediction Test developed by the European Smart Technology Network (EUNITE). The data sample provided by EUNITE is the power load collected every 0.5 hours from 1997 to 1998; the mean daily temperature from 1995 to 1998, and the holiday dates from 1997 to 1999 [19]. The objective of the load forecasting is to predict the maximum power load for 31 days in January 1999 from the above data samples.


#### 4.1.2. Evaluation Indicators

The accuracy rate of load prediction adopts MAPE as the test index:(15)MAPE=100∑i=1nLi−∣L^i/Lin,n=31,where Li and L^i are the true and predicted the power load value of day i, respectively; n is the number of days in the month forecast. In the power load forecasting, the smaller MAPE value is, the more accurate the load forecasting is.The relative acceleration and expansion ratios were used to evaluate the performance of the MR-OSELM-WA algorithm. The evaluation is used to compare the execution time of the algorithm—again the large group, again the large data—with the original data.


#### 4.1.3. Load Forecasting Training Set Design

The input sample includes three feature vectors, and the training set is composed of [dateD, temperature T and historical load L]. Seven binary numbers are used to represent date information, respectively. The predicted daily temperature was expressed by decimal number and normalized. L=Li−7,Li−6,Li−5,Li−4,Li−3,Li−2,Li−1 indicates the maximum load value of 7 days before the forecast date.The objective of the experiment is to predict the maximum power load on January 1999. Through a large number of experiments, temperature is correlated with power load. In order to improve the accuracy of prediction, the sample data range is set as part of the winter data from November to April. The output of the training set isyi=Li, that is, the maximum power load value of the predicted day.


### 4.2. Example Analysis

#### 4.2.1. Prediction Accuracy of MR-OSELM-WA

In this experiment, the MR-OSELM-WA algorithm is compared with the support vector regression (SVR) algorithm and functional networks algorithm of generalized neural networks. SVR prediction algorithm and functional neural network algorithm show excellent prediction ability in EUNITE competition. Compared with these two algorithms, the performance of the proposed MR-OSELM-WA algorithm for power load prediction is tested.Formula (15) for calculating the value of MAPE according to the target function was obtained, and the approval of our standard algorithm was obtained by 10-fold cross-validation. The inconsistencies of each algorithm have been taken for granted, and MR-OSELM-WA, network algorithm performance, and SVR algorithm have been reported as training packages between 1997 and 1998. The historical data of 1997 and 1998 were used as the training set; MR-OSELM-WA uses a one-by-one online sequential learning model to predict the power load values in January 1999. In order to ensure that the results were positive, 50 tests were completed and the mean was considered as the final test. MAPEs of our energy load estimation algorithms are shown in Table 1 [20]. As shown in Table 1, the MR-OSELM-WA proposed in this article received the lowest MAPE value for the load estimate, i.e., the MR-OSELM-WA algorithm has the correct high in estimated strength. Load estimates perform better than SVR and functional neural networks. In addition, SVR prediction algorithm and functional neural network prediction algorithm is a set of training. The larger the training package, the greater the memory required to complete the algorithm in the training package type. If the memory space exceeds the limit, the efficiency of the algorithm will be greatly reduced. However, the above situation is not easy to occur because MR-OSELM-WA’s one-on-one online sequential learning mode training package (or half mode) is smaller than the ELM training mode.Table 1
MAPE predicted on the training set based on MR-OSELM-WA, functional network, and SVR.
Prediction algorithmMAPEMR-OSELM-WA1.949 8Functional neural networks3.430SVR2.149 8Figures2 and 3 show the comparison between the actual power load value and the estimated power load value of the MR-OSELM-WA algorithm, SVR algorithm, and network operation algorithm in January 1999.Figure 2
Comparison of power load value in January 1999 with the predicted value of MR-OSELM-WA algorithm and SVR algorithm.Figure 3
Comparison of power load value in January 1999 with the predicted value of MR-OSELM-WA algorithm and functional networks algorithm.


#### 4.2.2. MR-OSELM-WA Parallel Performance

To reflect the performance of the MR-OSELM-WA algorithm, the sample load data provided by EUNITE is divided into four groups: 1000 times, 2000 times, 4000 times, and 8000 times, different time records. They work on cloud platform with 4, 8, 16, and 32 nodes in a group to calculate acceleration ratios and scale ratios. The acceleration ratio of a perfectly parallel system algorithm is close to 1, but in practical use, as the number of cluster nodes increases, network forwarding nodes are used, and the linear acceleration ratio is very large, as shown in Figure4, and hard to reach. Figure 4 shows that the acceleration ratio of MR-OSELM-WA increases linearly with the growth of data scale, especially for large files. In practice, the more the data, the better the comparison of MR-OSELM-WA, that is, MR-OSELM-WA can meet the requirements of the calculation of large data of electronic equipment.Figure 4
MR-OSELM-WA acceleration ratio.In a perfectly parallel system, the clock speed is constant at 1, but it is not possible to complete the application. As the configuration data increase, the speed of the interconnect system gradually decreases. The test results are shown in Figure5. The measurement speed of the MR-OSELM-WA algorithm is better because the measurement height of the MR-OSELM-WA algorithm decreases when the data setup is large.Figure 5
MR-OSELM-WA expansion rate.


## 4.1. Experimental Preparation Stage

The newly built Hadoop platform has 32 nodes, each with Intel (R) Core (TM) I5-2400 4-coreCPU@2.60 GHz, 4 GBRAM, and 100 Mbit/s network bandwidth. Hadoop version is 0.20.2.


### 4.1.1. Example Analysis Data Set

The actual regional load data for 1997-1998 were selected from a 2001 Medium-Term Load Prediction Test developed by the European Smart Technology Network (EUNITE). The data sample provided by EUNITE is the power load collected every 0.5 hours from 1997 to 1998; the mean daily temperature from 1995 to 1998, and the holiday dates from 1997 to 1999 [19]. The objective of the load forecasting is to predict the maximum power load for 31 days in January 1999 from the above data samples.


### 4.1.2. Evaluation Indicators

The accuracy rate of load prediction adopts MAPE as the test index:(15)MAPE=100∑i=1nLi−∣L^i/Lin,n=31,where Li and L^i are the true and predicted the power load value of day i, respectively; n is the number of days in the month forecast. In the power load forecasting, the smaller MAPE value is, the more accurate the load forecasting is.The relative acceleration and expansion ratios were used to evaluate the performance of the MR-OSELM-WA algorithm. The evaluation is used to compare the execution time of the algorithm—again the large group, again the large data—with the original data.


### 4.1.3. Load Forecasting Training Set Design

The input sample includes three feature vectors, and the training set is composed of [dateD, temperature T and historical load L]. Seven binary numbers are used to represent date information, respectively. The predicted daily temperature was expressed by decimal number and normalized. L=Li−7,Li−6,Li−5,Li−4,Li−3,Li−2,Li−1 indicates the maximum load value of 7 days before the forecast date.The objective of the experiment is to predict the maximum power load on January 1999. Through a large number of experiments, temperature is correlated with power load. In order to improve the accuracy of prediction, the sample data range is set as part of the winter data from November to April. The output of the training set isyi=Li, that is, the maximum power load value of the predicted day.


## 4.1.1. Example Analysis Data Set

The actual regional load data for 1997-1998 were selected from a 2001 Medium-Term Load Prediction Test developed by the European Smart Technology Network (EUNITE). The data sample provided by EUNITE is the power load collected every 0.5 hours from 1997 to 1998; the mean daily temperature from 1995 to 1998, and the holiday dates from 1997 to 1999 [19]. The objective of the load forecasting is to predict the maximum power load for 31 days in January 1999 from the above data samples.


## 4.1.2. Evaluation Indicators

The accuracy rate of load prediction adopts MAPE as the test index:(15)MAPE=100∑i=1nLi−∣L^i/Lin,n=31,where Li and L^i are the true and predicted the power load value of day i, respectively; n is the number of days in the month forecast. In the power load forecasting, the smaller MAPE value is, the more accurate the load forecasting is.The relative acceleration and expansion ratios were used to evaluate the performance of the MR-OSELM-WA algorithm. The evaluation is used to compare the execution time of the algorithm—again the large group, again the large data—with the original data.


## 4.1.3. Load Forecasting Training Set Design

The input sample includes three feature vectors, and the training set is composed of [dateD, temperature T and historical load L]. Seven binary numbers are used to represent date information, respectively. The predicted daily temperature was expressed by decimal number and normalized. L=Li−7,Li−6,Li−5,Li−4,Li−3,Li−2,Li−1 indicates the maximum load value of 7 days before the forecast date.The objective of the experiment is to predict the maximum power load on January 1999. Through a large number of experiments, temperature is correlated with power load. In order to improve the accuracy of prediction, the sample data range is set as part of the winter data from November to April. The output of the training set isyi=Li, that is, the maximum power load value of the predicted day.


## 4.2. Example Analysis

### 4.2.1. Prediction Accuracy of MR-OSELM-WA

In this experiment, the MR-OSELM-WA algorithm is compared with the support vector regression (SVR) algorithm and functional networks algorithm of generalized neural networks. SVR prediction algorithm and functional neural network algorithm show excellent prediction ability in EUNITE competition. Compared with these two algorithms, the performance of the proposed MR-OSELM-WA algorithm for power load prediction is tested.Formula (15) for calculating the value of MAPE according to the target function was obtained, and the approval of our standard algorithm was obtained by 10-fold cross-validation. The inconsistencies of each algorithm have been taken for granted, and MR-OSELM-WA, network algorithm performance, and SVR algorithm have been reported as training packages between 1997 and 1998. The historical data of 1997 and 1998 were used as the training set; MR-OSELM-WA uses a one-by-one online sequential learning model to predict the power load values in January 1999. In order to ensure that the results were positive, 50 tests were completed and the mean was considered as the final test. MAPEs of our energy load estimation algorithms are shown in Table 1 [20]. As shown in Table 1, the MR-OSELM-WA proposed in this article received the lowest MAPE value for the load estimate, i.e., the MR-OSELM-WA algorithm has the correct high in estimated strength. Load estimates perform better than SVR and functional neural networks. In addition, SVR prediction algorithm and functional neural network prediction algorithm is a set of training. The larger the training package, the greater the memory required to complete the algorithm in the training package type. If the memory space exceeds the limit, the efficiency of the algorithm will be greatly reduced. However, the above situation is not easy to occur because MR-OSELM-WA’s one-on-one online sequential learning mode training package (or half mode) is smaller than the ELM training mode.Table 1
MAPE predicted on the training set based on MR-OSELM-WA, functional network, and SVR.
Prediction algorithmMAPEMR-OSELM-WA1.949 8Functional neural networks3.430SVR2.149 8Figures2 and 3 show the comparison between the actual power load value and the estimated power load value of the MR-OSELM-WA algorithm, SVR algorithm, and network operation algorithm in January 1999.Figure 2
Comparison of power load value in January 1999 with the predicted value of MR-OSELM-WA algorithm and SVR algorithm.Figure 3
Comparison of power load value in January 1999 with the predicted value of MR-OSELM-WA algorithm and functional networks algorithm.


### 4.2.2. MR-OSELM-WA Parallel Performance

To reflect the performance of the MR-OSELM-WA algorithm, the sample load data provided by EUNITE is divided into four groups: 1000 times, 2000 times, 4000 times, and 8000 times, different time records. They work on cloud platform with 4, 8, 16, and 32 nodes in a group to calculate acceleration ratios and scale ratios. The acceleration ratio of a perfectly parallel system algorithm is close to 1, but in practical use, as the number of cluster nodes increases, network forwarding nodes are used, and the linear acceleration ratio is very large, as shown in Figure4, and hard to reach. Figure 4 shows that the acceleration ratio of MR-OSELM-WA increases linearly with the growth of data scale, especially for large files. In practice, the more the data, the better the comparison of MR-OSELM-WA, that is, MR-OSELM-WA can meet the requirements of the calculation of large data of electronic equipment.Figure 4
MR-OSELM-WA acceleration ratio.In a perfectly parallel system, the clock speed is constant at 1, but it is not possible to complete the application. As the configuration data increase, the speed of the interconnect system gradually decreases. The test results are shown in Figure5. The measurement speed of the MR-OSELM-WA algorithm is better because the measurement height of the MR-OSELM-WA algorithm decreases when the data setup is large.Figure 5
MR-OSELM-WA expansion rate.


## 4.2.1. Prediction Accuracy of MR-OSELM-WA

In this experiment, the MR-OSELM-WA algorithm is compared with the support vector regression (SVR) algorithm and functional networks algorithm of generalized neural networks. SVR prediction algorithm and functional neural network algorithm show excellent prediction ability in EUNITE competition. Compared with these two algorithms, the performance of the proposed MR-OSELM-WA algorithm for power load prediction is tested.Formula (15) for calculating the value of MAPE according to the target function was obtained, and the approval of our standard algorithm was obtained by 10-fold cross-validation. The inconsistencies of each algorithm have been taken for granted, and MR-OSELM-WA, network algorithm performance, and SVR algorithm have been reported as training packages between 1997 and 1998. The historical data of 1997 and 1998 were used as the training set; MR-OSELM-WA uses a one-by-one online sequential learning model to predict the power load values in January 1999. In order to ensure that the results were positive, 50 tests were completed and the mean was considered as the final test. MAPEs of our energy load estimation algorithms are shown in Table 1 [20]. As shown in Table 1, the MR-OSELM-WA proposed in this article received the lowest MAPE value for the load estimate, i.e., the MR-OSELM-WA algorithm has the correct high in estimated strength. Load estimates perform better than SVR and functional neural networks. In addition, SVR prediction algorithm and functional neural network prediction algorithm is a set of training. The larger the training package, the greater the memory required to complete the algorithm in the training package type. If the memory space exceeds the limit, the efficiency of the algorithm will be greatly reduced. However, the above situation is not easy to occur because MR-OSELM-WA’s one-on-one online sequential learning mode training package (or half mode) is smaller than the ELM training mode.Table 1
MAPE predicted on the training set based on MR-OSELM-WA, functional network, and SVR.
Prediction algorithmMAPEMR-OSELM-WA1.949 8Functional neural networks3.430SVR2.149 8Figures2 and 3 show the comparison between the actual power load value and the estimated power load value of the MR-OSELM-WA algorithm, SVR algorithm, and network operation algorithm in January 1999.Figure 2
Comparison of power load value in January 1999 with the predicted value of MR-OSELM-WA algorithm and SVR algorithm.Figure 3
Comparison of power load value in January 1999 with the predicted value of MR-OSELM-WA algorithm and functional networks algorithm.


## 4.2.2. MR-OSELM-WA Parallel Performance

To reflect the performance of the MR-OSELM-WA algorithm, the sample load data provided by EUNITE is divided into four groups: 1000 times, 2000 times, 4000 times, and 8000 times, different time records. They work on cloud platform with 4, 8, 16, and 32 nodes in a group to calculate acceleration ratios and scale ratios. The acceleration ratio of a perfectly parallel system algorithm is close to 1, but in practical use, as the number of cluster nodes increases, network forwarding nodes are used, and the linear acceleration ratio is very large, as shown in Figure4, and hard to reach. Figure 4 shows that the acceleration ratio of MR-OSELM-WA increases linearly with the growth of data scale, especially for large files. In practice, the more the data, the better the comparison of MR-OSELM-WA, that is, MR-OSELM-WA can meet the requirements of the calculation of large data of electronic equipment.Figure 4
MR-OSELM-WA acceleration ratio.In a perfectly parallel system, the clock speed is constant at 1, but it is not possible to complete the application. As the configuration data increase, the speed of the interconnect system gradually decreases. The test results are shown in Figure5. The measurement speed of the MR-OSELM-WA algorithm is better because the measurement height of the MR-OSELM-WA algorithm decreases when the data setup is large.Figure 5
MR-OSELM-WA expansion rate.


## 5. Conclusion

The deepening of the degree of power intelligence, power system data quantization, high dimensional trend is unstoppable. The load forecasting algorithm represented by support vector regression widely used in power load forecasting has high computational complexity. Under the massive high-dimensional data load prediction, a single machine cannot bear such a huge consumption of computing resources. In recent years, the popular large data processing technology is an effective method to solve this problem, and the algorithm parallelization caused by it has become a research direction of load forecasting in recent years. In this article, an extreme learning machine power load prediction algorithm based on cloud computing is proposed, which can not only shorten the training time and reduce the consumption of computing resources but also significantly improve the accuracy of power load.



---

*Source: 9229415-2022-08-28.xml*