<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<?covid-19-tdm?>
<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">813617</article-id>
<article-id pub-id-type="doi">10.3389/fenrg.2021.813617</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>Short-Term Power Load Forecasting Under COVID-19 Based on Graph Representation Learning With Heterogeneous Features</article-title>
<alt-title alt-title-type="left-running-head">Yu et&#x20;al.</alt-title>
<alt-title alt-title-type="right-running-head">Load Forecasting Under COVID-19</alt-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname>Yu</surname>
<given-names>Zhuowei</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name>
<surname>Yang</surname>
<given-names>Jiajun</given-names>
</name>
<xref ref-type="aff" rid="aff2">
<sup>2</sup>
</xref>
<xref ref-type="aff" rid="aff3">
<sup>3</sup>
</xref>
<xref ref-type="corresp" rid="c001">&#x2a;</xref>
<uri xlink:href="https://loop.frontiersin.org/people/1554535/overview"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Wu</surname>
<given-names>Yufeng</given-names>
</name>
<xref ref-type="aff" rid="aff2">
<sup>2</sup>
</xref>
<xref ref-type="aff" rid="aff3">
<sup>3</sup>
</xref>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Huang</surname>
<given-names>Yi</given-names>
</name>
<xref ref-type="aff" rid="aff2">
<sup>2</sup>
</xref>
<xref ref-type="aff" rid="aff3">
<sup>3</sup>
</xref>
</contrib>
</contrib-group>
<aff id="aff1">
<sup>1</sup>
<institution>The Affiliated High School of South China Normal University</institution>, <addr-line>Guangzhou</addr-line>, <country>China</country>
</aff>
<aff id="aff2">
<sup>2</sup>
<institution>School of Electric Power Engineering South China University of Technology</institution>, <addr-line>Guangzhou</addr-line>, <country>China</country>
</aff>
<aff id="aff3">
<sup>3</sup>
<institution>Guangdong Provincial Key Laboratory of Intelligent Measurement and Advanced Metering of Power Grid</institution>, <addr-line>Guangzhou</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/1256586/overview">Bin Zhou</ext-link>, Hunan University, China</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/1222560/overview">Bo Yang</ext-link>, Kunming University of Science and Technology, China</p>
<p>
<ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/1222566/overview">Xiaoshun Zhang</ext-link>, Shantou University, China</p>
</fn>
<corresp id="c001">&#x2a;Correspondence: Jiajun Yang, <email>1454582351@qq.com</email>
</corresp>
<fn fn-type="other">
<p>This article was submitted to Process and Energy Systems Engineering, a section of the journal Frontiers in Energy Research</p>
</fn>
</author-notes>
<pub-date pub-type="epub">
<day>24</day>
<month>12</month>
<year>2021</year>
</pub-date>
<pub-date pub-type="collection">
<year>2021</year>
</pub-date>
<volume>9</volume>
<elocation-id>813617</elocation-id>
<history>
<date date-type="received">
<day>12</day>
<month>11</month>
<year>2021</year>
</date>
<date date-type="accepted">
<day>22</day>
<month>11</month>
<year>2021</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#xa9; 2021 Yu, Yang, Wu and Huang.</copyright-statement>
<copyright-year>2021</copyright-year>
<copyright-holder>Yu, Yang, Wu and Huang</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>Since 2020, the COVID-19 has spread globally at an extremely rapid rate. The epidemic, vaccination, and quarantine policies have profoundly changed economic development and human activities worldwide. As many countries start to resume economic activities aiming at a &#x201c;living with COVID&#x201d; new normal, a short-term load forecasting technique incorporating the epidemic&#x2019;s effects is of great significance to both power system operation and a smooth transition. In this context, this paper proposes a novel short-term load forecasting method under COVID-19 based on graph representation learning with heterogeneous features. Unlike existing methods that fit power load data to time series, this study encodes heterogeneous features relevant to electricity consumption and epidemic status into a load graph so that not only the features at each time moment but also the inherent correlations between the features can be exploited; Then, a residual graph convolutional network (ResGCN) is constructed to fit the non-linear mappings from load graph to future loads. Besides, a graph concatenation method for parallel training is introduced to improve the learning efficiency. Using practical data in Houston, the annual, monthly, and daily effects of the crisis on power load are analyzed, which uncovers the strong correlation between the pandemic and the changes in regional electricity utilization. Moreover, the forecasting performance of the load graph-based ResGCN is validated by comparing with other representative methods. Its performance on MAPE and RMSE increased by 1.3264 and 15.03%, respectively. Codes related to all the simulations are available on <ext-link ext-link-type="uri" xlink:href="https://github.com/YoungY6/ResGCN-for-Short-term-power-load-forecasting-under-COVID-19">https://github.com/YoungY6/ResGCN-for-Short-term-power-load-forecasting-under-COVID-19</ext-link>.</p>
</abstract>
<kwd-group>
<kwd>COVID-19</kwd>
<kwd>graph data modeling</kwd>
<kwd>graph representation learning</kwd>
<kwd>residual graph convolutional network</kwd>
<kwd>short-term load forecasting</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1">
<title>1 Introduction</title>
<sec id="s1-1">
<title>1.1 Background</title>
<p>The construction and operation of the electric power industry are of great importance to society. On the one hand, the power supply is indispensable to various industries. As reported by the Bureau of Energy Statistics, China&#x2019;s total electricity consumption reached 71,508.20 billion kWh in 2020, increasing by 8.49% compared with 2019. The growth trend will continue with the development of China&#x2019;s economy. On the other hand, electricity utilization is emission-free, making replacing fossil energy sources with electric energy an essential means to achieve the carbon neutrality pledge (<xref ref-type="bibr" rid="B15">Liu, 2015</xref>).</p>
<p>Short-term load forecasting for the future 24&#xa0;h is one of the most critical techniques to ensure system stability, reliability, and economic efficiency. It affects power system operation in many aspects, including generation dispatch, power flow optimization (<xref ref-type="bibr" rid="B4">Chen et&#x20;al.,</xref>; <xref ref-type="bibr" rid="B16">Meng et&#x20;al., 2016</xref>), and energy bidding in the electricity market. Significant variabilities and uncertainties have been introduced by the diverse end-users and the ever-increasing shares of renewables (<xref ref-type="bibr" rid="B11">Li and Lu, 2020</xref>). As a result, accurate short-term load forecasting is a hard task in modern power systems.</p>
<p>Unfortunately, the outbreak of COVID-19 since early 2020 has posed extraordinary challenges on short-term load forecasting. As shown in <xref ref-type="fig" rid="F1">Figure 1A</xref>, the virus has spread globally and in <xref ref-type="fig" rid="F1">Figures 1B,C</xref> the cumulative number of confirmed diagnoses is increasing and in a rapid growth trend, with over two billion cumulative confirmed cases until August 25, 2021. It has been reported by (<xref ref-type="bibr" rid="B21">Ruan et&#x20;al., 2020</xref>; <xref ref-type="bibr" rid="B20">Ruan et&#x20;al., 2021</xref>) that the crisis has profoundly affected electricity unitization attributed to changes in people&#x2019;s living habits and industrial production activities. Such effects vary spatially due to the differences in infection speed, vaccination coverage, and quarantine policies, resulting in additional variabilities and uncertainties in electricity consumption as (<xref ref-type="fig" rid="F2">Figure 2</xref>).</p>
<fig id="F1" position="float">
<label>FIGURE 1</label>
<caption>
<p>COVID-19 situation worldwide and in China (updated August 25, 2021). <bold>(A)</bold> Distribution of confirmed cases of COVID-19; <bold>(B)</bold> Global cases of COVID-19; <bold>(C)</bold> Daily new confirmed cases at home and abroad.</p>
</caption>
<graphic xlink:href="fenrg-09-813617-g001.tif"/>
</fig>
<fig id="F2" position="float">
<label>FIGURE 2</label>
<caption>
<p>Schematic diagram of the impact of COVID-19 pandemic on power grid load.</p>
</caption>
<graphic xlink:href="fenrg-09-813617-g002.tif"/>
</fig>
<p>However, the infection has seen fast growth in the past 3&#xa0;months. According to the World Health Organization (<xref ref-type="bibr" rid="B17">WHO, 2020</xref>) and the most recent research (<xref ref-type="bibr" rid="B8">Huang et&#x20;al., 2020</xref>), the fight against COVID-19 is far from over, and its effects will last. Instead of sticking to strict quarantine policies or aiming at a sustained zero infection level, many countries start to resume economic activities and incorporate disease prevention and control into the day-to-day operation of society. In this context, a short-term load forecasting technique incorporating the effects of COVID-19 is of great significance to both power system operation and economic development, facilitating a smooth transition to a &#x201c;living with COVID&#x201d; new normal.</p>
</sec>
<sec id="s1-2">
<title>1.2 Literature Review</title>
<p>The effects of the pandemic on domestic and international regional electricity consumption are highly uncertain, which vary with infection speed and quarantine policies. Some published reports have preliminarily drawn qualitative conclusions: &#x201c;electricity consumption decreases during the pandemic, but the grid remains reliable&#x201d; (<xref ref-type="bibr" rid="B3">Bui and Wolfers, 2020</xref>; <xref ref-type="bibr" rid="B5">Cicala, 2020</xref>). However, the epidemic&#x2019;s effects are multifaced and cannot be summarized simply by load reduction (<xref ref-type="bibr" rid="B1">Agdas and Barooah, 2020</xref>; <xref ref-type="bibr" rid="B24">Werth et&#x20;al., 2020</xref>). Although (<xref ref-type="bibr" rid="B21">Ruan et&#x20;al., 2020</xref>) has shown significant deviations between the simulated forecasts and the actual loads if the crisis&#x2019; effects are omitted, explicitly describing the complex effects and incorporating them into load forecasting are still open questions.</p>
<p>The existing short-term load forecasting can be classified into traditional statistical methods and machine learning-based forecasting algorithms. The traditional statistical methods are simple and computationally efficient, such as multiple linear regression algorithm (<xref ref-type="bibr" rid="B2">Amral et&#x20;al., 2007</xref>), sliding average forecasting algorithm (MAF), differential integrated autoregressive integrated moving average model, (ARIMA) (<xref ref-type="bibr" rid="B6">Gupta and Kumar, 2020</xref>), and exponential smoothing (ES) (<xref ref-type="bibr" rid="B19">Rendon-Sanchez and De Menezes, 2019</xref>). Although they have achieved desired performance in simple tasks under normal and stable conditions, their robustness declines dramatically when they are applied to power load forecasting, which involves non-linear and highly uncertain operation constraints (<xref ref-type="bibr" rid="B10">Kharin, 2013</xref>); By contrast, the machine learning-based forecasting algorithms are tasked to learning the non-linear mapping from exogenous information to the power load using historical data. For example, (<xref ref-type="bibr" rid="B14">Li et&#x20;al., 2020</xref>) uses a fuzzy clustering approach to classify regional users and then builds respective random forest-based forecasting models for each class; Besides, (<xref ref-type="bibr" rid="B13">Li et&#x20;al., 2021</xref>) and (<xref ref-type="bibr" rid="B23">Wang et&#x20;al., 2020</xref>) make short-term load forecasts for heating load and electrical load, respectively, based on long short-term memory network (LSTM). However, the above three methods adopt equal weights for all the input features, which are correlated and exert different influences on power load. As a result, the equal-weight treatment cannot enable the model to learn efficiently. Therefore, (<xref ref-type="bibr" rid="B27">Zhu et&#x20;al., 2021</xref>) introduces the attention mechanism into the LSTM to enable deep learning of correlated input features, which improves prediction accuracy. Although LSTM outperforms other methods in mining the intrinsic information of the time-series data, it cannot deal with multi-source information, making it less preferable for power load forecasting. Current research has shown that the fusion of multiple data can play an important role in artificial intelligence networks, (<xref ref-type="bibr" rid="B26">Zhang et&#x20;al., 2021</xref>) has proved that with the coordinated control of electrolysis current, temperature, and charging/discharging of BES for H2 production, the electrolysis current fluctuation cost is largely reduced and the electrolysis efficiency can be improved. Therefore, considering multiple factors in load forecasting can improve accuracy.</p>
<p>As a graph representation learning method, graph convolution network (GCN) can dig deeper into the intrinsic relationship of heterogeneous data by defining Fourier transform and convolution on the graph. As pioneering attempts, (<xref ref-type="bibr" rid="B7">Han et&#x20;al., 2021</xref>) has built a GCN to forecast nitride emissions from coal-fired power plants, while (<xref ref-type="bibr" rid="B22">Wang and He, 2021</xref>) has built a graph attention network (GAT) for fault location in distribution networks. Their results demonstrate that GCN is a promising tool with powerful learning ability and generalization capability.</p>
</sec>
<sec id="s1-3">
<title>1.3 Contributions</title>
<p>Based on the research gap in short-term load forecasting and the recent progress in GCN, this paper encodes heterogeneous features related to electricity consumption and status of COVID-19 into a load graph and build a graph representation learning model to fit the complex mapping between the present load states and the load forecasts for the future.</p>
<p>The contributions in this study can be summarized as follows:<list list-type="simple">
<list-item>
<p>(1) Load graph encoding heterogeneous features. Each node in the graph corresponds to one time moment, while the edge weights are defined to represent temporal correlations between the nodes. The node features are defined with&#x20;electricity consumption and epidemic status information so that the heterogeneous features can be fused in a&#x20;graph.</p>
</list-item>
<list-item>
<p>(2) ResGCN with parallel training to learn graph representations and to forecast future loads under COVID-19. By learning residual from the input, ResGCN prevents over-smoothing and fits the mapping from heterogeneous features to the future loads. Besides, a graph concatenation is proposed for parallel training so that the learning efficiency can be improved significantly. Based on this method, precise short-term power load forecasting under COVID-19 is realized, laying the foundation for the stable operation of the power system.</p>
</list-item>
</list>
</p>
</sec>
</sec>
<sec id="s2">
<title>2 Short-Term Load Forecasting Based on ResGCN With Heterogeneous Features</title>
<sec id="s2-1">
<title>2.1 Load Graph Encoding Heterogeneous Features</title>
<sec id="s2-1-1">
<title>2.1.1 Feature Selection to Describe Epidemic Status</title>
<p>The COVID-19 crisis has had a significant impact on people&#x2019;s living habits and industrial production activities and thus has led to changes in electricity consumption. To incorporate such effects into power load forecasting, it is important to identify the most representative features to describe the epidemic development status.</p>
<p>Herein, the COVID-EMDA &#x2b; dataset is adopted, denoted as S, which has collected multi-source features from various sources in the United&#x20;States since the epidemic, including weather temperature, human behavior, cell phone distribution, and so on. These features describe human activities from different aspects, while those showing similar extents of fluctuations as the epidemic develops are assumed to be more representative. Therefore, after data cleaning and normalization, the Pearson correlation coefficients between all the features in the dataset are computed. Then, the representativeness of each feature is assessed by the absolute value of its correlation coefficients with the others, as<disp-formula id="e1">
<mml:math id="m1">
<mml:mrow>
<mml:msub>
<mml:mi>h</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mo>&#x7c;</mml:mo>
<mml:mrow>
<mml:mi>&#x3c1;</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo>&#x7c;</mml:mo>
</mml:mrow>
<mml:mo>,</mml:mo>
<mml:mo>&#xa0;</mml:mo>
<mml:mo>&#xa0;</mml:mo>
<mml:mo>&#xa0;</mml:mo>
<mml:mo>&#xa0;</mml:mo>
<mml:mo>&#xa0;</mml:mo>
<mml:mo>&#xa0;</mml:mo>
<mml:mo>&#xa0;</mml:mo>
<mml:mo>&#xa0;</mml:mo>
<mml:mo>&#xa0;</mml:mo>
<mml:mo>&#xa0;</mml:mo>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>S</mml:mi>
</mml:mrow>
</mml:math>
<label>(1)</label>
</disp-formula>where <italic>F</italic>
<sub>
<italic>i</italic>
</sub> and <italic>F</italic>
<sub>
<italic>j</italic>
</sub> denote features <italic>i</italic> and <italic>j</italic>, respectively.</p>
<p>Finally, the features with higher values of <inline-formula id="inf1">
<mml:math id="m2">
<mml:mi>h</mml:mi>
</mml:math>
</inline-formula> are selected as inputs. In our implementation, the final selected futures are daily confirmed cases, mobility in grocery and pharmacy, and the counts of mobile devices locating at home. Apart from the three features describing the epidemic status, the temperature is also taken as input, which is acknowledged to exert significant effects on electricity utilization.</p>
</sec>
<sec id="s2-1-2">
<title>2.1.2 Graph Representation of Electricity Consumption and Epidemic Status</title>
<p>The historical load reflects people&#x2019;s electricity consumption habits which can occur similarly in the future so that it is an informative reference in load forecasting. However, in the face of COVID-19, load levels are associated not only with the historical states but also with the epidemic status, as discussed in the last section. The load profiles defined in Euclidean space cannot describe the correlations between the features. By contrast, graph data can be a promising alternative, which is defined in non-Euclidean space consisting of nodes and edges and can encode structural and correlation information(<xref ref-type="fig" rid="F2">Figure&#x20;2</xref>).</p>
<p>Thus, this paper proposes to encode the multi-source features within time window <italic>T</italic>
<sub>
<italic>k</italic>
</sub> as a load graph, so that not only the features are contained at each time moment, but also the inherent correlations between the features can be considered. As shown in <xref ref-type="fig" rid="F3">Figure&#x20;3</xref>, the load graph is fully connected and undirected, denoted as <inline-formula id="inf2">
<mml:math id="m3">
<mml:mrow>
<mml:mi>G</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi mathvariant="bold-italic">A</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>, where <inline-formula id="inf3">
<mml:math id="m4">
<mml:mi mathvariant="bold-italic">A</mml:mi>
</mml:math>
</inline-formula> is the adjacent matrix while <inline-formula id="inf4">
<mml:math id="m5">
<mml:mrow>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mi mathvariant="normal">&#x211d;</mml:mi>
<mml:mrow>
<mml:mi>N</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula> is node feature matrix. The features of nodes and edges are defined as follows.<list list-type="simple">
<list-item>
<p>(1) Node feature encoding heterogeneous information.</p>
</list-item>
</list>
</p>
<fig id="F3" position="float">
<label>FIGURE 3</label>
<caption>
<p>Graph representation of power load and epidemic status.</p>
</caption>
<graphic xlink:href="fenrg-09-813617-g003.tif"/>
</fig>
<p>Each node corresponds to a time moment within <italic>T</italic>
<sub>
<italic>k</italic>
</sub> while the node feature vector encodes heterogeneous information essential to load forecasting. The feature vector of node <italic>i</italic>, whose transpose is the <italic>i</italic>th row of input feature matrix <inline-formula id="inf5">
<mml:math id="m6">
<mml:mrow>
<mml:mi mathvariant="normal">X</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mi mathvariant="normal">&#x211d;</mml:mi>
<mml:mrow>
<mml:mi>N</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula>, can be formulated as<disp-formula id="e2">
<mml:math id="m7">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mover accent="true">
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mo>&#x2192;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mi mathvariant="bold-italic">i</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mover accent="true">
<mml:mi mathvariant="bold-italic">P</mml:mi>
<mml:mo>&#x2192;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mi mathvariant="bold-italic">i</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mover accent="true">
<mml:mi mathvariant="bold-italic">C</mml:mi>
<mml:mo>&#x2192;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mi mathvariant="bold-italic">i</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mover accent="true">
<mml:mi mathvariant="bold-italic">M</mml:mi>
<mml:mo>&#x2192;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mi mathvariant="bold-italic">i</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mover accent="true">
<mml:mi mathvariant="bold-italic">S</mml:mi>
<mml:mo>&#x2192;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mi mathvariant="bold-italic">i</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mover accent="true">
<mml:mi mathvariant="bold-italic">W</mml:mi>
<mml:mo>&#x2192;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mi mathvariant="bold-italic">i</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo>]</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mi>T</mml:mi>
</mml:msup>
</mml:mrow>
</mml:math>
<label>(2)</label>
</disp-formula>where <inline-formula id="inf6">
<mml:math id="m8">
<mml:mrow>
<mml:mo>&#xa0;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mover accent="true">
<mml:mi mathvariant="bold-italic">P</mml:mi>
<mml:mo>&#x2192;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mi mathvariant="bold-italic">i</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">P</mml:mi>
<mml:mi mathvariant="bold-italic">i</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo>]</mml:mo>
</mml:mrow>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
<mml:mo>]</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula id="inf7">
<mml:math id="m9">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mover accent="true">
<mml:mi mathvariant="bold-italic">C</mml:mi>
<mml:mo>&#x2192;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mi mathvariant="bold-italic">i</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>C</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:mrow>
<mml:mo>]</mml:mo>
</mml:mrow>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
<mml:mo>]</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula id="inf8">
<mml:math id="m10">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mover accent="true">
<mml:mi mathvariant="bold-italic">M</mml:mi>
<mml:mo>&#x2192;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mi mathvariant="bold-italic">i</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>M</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:mrow>
<mml:mo>]</mml:mo>
</mml:mrow>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
<mml:mo>]</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula id="inf9">
<mml:math id="m11">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mover accent="true">
<mml:mi mathvariant="bold-italic">S</mml:mi>
<mml:mo>&#x2192;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mi mathvariant="bold-italic">i</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>S</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:mrow>
<mml:mo>]</mml:mo>
</mml:mrow>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
<mml:mo>]</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula id="inf10">
<mml:math id="m12">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mover accent="true">
<mml:mi mathvariant="bold-italic">W</mml:mi>
<mml:mo>&#x2192;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mi mathvariant="bold-italic">i</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mrow>
<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:mrow>
<mml:mo>]</mml:mo>
</mml:mrow>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
<mml:mo>]</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> denote vectors of power load, daily confirmed cases, mobility of grocery and pharmacy, and the counts of stay-at-home mobile devices, and temperature, respectively.<list list-type="simple">
<list-item>
<p>(2) Edge weight describing the temporal correlation.</p>
</list-item>
</list>
</p>
<p>The edge weights are defined to represent the temporal correlations between the node, based on the assumption that features of closer time moments exhibit more inherent correlations. Herein, the Gaussian kernel function is selected to define the edge weight due to its monotonicity and localizability, as<disp-formula id="e3">
<mml:math id="m13">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">&#x3c9;</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#xa0;</mml:mo>
<mml:mo>&#x3d;</mml:mo>
<mml:mo>&#xa0;</mml:mo>
<mml:msup>
<mml:mi mathvariant="bold-italic">e</mml:mi>
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mo>&#x2016;</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:msup>
<mml:mo>&#x2016;</mml:mo>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
<mml:mi>&#x3be;</mml:mi>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:math>
<label>(3)</label>
</disp-formula>where <italic>t</italic>
<sub>
<italic>i</italic>
</sub> and <italic>t</italic>
<sub>
<italic>j</italic>
</sub> denote time moments of nodes <italic>i</italic> and <italic>j</italic>, respectively. <italic>&#x3be;</italic> is the scale parameter, which is essential to generalization performance. Finally, with training data in [0, <italic>T</italic>
<sub>
<italic>L</italic>
</sub>] and sliding size <italic>n</italic>, this paper collects a total of <inline-formula id="inf11">
<mml:math id="m14">
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mi>L</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>/</mml:mo>
<mml:mi>n</mml:mi>
<mml:mo>&#xa0;</mml:mo>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula> load graphs as inputs into the ResGCN.</p>
</sec>
</sec>
<sec id="s2-2">
<title>2.2 Load Forecasting Based on ResGCN</title>
<sec id="s2-2-1">
<title>2.2.1 Problem Statement</title>
<p>Graph representation learning refers to the technique which extracts desired high-dimension features of a graph so that the representation can be easily used by downstream tasks (<xref ref-type="bibr" rid="B25">Xia et&#x20;al., 2021</xref>). In this paper, the short-term load forecasting problem can be stated as: Given a set of load graphs <inline-formula id="inf12">
<mml:math id="m15">
<mml:mrow>
<mml:mrow>
<mml:mo>{</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>G</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>G</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:msub>
<mml:mi>G</mml:mi>
<mml:mi>L</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo>}</mml:mo>
</mml:mrow>
<mml:mo>,</mml:mo>
<mml:mtext>&#xa0;&#xa0;</mml:mtext>
<mml:mi>L</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mi>L</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>/</mml:mo>
<mml:mi>n</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula> and the actual following 24-h load records as labels <inline-formula id="inf13">
<mml:math id="m16">
<mml:mrow>
<mml:mrow>
<mml:mo>{</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>L</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo>}</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>. Our goal is to learn a model that can make 24-h forecasts for unseen load graphs.</p>
<p>Although traditional convolutional neural networks perform well in text processing and image recognition, they can only process data in Euclidean space. To that end, there has been an increasing interest in generalizing convolutions to the graph domain (<xref ref-type="bibr" rid="B9">Jie and Gc, 2020</xref>). GCN is one of the most popular methods, which learns node representations by passing and aggregating messages between neighbor nodes while preserving the topological structure. However, an aggregation process with <italic>k</italic>th GCN layers makes use of information of <italic>k</italic>-order neighbors. As a result, GCN can over-smooth the representations when more GCN layers are stack. Therefore, inspired by the residual modeling, this paper designed a residual graph convolutional network (ResGCN) (<xref ref-type="bibr" rid="B12">Li et&#x20;al., 2018</xref>).</p>
</sec>
<sec id="s2-2-2">
<title>2.2.2 Framework of ResGCN</title>
<p>As shown in <xref ref-type="fig" rid="F4">Figure&#x20;4</xref>, the proposed ResGCN comprises the following components:<list list-type="simple">
<list-item>
<p>(1) Fully connected layer, which transforms the graph-structured representations into a sequence&#x20;<inline-formula id="inf14">
<mml:math id="m17">
<mml:mi>V</mml:mi>
</mml:math>
</inline-formula>;</p>
</list-item>
</list>
<disp-formula id="e4">
<mml:math id="m18">
<mml:mrow>
<mml:msubsup>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#xa0;</mml:mo>
<mml:mo>&#x3d;</mml:mo>
<mml:mo>&#xa0;</mml:mo>
<mml:msup>
<mml:mi>W</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mn>0</mml:mn>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msup>
<mml:msubsup>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mn>0</mml:mn>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x2b;</mml:mo>
<mml:msup>
<mml:mi>b</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mn>0</mml:mn>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:math>
<label>(4)</label>
</disp-formula>
<list list-type="simple">
<list-item>
<p>(2) Residual graph convolutional network (ResGCN) blocks, each of which is tasked to learn an encoder <inline-formula id="inf15">
<mml:math id="m19">
<mml:mrow>
<mml:mi>&#x3b5;</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi mathvariant="normal">A</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi mathvariant="normal">X</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>:</mml:mo>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mi mathvariant="normal">&#x211d;</mml:mi>
<mml:mrow>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
</mml:mrow>
</mml:msup>
<mml:mo>&#xd7;</mml:mo>
<mml:msup>
<mml:mi mathvariant="normal">&#x211d;</mml:mi>
<mml:mrow>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>F</mml:mi>
</mml:mrow>
</mml:msup>
<mml:mo>&#x2192;</mml:mo>
<mml:msup>
<mml:mi mathvariant="normal">&#x211d;</mml:mi>
<mml:mrow>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:msup>
<mml:mi>F</mml:mi>
<mml:mo>&#x27;</mml:mo>
</mml:msup>
</mml:mrow>
</mml:msup>
<mml:mo>&#xa0;</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula> such that the output <inline-formula id="inf16">
<mml:math id="m20">
<mml:mrow>
<mml:mi mathvariant="normal">Z</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mo>{</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mover accent="true">
<mml:mi mathvariant="italic">z</mml:mi>
<mml:mo>&#x2192;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mover accent="true">
<mml:mi>z</mml:mi>
<mml:mo>&#x2192;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mover accent="true">
<mml:mi mathvariant="italic">z</mml:mi>
<mml:mo>&#x2192;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
</mml:mrow>
</mml:msub>
<mml:mo>}</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> is high-level node representations, where <inline-formula id="inf17">
<mml:math id="m21">
<mml:mi>F</mml:mi>
</mml:math>
</inline-formula> and <inline-formula id="inf18">
<mml:math id="m22">
<mml:mrow>
<mml:msup>
<mml:mi>F</mml:mi>
<mml:mo>&#x27;</mml:mo>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula> are the dimension of input features and the dimension in the embedding space, respectively;</p>
</list-item>
<list-item>
<p>(3) LSTM layer, which extracts features from the input sequence&#x20;<inline-formula id="inf19">
<mml:math id="m23">
<mml:mi>V</mml:mi>
</mml:math>
</inline-formula>;</p>
</list-item>
<list-item>
<p>(4) Pooling layer with attention, which compresses the outputs by LSTM so that the redundant information can be removed. The pooling operation can be expressed&#x20;as</p>
</list-item>
</list>
<disp-formula id="e5">
<mml:math id="m24">
<mml:mrow>
<mml:mi>X</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">a</mml:mi>
<mml:mi mathvariant="normal">v</mml:mi>
<mml:mi mathvariant="normal">e</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2016;</mml:mo>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">m</mml:mi>
<mml:mi mathvariant="normal">a</mml:mi>
<mml:mi mathvariant="normal">x</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
<label>(5)</label>
</disp-formula>
<disp-formula id="e6">
<mml:math id="m25">
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mi>v</mml:mi>
<mml:mi>e</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mi>N</mml:mi>
</mml:mfrac>
<mml:munderover>
<mml:mstyle displaystyle="true">
<mml:mo>&#x2211;</mml:mo>
</mml:mstyle>
<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:msub>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
<label>(6)</label>
</disp-formula>
<disp-formula id="e7">
<mml:math id="m26">
<mml:mrow>
<mml:msub>
<mml:mi>X</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">m</mml:mi>
<mml:mi mathvariant="normal">a</mml:mi>
<mml:mi mathvariant="normal">x</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#xa0;</mml:mo>
<mml:mo>&#x3d;</mml:mo>
<mml:mo>&#xa0;</mml:mo>
<mml:mi>m</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>X</mml:mi>
<mml:mrow>
<mml:mo>{</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>X</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>X</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>&#x22ef;</mml:mo>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>X</mml:mi>
<mml:mi>N</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo>}</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(7)</label>
</disp-formula>where &#x7c;&#x7c; denotes the concatenation of vectors.<list list-type="simple">
<list-item>
<p>(5) Fully connected layers integrating element-wise activation functions, which map the final graph representations to the forecasts of future 24-h load,&#x20;as</p>
</list-item>
</list>
<disp-formula id="e8">
<mml:math id="m27">
<mml:mrow>
<mml:msubsup>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>k</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#xa0;</mml:mo>
<mml:mo>&#x3d;</mml:mo>
<mml:mo>&#xa0;</mml:mo>
<mml:msup>
<mml:mi>W</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msup>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msup>
<mml:mi>W</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>2</mml:mn>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msup>
<mml:msubsup>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>2</mml:mn>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x2b;</mml:mo>
<mml:msup>
<mml:mi>b</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>2</mml:mn>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msup>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x2b;</mml:mo>
<mml:msup>
<mml:mi>b</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:math>
<label>(8)</label>
</disp-formula>
</p>
<fig id="F4" position="float">
<label>FIGURE 4</label>
<caption>
<p>Framework of ResGCN for short-term load forecasting.</p>
</caption>
<graphic xlink:href="fenrg-09-813617-g004.tif"/>
</fig>
</sec>
<sec id="s2-2-3">
<title>2.2.3 Construction of one ResGCN Block</title>
<p>Without loss of generality, denote the input of one ResGCN block as <inline-formula id="inf20">
<mml:math id="m28">
<mml:mrow>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mi mathvariant="normal">&#x211d;</mml:mi>
<mml:mrow>
<mml:mi>N</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>F</mml:mi>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula> while the output as <inline-formula id="inf21">
<mml:math id="m29">
<mml:mrow>
<mml:mi mathvariant="bold-italic">Z</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mi mathvariant="normal">&#x211d;</mml:mi>
<mml:mrow>
<mml:mi>N</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:msup>
<mml:mi>F</mml:mi>
<mml:mo>&#x27;</mml:mo>
</mml:msup>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula>. Instead of learning the original mapping <inline-formula id="inf22">
<mml:math id="m30">
<mml:mrow>
<mml:mi>h</mml:mi>
<mml:mo>:</mml:mo>
<mml:mo>&#xa0;</mml:mo>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mi mathvariant="normal">&#x211d;</mml:mi>
<mml:mrow>
<mml:mi>N</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>F</mml:mi>
</mml:mrow>
</mml:msup>
<mml:mo>&#x2192;</mml:mo>
<mml:mi mathvariant="bold-italic">Z</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mi mathvariant="normal">&#x211d;</mml:mi>
<mml:mrow>
<mml:mi>N</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:msup>
<mml:mi>F</mml:mi>
<mml:mo>&#x27;</mml:mo>
</mml:msup>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula> directly, the stacked layers in one ResGCN block aim at learning the residual mapping defined as <inline-formula id="inf23">
<mml:math id="m31">
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>h</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mi mathvariant="bold-italic">X</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>, which is easier to optimize and can mitigate the over-smoothing. Therefore, the original mapping is recast as <inline-formula id="inf24">
<mml:math id="m32">
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x2b;</mml:mo>
<mml:mi mathvariant="bold-italic">X</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>.</p>
<p>As shown in <xref ref-type="fig" rid="F5">Figure&#x20;5</xref>, the operation for <inline-formula id="inf25">
<mml:math id="m33">
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x2b;</mml:mo>
<mml:mi mathvariant="bold-italic">X</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> is realized by a shortcut connection which is simply an identity mapping. The identity mapping ensures that the deeper model is at least have the same performance as its shallower counterpart. Besides, the residual mapping <inline-formula id="inf26">
<mml:math id="m34">
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> is fitted using one or two modified GCN layers, whose general form can be expressed as<disp-formula id="e9">
<mml:math id="m35">
<mml:mrow>
<mml:msubsup>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>k</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#xa0;</mml:mo>
<mml:mo>&#x3d;</mml:mo>
<mml:mo>&#xa0;</mml:mo>
<mml:mi>&#x3b3;</mml:mi>
<mml:mo>(</mml:mo>
<mml:msubsup>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi mathvariant="bold-italic">&#x393;</mml:mi>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>N</mml:mi>
<mml:mo>(</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:msub>
<mml:msup>
<mml:mi>&#x3d5;</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>k</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:msup>
<mml:mo>(</mml:mo>
<mml:msubsup>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:msubsup>
<mml:mi>x</mml:mi>
<mml:mi>j</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>&#x3c9;</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>)</mml:mo>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:math>
<label>(9)</label>
</disp-formula>where <inline-formula id="inf27">
<mml:math id="m36">
<mml:mrow>
<mml:msubsup>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>k</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> is the feature vector of node <italic>i</italic> in embedding space at the <italic>k</italic>th layer; <italic>N</italic>(<italic>i</italic>) denotes the neighbors of node <italic>i</italic>. <italic>&#x3d5;</italic> is a non-linear differentiable function, e.g., multi-layer perceptron (MLP), which updates representation of node <italic>i</italic> based on node features and edge weights <italic>&#x3c9;</italic>
<sub>
<italic>i,j</italic>
</sub> while &#x393; which aggregates representations of the neighbors, which is order invariant such as summation, maximization, and concatenation; <italic>&#x3b3;</italic> is a non-linear activation function.</p>
<fig id="F5" position="float">
<label>FIGURE 5</label>
<caption>
<p>Configuration of a ResGCN&#x20;block.</p>
</caption>
<graphic xlink:href="fenrg-09-813617-g005.tif"/>
</fig>
<p>Herein, this paper make modifications of the traditional GCN to mapping the residual, as<disp-formula id="equ1">
<mml:math id="m37">
<mml:mrow>
<mml:msubsup>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>k</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#xa0;</mml:mo>
<mml:mo>&#x3d;</mml:mo>
<mml:mo>&#xa0;</mml:mo>
<mml:mi mathvariant="bold">R</mml:mi>
<mml:mi mathvariant="bold">e</mml:mi>
<mml:mi mathvariant="bold">L</mml:mi>
<mml:mi mathvariant="bold">U</mml:mi>
<mml:mo>(</mml:mo>
<mml:mo>(</mml:mo>
<mml:munder>
<mml:mstyle displaystyle="true">
<mml:mo>&#x2211;</mml:mo>
</mml:mstyle>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>N</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:msup>
<mml:mstyle displaystyle="true">
<mml:mo>&#x222a;</mml:mo>
</mml:mstyle>
<mml:mtext>&#x200b;</mml:mtext>
</mml:msup>
<mml:mrow>
<mml:mo>{</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>}</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:munder>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>&#x3b1;</mml:mi>
<mml:mi>l</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x22c5;</mml:mo>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mrow>
<mml:msqrt>
<mml:mrow>
<mml:mi mathvariant="normal">d</mml:mi>
<mml:mi mathvariant="normal">e</mml:mi>
<mml:mi mathvariant="normal">g</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msqrt>
<mml:mo>&#x22c5;</mml:mo>
<mml:msqrt>
<mml:mrow>
<mml:mi mathvariant="normal">d</mml:mi>
<mml:mi mathvariant="normal">e</mml:mi>
<mml:mi mathvariant="normal">g</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msqrt>
</mml:mrow>
</mml:mfrac>
<mml:mo>&#x22c5;</mml:mo>
<mml:msub>
<mml:mi>&#x3c9;</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</disp-formula>
<disp-formula id="e10">
<mml:math id="m38">
<mml:mrow>
<mml:mrow>
<mml:mrow>
<mml:msubsup>
<mml:mi>x</mml:mi>
<mml:mi>j</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>&#x3b1;</mml:mi>
<mml:mi>l</mml:mi>
<mml:mo>&#x22c5;</mml:mo>
<mml:msub>
<mml:mi>&#x3c9;</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x22c5;</mml:mo>
<mml:msubsup>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mn>0</mml:mn>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>(</mml:mo>
<mml:mo>(</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>&#x3b2;</mml:mi>
<mml:mi>l</mml:mi>
<mml:mo>)</mml:mo>
<mml:msub>
<mml:mi>I</mml:mi>
<mml:mi>n</mml:mi>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>&#x3b2;</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>&#x398;</mml:mi>
<mml:mo>)</mml:mo>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:math>
<label>(10)</label>
</disp-formula>where &#x398; is the learnable weight matrix while <inline-formula id="inf28">
<mml:math id="m39">
<mml:mrow>
<mml:mi>d</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>g</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> denotes the degree of the <italic>i</italic>th node; <italic>&#x3b1;</italic>
<sub>
<italic>&#x2113;</italic>
</sub> and <italic>&#x3b2;</italic>
<sub>
<italic>&#x2113;</italic>
</sub> are decay parameters of the residual and weight matrix, respectively while <inline-formula id="inf29">
<mml:math id="m40">
<mml:mrow>
<mml:msub>
<mml:mi>I</mml:mi>
<mml:mi>n</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the identity matrix.</p>
</sec>
<sec id="s2-2-4">
<title>2.2.4 Construction of one ResGCN Block</title>
<p>The proposed ResGCN based short-term load forecasting is a regression problem so that the loss function is defined by mean square error. Besides, the L2 regularization is adopted to prevent the model from overfitting and to enhance the generalization ability, as<disp-formula id="e11">
<mml:math id="m41">
<mml:mrow>
<mml:mi mathvariant="bold-italic">L</mml:mi>
<mml:mi mathvariant="bold-italic">o</mml:mi>
<mml:mi mathvariant="bold-italic">s</mml:mi>
<mml:mi mathvariant="bold-italic">s</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mi>T</mml:mi>
</mml:mfrac>
<mml:munderover>
<mml:mstyle displaystyle="true">
<mml:mo>&#x2211;</mml:mo>
</mml:mstyle>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>T</mml:mi>
</mml:munderover>
<mml:msup>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mover accent="true">
<mml:mi>y</mml:mi>
<mml:mo>&#x5e;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msup>
<mml:mo>&#x2b;</mml:mo>
<mml:mfrac>
<mml:mi>&#x3bb;</mml:mi>
<mml:mn>2</mml:mn>
</mml:mfrac>
<mml:mo>&#x22c5;</mml:mo>
<mml:munder>
<mml:mstyle displaystyle="true">
<mml:mo>&#x2211;</mml:mo>
</mml:mstyle>
<mml:mi>i</mml:mi>
</mml:munder>
<mml:msubsup>
<mml:mi>&#x3c9;</mml:mi>
<mml:mi>i</mml:mi>
<mml:mn>2</mml:mn>
</mml:msubsup>
</mml:mrow>
</mml:math>
<label>(11)</label>
</disp-formula>where <inline-formula id="inf30">
<mml:math id="m42">
<mml:mrow>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mo>&#xa0;</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula> is training data while <inline-formula id="inf31">
<mml:math id="m43">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mover accent="true">
<mml:mi>y</mml:mi>
<mml:mo>&#x5e;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mi>t</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the output of ResGCN; <inline-formula id="inf32">
<mml:math id="m44">
<mml:mi>&#x3bb;</mml:mi>
</mml:math>
</inline-formula> is weight decay in case that the penalty term is too large, <inline-formula id="inf33">
<mml:math id="m45">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3c9;</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the parameter weight of the&#x20;net.</p>
<p>With the loss function, ResGCN is trained by Adam, wherein the data are split into small batches that are used to calculate the loss function and update the coefficients. Besides, the EarlyStopping mechanism (<xref ref-type="bibr" rid="B18">Prechelt, 2012</xref>) is introduced to halt the training when the loss function stops to decrease for several iterations.</p>
</sec>
<sec id="s2-2-5">
<title>2.2.5 Parallel Training</title>
<p>The load graphs in one batch cannot simply be fed into the model simultaneously, which is not computationally efficient. Therefore, this paper proposes a graph concatenation method for parallel training. Specifically, the adjacency matrix <inline-formula id="inf34">
<mml:math id="m46">
<mml:mi mathvariant="normal">A</mml:mi>
</mml:math>
</inline-formula> and feature matrix <inline-formula id="inf35">
<mml:math id="m47">
<mml:mi mathvariant="normal">X</mml:mi>
</mml:math>
</inline-formula> of multiple independent load graphs are concatenated respectively by diagonal, yielding a giant graph with sparse and large adjacency matrix and feature matrix containing the information of all the subgraphs, as depicted in <xref ref-type="fig" rid="F6">Figure&#x20;6</xref>. Thanks to the weight sharing mechanism, the training of feeding the giant graph into ResGCN is the equivalent to training the multiple subgraphs separately, whereas the computation time can be saved significantly.</p>
<fig id="F6" position="float">
<label>FIGURE 6</label>
<caption>
<p>Graph concatenation for parallel training.</p>
</caption>
<graphic xlink:href="fenrg-09-813617-g006.tif"/>
</fig>
</sec>
</sec>
</sec>
<sec id="s3">
<title>3 Case Studies</title>
<sec id="s3-1">
<title>3.1 Implementation and Benchmark</title>
<p>Codes related to all the simulations are available on <ext-link ext-link-type="uri" xlink:href="https://github.com/YoungY6/ResGCN-for-Short-term-power-load-forecasting-under-COVID-19">https://github.com/YoungY6/ResGCN-for-Short-term-power-load-forecasting-under-COVID-19</ext-link> for the sake of repeatability.</p>
<p>The COVID-EMDA &#x2b; dataset (<xref ref-type="bibr" rid="B21">Ruan et&#x20;al., 2020</xref>) is adopted to validate the proposed method, which is developed by the group in Tsinghua university led by Prof. Haiwang Zhong, the primary supervisor of this study, in collaboration with other two famous groups in Texas A&#x26;M University and Massachusetts Institute of Technology, respectively. It integrates historical load information from major United&#x20;States power markets such as CAISO, MISO, ISO-NE, and NYISO and other exogenous information such as epidemic status and population flows, which has won wide recognition and been published in Joule. The dataset integrates historical load information from major United&#x20;States power markets such as CAISO, MISO, ISO-NE, and NYISO and other exogenous information such as epidemic status and population&#x20;flows.</p>
<p>The distribution of confirmed COVID-19 cases in the United&#x20;States until January 02, 2021, is shown in <xref ref-type="fig" rid="F7">Figure&#x20;7</xref>. It can be observed that, as the most populous city in Texas, Houston has as many as 48,225 confirmed cases, ranking in the second place in the United&#x20;States Besides, its GDP exceeded $512 billion prior to the outbreak of the pandemic, which was more than those of 37 states in the United&#x20;States and accounted for 27.8% of that of Texas. Moreover, as the fourth largest city, it has annual electricity consumption of nearly 1.08 billion kWh in 2019. Therefore, the data of ERCOT-Houston from January 23, 2020, to November 23, 2020, were selected from COVID-EMDA &#x2b; for training and testing since Houston is representative in terms of epidemic development, economic status, and electricity consumption&#x20;load.</p>
<fig id="F7" position="float">
<label>FIGURE 7</label>
<caption>
<p>Distribution of cumulative confirmed cases in the United&#x20;States</p>
</caption>
<graphic xlink:href="fenrg-09-813617-g007.tif"/>
</fig>
<p>The data is divided into training set, validation set, and test set in the ratio of 8:1:1. The proposed method is compared with the other five classical algorithms, including traditional temporal prediction algorithms, namely ARIMA, MAF, ES, machine learning-based method, i.e.,&#x20;Random forests (RF), and long short-term memory deep neural networks (LSTM-DNN). The inputs and hyperparameters of the algorithms are shown in <xref ref-type="table" rid="T1">Table&#x20;1</xref>. Besides, two metrics are selected to assess their performance, namely mean absolute percentage error (MAPE) and root mean square error (RMSE), which are calculated as<disp-formula id="e12">
<mml:math id="m48">
<mml:mrow>
<mml:mi mathvariant="normal">M</mml:mi>
<mml:mi mathvariant="normal">A</mml:mi>
<mml:mi mathvariant="normal">P</mml:mi>
<mml:mi mathvariant="normal">E</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mn>100</mml:mn>
<mml:mo>%</mml:mo>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:mfrac>
<mml:munderover>
<mml:mstyle displaystyle="true">
<mml:mo>&#x2211;</mml:mo>
</mml:mstyle>
<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:mo>&#x7c;</mml:mo>
<mml:mrow>
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mover accent="true">
<mml:mi>y</mml:mi>
<mml:mo>&#x5e;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
<mml:mo>&#x7c;</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(12)</label>
</disp-formula>
<disp-formula id="e13">
<mml:math id="m49">
<mml:mrow>
<mml:mi mathvariant="normal">R</mml:mi>
<mml:mi mathvariant="normal">M</mml:mi>
<mml:mi mathvariant="normal">S</mml:mi>
<mml:mi mathvariant="normal">E</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:munderover>
<mml:mstyle displaystyle="true">
<mml:mo>&#x2211;</mml:mo>
</mml:mstyle>
<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:msup>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mover accent="true">
<mml:mi>y</mml:mi>
<mml:mo>&#x5e;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
</mml:msqrt>
</mml:mrow>
</mml:math>
<label>(13)</label>
</disp-formula>where <inline-formula id="inf36">
<mml:math id="m50">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mover accent="true">
<mml:mi>y</mml:mi>
<mml:mo>&#x5e;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf37">
<mml:math id="m51">
<mml:mrow>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> are testing data and forecasts by the algorithms, respectively, while <inline-formula id="inf38">
<mml:math id="m52">
<mml:mi>n</mml:mi>
</mml:math>
</inline-formula> is the total number of time moments in the data&#x20;set.</p>
<table-wrap id="T1" position="float">
<label>TABLE 1</label>
<caption>
<p>Inputs and hyperparameters of compared algorithms.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="left">Algorithms</th>
<th align="center">Inputs</th>
<th align="center">Hyperparameters</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="left">ARIMA</td>
<td align="left">Load 48&#xa0;h before the forecast day</td>
<td align="left">Maxp: 5; Maxq: 5</td>
</tr>
<tr>
<td align="left">MAF</td>
<td align="left">Load 48&#xa0;h before the forecast day</td>
<td align="left">P: 2</td>
</tr>
<tr>
<td align="left">SES</td>
<td align="left">Load 48&#xa0;h before the forecast day</td>
<td align="left">Alpha: 0.6</td>
</tr>
<tr>
<td rowspan="2" align="left">RF</td>
<td rowspan="4" align="left">Load 48&#xa0;h before the forecast day;<break/>Daily confirmed cases<break/>Mobility in grocery and pharmacy<break/>The counts of mobile devices locating at home<break/>The temperature</td>
<td align="left">Number of trees: 100;<break/>Minimum sample number: 1<break/>Maximum depth of tree: 9</td>
</tr>
<tr>
<td rowspan="3" align="left">Optimizer:Adam<break/>LSTM layer unit: 50<break/>Dense layer1 unit: 1,040<break/>Dense layer2 unit: 520<break/>Dense layer3 unit: 24<break/>Epoch: 500<break/>Batch size: 100</td>
</tr>
<tr>
<td align="left">LSTM-DNN</td>
</tr>
<tr>
<td rowspan="2" align="left">ResGCN</td>
</tr>
<tr>
<td align="left">As described in <xref ref-type="sec" rid="s2-1">Section 2.1</xref>
</td>
<td align="left">As described in <xref ref-type="sec" rid="s2-2">Section 2.2</xref>
</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s3-2">
<title>3.2 Validation of ResGCN for Short-Term Load Forecasting</title>
<p>The results on all the test data are shown in <xref ref-type="fig" rid="F8">Figure&#x20;8A</xref> while on 1&#xa0;day are depicted in <xref ref-type="fig" rid="F8">Figure&#x20;8B</xref>, which demonstrates that the prediction results of the proposed method are closer to the actual value compared with other algorithms. Besides, it can be observed from <xref ref-type="table" rid="T2">Table&#x20;2</xref> that the performance of ARIMA, MAF, ES, and RF is not satisfactory for both MAPE and RMSE. Although LSTM-DNN outperforms the above four methods, its performance is still worse than those of the proposed method, with increases of MAPE and RMSE by 1.3264 and 15.03%, respectively. This justifies the superiority of the proposed method over other algorithms in short-term load forecasting.</p>
<fig id="F8" position="float">
<label>FIGURE 8</label>
<caption>
<p>Forecasts by different methods. <bold>(A)</bold> Forecasts on all the testing data; <bold>(B)</bold> Forecasts on 2020.11.05.</p>
</caption>
<graphic xlink:href="fenrg-09-813617-g008.tif"/>
</fig>
<table-wrap id="T2" position="float">
<label>TABLE 2</label>
<caption>
<p>Performance metrics of different methods.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="left"/>
<th align="center">ARIMA</th>
<th align="center">MAF</th>
<th align="center">ES</th>
<th align="center">RF</th>
<th align="center">LSTM-DNN</th>
<th align="center">ResGCN</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="left">MAPE/%</td>
<td align="char" char=".">14.3367</td>
<td align="char" char=".">15.1350</td>
<td align="char" char=".">14.8626</td>
<td align="char" char=".">10.5937</td>
<td align="char" char=".">8.3187</td>
<td align="char" char=".">6.9923</td>
</tr>
<tr>
<td align="left">RMSE/MW</td>
<td align="char" char=".">1,772.93</td>
<td align="char" char=".">1,898.86</td>
<td align="char" char=".">1,860.48</td>
<td align="char" char=".">1,416.99</td>
<td align="char" char=".">1,141.81</td>
<td align="char" char=".">970.05</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s3-3">
<title>3.3 Validation of Changes in Electricity Consumption Under COVID-19</title>
<p>To validate our argument that the epidemic largely affects electricity utilization, the differences in power load in 2020 with and without the pandemic are compared. To that end, using historical data during 2017&#x2013;2019, the load forecasts in 2020 by the well-acknowledged linear regression are assumed as a benchmark for the electricity utilization without the crisis.</p>
<p>Firstly, the differences in annual total electricity consumption and maximum load are analyzed, as shown in <xref ref-type="fig" rid="F9">Figures&#x20;9A, B</xref>, respectively. According to the linear regression-based method, the total electricity consumption in 2020 should reach 110.142 million kWh. However, it was only 107.757 million kWh in reality, with a decrease by 2.3851 million kWh. By contrast, the actual maximum load was higher than the forecasts by 1,284&#xa0;kW. The results by the linear regression are reasonable in the sense that Houston is still in a stage of high growth based on the trend of its load in the previous 2&#xa0;years. However, there was a significant drop in electricity consumption and maximum load, which was clearly an anomaly likely caused by the changes in industrial production and economic activities under the epidemic.</p>
<fig id="F9" position="float">
<label>FIGURE 9</label>
<caption>
<p>Comparison of annual total electricity consumption and maximum load with and without COVID-19. <bold>(A)</bold> Annual total electricity consumption; <bold>(B)</bold> Annual maximum load.</p>
</caption>
<graphic xlink:href="fenrg-09-813617-g009.tif"/>
</fig>
<p>Secondly, the differences in daily and monthly total electricity consumption and maximum load are also compared, as shown in <xref ref-type="fig" rid="F10">Figures 10A, B</xref> and <xref ref-type="fig" rid="F11">Figures 11A, B</xref>, respectively. It can be seen that the forecasts by linear regression remain bigger than the actual values from March to October. Turning to the status of the epidemic and people&#x0027;s responses represented, this paper analyze the data of COVID-19 cases, infection rate and fatality rate, changes of working location as well as mobility in public places, which are depicted in <xref ref-type="fig" rid="F12">Figures&#x20;12A-D</xref> respectively. It can be observed that there are similar trends involved in epidemic development and load changes: On March 13, 2020, then-President Trump declared a state of emergency in the United&#x20;States, after which the ratio of the working-from-home population increased while the electricity consumption immediately drops; Besides, the number of confirmed cases started to increase in late March, resulting in less mobility in public places while the load level also kept at a lower level. Thus, it is safe to draw the conclusion that electricity consumption is strongly connected with COVID-19 cases and the level of social activities.</p>
<fig id="F10" position="float">
<label>FIGURE 10</label>
<caption>
<p>Comparison of monthly total electricity consumption and monthly total electricity consumption with and without COVID-19. <bold>(A)</bold> Daily total electricity consumption; <bold>(B)</bold> Monthly total electricity consumption.</p>
</caption>
<graphic xlink:href="fenrg-09-813617-g010.tif"/>
</fig>
<fig id="F11" position="float">
<label>FIGURE 11</label>
<caption>
<p>Comparison of daily and monthly maximum load with and without COVID-19. <bold>(A)</bold> Daily maximum load; <bold>(B)</bold> Monthly maximum load Monthly.</p>
</caption>
<graphic xlink:href="fenrg-09-813617-g011.tif"/>
</fig>
<fig id="F12" position="float">
<label>FIGURE 12</label>
<caption>
<p>COVID-19 Status and people&#x2019; response in Houston. <bold>(A)</bold> Daily increase numbers of confirmed cases and deaths; <bold>(B)</bold> Infection rate and fatality rate; <bold>(C)</bold> Changes of working location; <bold>(D)</bold> Mobility in public places.</p>
</caption>
<graphic xlink:href="fenrg-09-813617-g012.tif"/>
</fig>
</sec>
<sec id="s3-4">
<title>3.4 Validation of Load Graph-Based ResGCN in Short-Term Load Forecasting Under COVID-19</title>
<p>With the correlation between COVID-19 and electricity consumption changes in mind, it is apparent that the effects of the pandemic shall be incorporated into short-term load forecasting. To evaluate the proposed load graph encoding heterogeneous features, this paper compared the method to another graph that only encodes load and temperature information, termed naive load graph in the following. Then, the forecasting performance of ResGCN with the two kinds of graphs are analyzed in the scenarios with and without COVID-19.</p>
<p>It can be seen from <xref ref-type="table" rid="T3">Table&#x20;3</xref> that the ResGCN with na&#xef;ve load graph achieves a desired performance in load forecasting in the scenario of the Year 2019, with MAPE as small as 6.0021%. However, the performance declines after the outbreak of the pandemic, with an increase in MAPE by around 1.5%. By contrast, using load graph encoding heterogeneous features, the forecast performance of ResGCN is much more robust, as shown in <xref ref-type="table" rid="T4">Table&#x20;4</xref>. The superiority of the proposed method is further validated by <xref ref-type="fig" rid="F13">Figure&#x20;13</xref>, where the forecasts with consideration of COVID-19 are far closer to the actual data. This again justifies that incorporating the epidemic&#x2019;s effects can improve the accuracy of short-term load forecasting, which is of significant value for a new normal featured by living with COVID-19.</p>
<table-wrap id="T3" position="float">
<label>TABLE 3</label>
<caption>
<p>Forecasting performance of ResGCN with naive load&#x20;graph.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="left"/>
<th align="center">Before COVID-19(Year 201)</th>
<th align="center">After the outbreak of COVID-19(Year 2020)</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="left">MAPE/%</td>
<td align="char" char=".">6.0021</td>
<td align="char" char=".">7.5174</td>
</tr>
<tr>
<td align="left">RMSE/MW</td>
<td align="char" char=".">1,023.51</td>
<td align="char" char=".">1,079.84</td>
</tr>
</tbody>
</table>
</table-wrap>
<table-wrap id="T4" position="float">
<label>TABLE 4</label>
<caption>
<p>Forecasting performance of ResGCN with load graph encoding heterogeneous features.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="left"/>
<th align="center">Before COVID-19(Year 2019)</th>
<th align="center">After the outbreak of COVID-19(Year 2020)</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="left">MAPE/%</td>
<td align="center">&#x2014;</td>
<td align="char" char=".">6.9923</td>
</tr>
<tr>
<td align="left">RMSE/MW</td>
<td align="center">&#x2014;</td>
<td align="char" char=".">970.05</td>
</tr>
</tbody>
</table>
</table-wrap>
<fig id="F13" position="float">
<label>FIGURE 13</label>
<caption>
<p>Short-term load forecasts with and without considering effects of COVID-19 (2020.10.23-2020.10.26).</p>
</caption>
<graphic xlink:href="fenrg-09-813617-g013.tif"/>
</fig>
</sec>
</sec>
<sec id="s4">
<title>4 Conclusion and Prospects</title>
<sec id="s4-1">
<title>4.1 Conclusion</title>
<p>The fight against COVID-19 is far from over, while many countries start to resume economic development aiming at a &#x201c;living with COVID&#x201d; new normal. In this context, this paper proposes a novel short-term load forecasting method under COVID-19 based on graph representation learning with heterogeneous features. Unlike existing methods that fit power load data to time series, this study encodes heterogeneous features relevant to electricity consumption and epidemic status into a load graph, so that not only the features are contained at each time moment, but also the inherent correlations between the features can be exploited; Then, a residual graph convolutional network (ResGCN) is constructed to fit the non-linear mapping between load graph to future loads. Besides, a graph concatenation method for parallel training is proposed to improve the learning efficiency.</p>
<p>The following points can be concluded from the case study using practical data in Houston:<list list-type="simple">
<list-item>
<p>(1) There are strong correlations between the evolution of COVID-19 and changes in electricity utilization.</p>
</list-item>
<list-item>
<p>(2) The proposed load graph is capable of exploiting heterogeneous features, while the accuracy of load forecasting can be improved significantly by considering the effects of the pandemic.</p>
</list-item>
<list-item>
<p>(3) The ResGCN outperforms existing short-term load forecasting methods in accuracy, with a decrease of RMSE by 15.03% compared with LSTM-DNN.</p>
</list-item>
</list>
</p>
</sec>
<sec id="s4-2">
<title>4.2 Prospects</title>
<p>In the present forecasting methodology with load graph, features like vaccination rates have not been considered. As the epidemic develops and vaccination becomes more widespread, these characteristics will become a non-negligible part of the epidemic&#x2019;s impact on the load. Therefore, it remains for us to refine the load graph as the situation evolves. In addition, the selected features encoding in the load graph only reflect partial impacts of the epidemic, while further research is still needed to grasp their relationships&#x20;fully.</p>
<p>It is worth noting that the idea of representing load as a graph and using ResGCN to do the forecasting can be applied not only to the regional load forecasting under major social and health events such as epidemics but also to the forecasting tasks that also require the integration of heterogeneous information, e.g., renewable energy output forecasting, which will be the direction of our future research.</p>
<p>As for the impacts of the epidemic on load, as the paper concluded in the case study, they are complex and need to be studied with respect to local policies. The discussions in this paper are focused on Houston only. In fact, the responses of the government and the attitude of people to the epidemic vary significantly from country to country, so that the situation in a larger area shall be investigated in the future.</p>
</sec>
</sec>
</body>
<back>
<sec id="s5">
<title>Data Availability Statement</title>
<p>Publicly available datasets were analyzed in this study. This data can be found here: <ext-link ext-link-type="uri" xlink:href="https://github.com/tamu-engineering-research/COVID-EMDA">https://github.com/tamu-engineering-research/COVID-EMDA</ext-link>.</p>
</sec>
<sec id="s6">
<title>Author Contributions</title>
<p>Conceptualization, ZY; Data curation, JY; Formal analysis, YW; Methodology, ZY; Project administration, ZY; Resources, JY; Visualization, YH; Writing, ZY, All authors contributed to the article and approved the submitted version.</p>
</sec>
<sec sec-type="COI-statement" id="s7">
<title>Conflict of Interest</title>
<p>The 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="s8">
<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>
<ack>
<p>The authors gratefully acknowledge the support of The Natural Science Foundation of China- Smart Grid Joint Fund of State Grid Corporation of China (U2066212) and the Data provided by Haiwang Zhong.</p>
</ack>
<ref-list>
<title>References</title>
<ref id="B1">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Agdas</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Barooah</surname>
<given-names>P.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Impact of the COVID-19 Pandemic on the U.S. Electricity Demand and Supply: an Early View from Data[J]</article-title>. <source>IEEE Access</source> <volume>8</volume>, <fpage>1</fpage>. <pub-id pub-id-type="doi">10.1109/ACCESS.2020.3016912</pub-id> </citation>
</ref>
<ref id="B2">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Amral</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Ozveren</surname>
<given-names>C. S.</given-names>
</name>
<name>
<surname>King</surname>
<given-names>D.</given-names>
</name>
</person-group> (<year>2007</year>). <source>Short Term Load Forecasting Using Multiple Linear Regression[C]//2007 42nd International Universities Power Engineering Conference Brighton IEEE</source>. </citation>
</ref>
<ref id="B3">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Bui</surname>
<given-names>Q.</given-names>
</name>
<name>
<surname>Wolfers</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2020</year>). <source>&#x201c;Another Way to See the Recession: Power Usage Is Way Down,&#x201d; New York Times</source> (<comment>Accessed May 6, 2020)</comment>.<article-title>
</article-title> </citation>
</ref>
<ref id="B4">
<citation citation-type="other">
<person-group person-group-type="author">
<name>
<surname>Chen</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Xu</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Guo</surname>
<given-names>R.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>A Study on the Influence Rule of Load Forecasting on Multi-Objective Optimal Dispatching of a New-Energy Grid [J]</article-title>. <source>Power Syst. Prot. Control.</source> <volume>48</volume> (<issue>10</issue>), <fpage>46</fpage>&#x2013;<lpage>51</lpage>. </citation>
</ref>
<ref id="B5">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Cicala</surname>
<given-names>S.</given-names>
</name>
</person-group> <source>Early Economic Impacts of COVID-19 in Europe: A View from the grid. Tech. Rep</source>. <publisher-loc>Chicago, IL, USA</publisher-loc>: <publisher-name>Univ. Chicago</publisher-name>. <comment>Available at</comment>: <comment>
<ext-link ext-link-type="uri" xlink:href="https://home.uchicago.edu/scicala/papers/real_time_EU/real_time_EU.pdf">https://home.uchicago.edu/scicala/papers/real_time_EU/real_time_EU.pdf</ext-link> (Accessed May 6, 2020)</comment>. </citation>
</ref>
<ref id="B6">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Gupta</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Kumar</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2020</year>). &#x201c;<article-title>Mid Term Daily Load Forecasting Using ARIMA, Wavelet ARIMA and Machine Learning[C]</article-title>,&#x201d; in <conf-name>2020 IEEE International Conference on Environment and Electrical Engineering and 2020 IEEE Industrial and Commercial Power Systems Europe (EEEIC/I&#x26;CPS Europe)</conf-name> (<publisher-name>IEEE</publisher-name>). </citation>
</ref>
<ref id="B7">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Han</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Yang</surname>
<given-names>G.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Prediction of NOx Emissions of Coal-Fired Power Plants Based on Mutual Information-Graph Convolutional Neural Network [J/OL]</article-title>. <source>Proc. CSEE</source> <fpage>1</fpage>. <pub-id pub-id-type="doi">10.13334/j.0258-8013.pcsee.202540</pub-id> </citation>
</ref>
<ref id="B8">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Huang</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>X.</given-names>
</name>
</person-group> (<year>2020</year>). <source>Global Prediction System for COVID-19 pandemic[J]</source>. <publisher-loc>Bethesda</publisher-loc>: <publisher-name>Science Bulletin</publisher-name>. </citation>
</ref>
<ref id="B9">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Jie</surname>
<given-names>Z. A.</given-names>
</name>
<name>
<surname>Gc</surname>
<given-names>A.</given-names>
</name>
</person-group>, (<year>2020</year>). <article-title>Graph Neural Networks: A Review of Methods and Applications[J]</article-title>. <source>AI Open</source> <volume>1</volume>, <fpage>57</fpage>&#x2013;<lpage>81</lpage>. <pub-id pub-id-type="doi">10.1016/J.AIOPEN.2021.01.001</pub-id> </citation>
</ref>
<ref id="B10">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Kharin</surname>
<given-names>Y .</given-names>
</name>
</person-group> (<year>2013</year>). <source>Robustness in Statistical Forecasting</source>. <publisher-name>Springer Berlin Heidelberg</publisher-name>. </citation>
</ref>
<ref id="B11">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Lu</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Short-term Load Forecasting Modeling of Regional Power Grid Considering Real-Time Meteorological Coupling Effect[J]</article-title>. <source>Automation Electric Power Syst.</source> <volume>44</volume> (<issue>17</issue>), <fpage>60</fpage>&#x2013;<lpage>68</lpage>. <comment>(in Chinese)</comment>. <pub-id pub-id-type="doi">10.7500/AEPS20200216001</pub-id> </citation>
</ref>
<ref id="B12">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Li</surname>
<given-names>Q.</given-names>
</name>
<name>
<surname>Han</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Wu</surname>
<given-names>X.</given-names>
</name>
</person-group> (<year>2018</year>). &#x201c;<article-title>Deeper Insights into Graph Convolutional Networks for Semi-supervised Learning[C]</article-title>. in&#x201d; <conf-name>32nd AAAI Conference on Artificial Intelligence</conf-name>. <publisher-loc>New Orleans, LA, United states</publisher-loc>. </citation>
</ref>
<ref id="B13">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Ma</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Zhao</surname>
<given-names>X.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Multi-time Scale Electric Heating Load Forecasting Based on Long Short-Term Memory Network</article-title>. <source>Proc. CSU-EPSA</source> <volume>33</volume>, <fpage>71</fpage>. <pub-id pub-id-type="doi">10.19635/j.cnki.csu-epsa.000463</pub-id> </citation>
</ref>
<ref id="B14">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Jia</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>L.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Short Term Power Load Forecasting Based on a Stochastic forest Algorithm</article-title>. <source>[J].Power Syst. Prot. and Control</source> <volume>48</volume> (<issue>21</issue>), <fpage>117</fpage>&#x2013;<lpage>124</lpage>. <comment>(in Chinese)</comment>. <pub-id pub-id-type="doi">10.19783/j.cnki.pspc.191594</pub-id> </citation>
</ref>
<ref id="B15">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Liu</surname>
<given-names>K.</given-names>
</name>
</person-group> (<year>2015</year>). <article-title>Development Path Exploration of Energy Internet [J]</article-title>. <source>Electric Power Construction</source> <volume>36</volume> (<issue>10</issue>), <fpage>5</fpage>&#x2013;<lpage>10</lpage>. <pub-id pub-id-type="doi">10.3969/j.issn.1000-7229.2015.10.001</pub-id> </citation>
</ref>
<ref id="B16">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Meng</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Hu</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>X.</given-names>
</name>
</person-group> (<year>2016</year>). <article-title>Short-term Load Forecasting Using Neural Network Based on Wavelets and Crisscross Optimization Algorithm[J]</article-title>. <source>Power Syst. Prot. Control.</source> <volume>44</volume> (<issue>7</issue>), <fpage>102</fpage>&#x2013;<lpage>106</lpage>. </citation>
</ref>
<ref id="B17">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>WHO</surname>
</name>
</person-group> (<year>2020</year>). <source>Statement on the Fourth Meeting of the International Health Regulations Emergency Committee Regarding the Outbreak of Coronavirus Disease (COVID-19)</source>. <publisher-loc>Geneva, Switzerland</publisher-loc>. </citation>
</ref>
<ref id="B18">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Prechelt</surname>
<given-names>L.</given-names>
</name>
</person-group> (<year>2012</year>). <source>Early Stopping &#x2014;&#x20;but when? Neural Networks</source>. <publisher-loc>Berlin, Heidelberg</publisher-loc>: <publisher-name>Springer</publisher-name>. </citation>
</ref>
<ref id="B19">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Rendon-Sanchez</surname>
<given-names>J.&#x20;F.</given-names>
</name>
<name>
<surname>De Menezes</surname>
<given-names>L. M.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Structural Combination of Seasonal Exponential Smoothing Forecasts Applied to Load Forecasting</article-title>. <source>[J].European J.&#x20;Oper. Res.</source> <volume>275</volume> (<issue>3</issue>), <fpage>916</fpage>&#x2013;<lpage>924</lpage>. <pub-id pub-id-type="doi">10.1016/j.ejor.2018.12.013</pub-id> </citation>
</ref>
<ref id="B20">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ruan</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Wu</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Zhong</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Xia</surname>
<given-names>Q.</given-names>
</name>
<name>
<surname>Xie</surname>
<given-names>L.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Quantitative Assessment of U.S. Bulk Power Systems and Market Operations during the COVID-19 Pandemic</article-title>. <source>Appl. Energ.</source> <volume>286</volume> (<issue>2021</issue>), <fpage>116354</fpage>. <pub-id pub-id-type="doi">10.1016/j.apenergy.2020.116354</pub-id> </citation>
</ref>
<ref id="B21">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ruan</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Wu</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Zheng</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Zhong</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Kang</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Dahleh</surname>
<given-names>M. A.</given-names>
</name>
<etal/>
</person-group> (<year>2020</year>). <article-title>A Cross-Domain Approach to Analyzing the Short-Run Impact of COVID-19 on the US Electricity Sector</article-title>. <source>Joule</source> <volume>4</volume> (<issue>11</issue>), <fpage>2322</fpage>&#x2013;<lpage>2337</lpage>. <pub-id pub-id-type="doi">10.1016/j.joule.2020.08.017</pub-id> </citation>
</ref>
<ref id="B22">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>J.,&#x20;Li. X.</given-names>
</name>
<name>
<surname>He</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Distribution Network Fault Location Based on Graph Attention Network[J]</article-title>. <source>Power Syst. Techn.</source> <volume>45</volume> (<issue>6</issue>), <fpage>1</fpage>. <pub-id pub-id-type="doi">10.13335/j.1000-3673.pst.2020.2222</pub-id> </citation>
</ref>
<ref id="B23">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Power Load Data Prediction Method Based on LSTM Neural Network Model[J]</article-title>. <source>Research Exploration Lab.</source> <volume>39</volume>, <fpage>41</fpage>&#x2013;<lpage>45</lpage>. </citation>
</ref>
<ref id="B24">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Werth</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Gravino</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Prevedello</surname>
<given-names>G.</given-names>
</name>
</person-group> (<year>2020</year>). <source>Impact Analysis of COVID-19 Responses on Energy Grid Dynamics in Europe</source>. <publisher-name>Applied Science Publishers</publisher-name>, <fpage>281</fpage>. </citation>
</ref>
<ref id="B25">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Xia</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Sun</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Yu</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2021</year>). <source>Graph Learning: A Survey</source>. </citation>
</ref>
<ref id="B26">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Zhou</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Or</surname>
<given-names>S. W.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Chung</surname>
<given-names>C. Y.</given-names>
</name>
<name>
<surname>Voropai</surname>
<given-names>N. I.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Optimal Coordinated Control of Multi-Renewable-To-Hydrogen Production System for Hydrogen Fueling Stations</article-title>. <source>IEEE Trans. Ind. Applicat.</source> <fpage>1</fpage>. <pub-id pub-id-type="doi">10.1109/TIA.2021.3093841</pub-id> </citation>
</ref>
<ref id="B27">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhu</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Xun</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Short-term Power Load Forecasting Based on CNN-BiLSTM</article-title>. <source>[J/OL]Power Syst. Techn.</source> <volume>45 (11)</volume>, <fpage>1</fpage>&#x2013;<lpage>9</lpage>. <pub-id pub-id-type="doi">10.13335/j.1000-3673.pst.2021.0470</pub-id> </citation>
</ref>
</ref-list>
</back>
</article>