<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xml:lang="en" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">EE</journal-id>
<journal-id journal-id-type="nlm-ta">EE</journal-id>
<journal-id journal-id-type="publisher-id">EE</journal-id>
<journal-title-group>
<journal-title>Energy Engineering</journal-title>
</journal-title-group>
<issn pub-type="epub">1546-0118</issn>
<issn pub-type="ppub">0199-8595</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">42633</article-id>
<article-id pub-id-type="doi">10.32604/ee.2023.042633</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Identification of High-Risk Scenarios for Cascading Failures in New Energy Power Grids Based on Deep Embedding Clustering Algorithms</article-title>
<alt-title alt-title-type="left-running-head">Identification of High-Risk Scenarios for Cascading Failures in New Energy Power Grids Based on Deep Embedding Clustering Algorithms</alt-title>
<alt-title alt-title-type="right-running-head">Identification of High-Risk Scenarios for Cascading Failures in New Energy Power Grids Based on Deep Embedding Clustering Algorithms</alt-title>
</title-group>
<contrib-group>
<contrib id="author-1" contrib-type="author">
<name name-style="western"><surname>Cheng</surname><given-names>Xueting</given-names></name><xref ref-type="aff" rid="aff-1">1</xref></contrib>
<contrib id="author-2" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Zhang</surname><given-names>Ziqi</given-names></name><xref ref-type="aff" rid="aff-2">2</xref><email>zhang_zq19991219@163.com</email></contrib>
<contrib id="author-3" contrib-type="author">
<name name-style="western"><surname>Bao</surname><given-names>Yueshuang</given-names></name><xref ref-type="aff" rid="aff-1">1</xref></contrib>
<contrib id="author-4" contrib-type="author">
<name name-style="western"><surname>Zheng</surname><given-names>Huiping</given-names></name><xref ref-type="aff" rid="aff-1">1</xref></contrib>
<aff id="aff-1"><label>1</label><institution>State Grid Shanxi Electric Power Research Institute, State Grid Shanxi Electric Power Co., Ltd.</institution>, <addr-line>Taiyuan, 030001</addr-line>, <country>China</country></aff>
<aff id="aff-2"><label>2</label><institution>School of Electrical and Electronic Engineering, North China Electric Power University</institution>, <addr-line>Beijing, 102206</addr-line>, <country>China</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Author: Ziqi Zhang. Email: <email>zhang_zq19991219@163.com</email></corresp>
</author-notes>
<pub-date date-type="collection" publication-format="electronic"><year>2023</year></pub-date>
<pub-date date-type="pub" publication-format="electronic"><day>31</day><month>10</month><year>2023</year></pub-date>
<volume>120</volume>
<issue>11</issue>
<fpage>2517</fpage>
<lpage>2529</lpage>
<history>
<date date-type="received"><day>06</day><month>6</month><year>2023</year></date>
<date date-type="accepted"><day>01</day><month>8</month><year>2023</year></date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2023 Cheng et al.</copyright-statement>
<copyright-year>2023</copyright-year>
<copyright-holder>Cheng et al.</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_EE_42633.pdf"></self-uri>
<abstract>
<p>At present, the proportion of new energy in the power grid is increasing, and the random fluctuations in power output increase the risk of cascading failures in the power grid. In this paper, we propose a method for identifying high-risk scenarios of interlocking faults in new energy power grids based on a deep embedding clustering (DEC) algorithm and apply it in a risk assessment of cascading failures in different operating scenarios for new energy power grids. First, considering the real-time operation status and system structure of new energy power grids, the scenario cascading failure risk indicator is established. Based on this indicator, the risk of cascading failure is calculated for the scenario set, the scenarios are clustered based on the DEC algorithm, and the scenarios with the highest indicators are selected as the significant risk scenario set. The results of simulations with an example power grid show that our method can effectively identify scenarios with a high risk of cascading failures from a large number of scenarios.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>New energy power system</kwd>
<kwd>deep embedding clustering algorithms</kwd>
<kwd>cascading failures</kwd>
</kwd-group>
<funding-group>
<award-group id="awg1">
<funding-source>State Grid Limited Science and Technology Project of China</funding-source>
<award-id>SGSXDK00DJJS2200144</award-id>
</award-group>
</funding-group>
</article-meta>
</front>
<body>
<sec id="s1"><label>1</label><title>Introduction</title>
<p>Over the past few years, there has been a significant surge in the development of modern power systems characterized by ultrahigh voltage, long-distance transmission capabilities, large capacities, and extensive interconnections. However, along with these advancements comes the risk of cascading failures, where even minor faults in local power grids can propagate to neighboring regional grids, resulting in widespread outage incidents. Numerous large-scale outages in various countries have demonstrated that cascading failures are often the root cause of such accidents [<xref ref-type="bibr" rid="ref-1">1</xref>]. Hence, it has become essential to assess the risk of cascading failures in power grids.</p>
<p>The most common method for risk assessment of new power systems is the Monte Carlo method, mostly based on the traditional sequential Monte Carlo and nonsequential Monte Carlo methods [<xref ref-type="bibr" rid="ref-2">2</xref>,<xref ref-type="bibr" rid="ref-3">3</xref>]. However, this method requires a large computational volume to obtain accurate values and tends to ignore some special cases. In addition, there are some methods based on power flow calculation in the risk assessment of cascading failures in new power systems; the reference [<xref ref-type="bibr" rid="ref-4">4</xref>] used the alternating current power flow calculation method, which determines the risk after wind power access from multiple directions. Reference [<xref ref-type="bibr" rid="ref-5">5</xref>] used the stochastic power flow calculation method to calculate the distribution of each cascading failure search index. These studies involve power flow calculation, and there are often assumptions of the model that are not consistent with actual scenarios, such as the assumption that the unbalanced power of the whole network is borne by the balancing nodes. Reference [<xref ref-type="bibr" rid="ref-6">6</xref>] introduced the Thiel entropy index to assess the vulnerability of each branch in the power system and quantify the impact on the safety of grid operation after a branch fault is withdrawn from operation; Reference [<xref ref-type="bibr" rid="ref-7">7</xref>] proposed a fast screening method for cascading failures considering source-load uncertainty based on the random response surface method and Deep Forest while taking into account the speed and accuracy of stochastic power flow calculation; these methods have achieved some results in cascading failure screening.</p>
<p>With the continuous development of science and technology, monitoring and control systems using the supervisory control and data acquisition (SCADA) architecture have become able to record complex and diversified data information in the power system and to perform some tasks remotely. The large amount and diversity of data allow the staff to analyze the power system in detail and identify the locations and types of faults in the power grid faster and more accurately. Among them, scenario analysis has been widely used in power systems [<xref ref-type="bibr" rid="ref-8">8</xref>&#x2013;<xref ref-type="bibr" rid="ref-11">11</xref>] to analyze data with satisfactory results. Many data analysis-based approaches to power grid risk assessment have achieved some results. In reference [<xref ref-type="bibr" rid="ref-12">12</xref>], the stochastic current calculation method was rederived by taking into account the role of system frequency regulation, drawing upon the idea of the Oxla method. In reference [<xref ref-type="bibr" rid="ref-13">13</xref>], the main causes of four types of interlocking faults that occur in a high percentage of new energy power systems and three key techniques for searching interlocking fault accident cascades were refined. Reference [<xref ref-type="bibr" rid="ref-14">14</xref>] analyzed the fault interaction dynamics between source, grid and load and established centralized and distributed new energy protection logic and risk indicators, respectively.</p>
<p>However, considering the randomness and uncertainty of renewable energy, cascading failure characteristics in traditional grids may differ from those in renewable energy grids. When assessing the risk of cascading failures in renewable energy grids, evaluating indicators based solely on the transfer of power flows is insufficient to represent the cascading failure risk in such operational scenarios. Meanwhile, most of the methods in the above literature are based on traditional algorithms, and with the expansion in grid scale and increase in structural complexity, the complexity of scenarios is also increasing, and traditional algorithms are becoming insufficient. Deep learning algorithms are more capable of learning data features than traditional algorithms and are more suitable for solving complex scenario identification problems.</p>
<p>In this paper, we construct a method of identifying scenarios with a high risk of cascading failure in a new energy grid based on a deep embedding clustering (DEC) algorithm combined with a scenario analysis approach. The contributions of this paper are summarized as follows:
<list list-type="order">
<list-item><p>A new energy grid cascading failure risk index is constructed, which combines line power flow entropy and voltage offset entropy to reflect the risk level of cascading failures in new energy grids and is applicable to the operation scenarios of power systems containing new energy.</p></list-item>
<list-item><p>The proposed method of identifying scenarios with a high risk of cascading failures based on the DEC algorithm classifies operational scenarios according to the similarity of risk indicators. It generates a set of significant risk scenarios with a high probability of cascading failures, confirms the effectiveness of the model for high-risk scenario identification, and reduces the time required to conduct cascading failure simulation studies in different scenarios.</p></list-item>
</list></p>
</sec>
<sec id="s2"><label>2</label><title>Scenario Cascading Failure Risk Indicators</title>
<sec id="s2_1"><label>2.1</label><title>Traditional Grid Interlocking Fault Power Flow Entropy</title>
<p>The main factor of cascading failures in conventional power grids is active power flow shifting, where power flow in many lines exceeds their normal operating range, the probability of failure increases, and minor disturbances may lead to the tripping of overloaded lines. Entropy is a measure of the degree of system chaos. The power system is a nonlinear complex energy balance system, and the power flow entropy reflects the degree of uniformity of the distribution of power flow in lines [<xref ref-type="bibr" rid="ref-15">15</xref>].
<disp-formula id="eqn-1"><label>(1)</label><mml:math id="mml-eqn-1" display="block"><mml:msub><mml:mi>&#x03B7;</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:msub><mml:mi mathvariant="bold-italic">P</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi mathvariant="bold-italic">P</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi><mml:mo movablelimits="true" form="prefix">max</mml:mo></mml:mrow></mml:msub></mml:mfrac></mml:math></disp-formula></p>
<p>Denote the line load factor <inline-formula id="ieqn-1"><mml:math id="mml-ieqn-1"><mml:msub><mml:mi>&#x03B7;</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. The calculation formula is shown in <xref ref-type="disp-formula" rid="eqn-1">Eq. (1)</xref>, where <inline-formula id="ieqn-2"><mml:math id="mml-ieqn-2"><mml:msub><mml:mi mathvariant="bold-italic">P</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the actual active power magnitude of the line operation and <inline-formula id="ieqn-3"><mml:math id="mml-ieqn-3"><mml:msub><mml:mi mathvariant="bold-italic">P</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi><mml:mo movablelimits="true" form="prefix">max</mml:mo></mml:mrow></mml:msub></mml:math></inline-formula> is the maximum active transmission capacity of line <italic>i</italic>.</p>
<p>Define the line load factor equivalence sequence <inline-formula id="ieqn-4"><mml:math id="mml-ieqn-4"><mml:mi mathvariant="bold-italic">H</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">H</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">H</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">n</mml:mi></mml:mrow></mml:msub><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula>. Let the number of lines whose load factor belongs to the interval <inline-formula id="ieqn-5"><mml:math id="mml-ieqn-5"><mml:mo stretchy="false">[</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">H</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">k</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">H</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">k</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> be <inline-formula id="ieqn-6"><mml:math id="mml-ieqn-6"><mml:msub><mml:mi mathvariant="bold-italic">M</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">k</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. <xref ref-type="disp-formula" rid="eqn-2">Eq. (2)</xref> thus represents the proportion of lines whose load factors are in this interval.
<disp-formula id="eqn-2"><label>(2)</label><mml:math id="mml-eqn-2" display="block"><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">k</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:msub><mml:mi mathvariant="bold-italic">M</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">k</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:munderover><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">k</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">n</mml:mi></mml:mrow></mml:munderover><mml:mo>&#x2061;</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">M</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">k</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac></mml:math></disp-formula></p>
<p>Then, the line power flow entropy calculation formula considering cascading failures is shown in <xref ref-type="disp-formula" rid="eqn-3">Eq. (3)</xref>.
<disp-formula id="eqn-3"><label>(3)</label><mml:math id="mml-eqn-3" display="block"><mml:mi mathvariant="bold-italic">D</mml:mi><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:munderover><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:munderover><mml:mo>&#x2061;</mml:mo><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">k</mml:mi></mml:mrow></mml:msub><mml:mi>ln</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">H</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">k</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>As seen from <xref ref-type="disp-formula" rid="eqn-3">Eq. (3)</xref>, the higher the percentage of heavily loaded lines, the higher the line load factor, the higher the power flow entropy value, and the greater the risk of cascading failures.</p>
</sec>
<sec id="s2_2"><label>2.2</label><title>New Energy Grid Cascading Failure Voltage Offset Entropy</title>
<p>After the new energy is connected to the grid, the mechanism and mode of cascading failure are changed, the uncertainty of the new energy has an impact on the evolution path of cascading failures in the grid, and the interaction between the new energy and grid failures drives the evolution of cascading failures. The main influencing factors of cascading failures in new energy grids include not only active power flow transfer but also the voltage offset at each node in the system. After the initial fault, the high- and low-voltage ride-through capability of the wind turbine determines whether it goes off-grid due to the postfault system state, resulting in cascading failure and system collapse. The voltage offset entropy is intuitively defined based on the power flow entropy to measure the voltage offset degree at the wind turbine generator terminal and to assess the risk of wind turbines going off-grid.
<disp-formula id="eqn-4"><label>(4)</label><mml:math id="mml-eqn-4" display="block"><mml:msub><mml:mi>&#x03B4;</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>|</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mfrac><mml:msub><mml:mi mathvariant="bold-italic">U</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">g</mml:mi><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi mathvariant="bold-italic">U</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">g</mml:mi><mml:mi mathvariant="bold-italic">N</mml:mi></mml:mrow></mml:msub></mml:mfrac><mml:mo>|</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>The voltage offset rate is calculated as in <xref ref-type="disp-formula" rid="eqn-4">Eq. (4)</xref>, where <inline-formula id="ieqn-7"><mml:math id="mml-ieqn-7"><mml:msub><mml:mi mathvariant="bold-italic">U</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">g</mml:mi><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the voltage at the machine end of the ith wind turbine, and <inline-formula id="ieqn-8"><mml:math id="mml-ieqn-8"><mml:msub><mml:mi mathvariant="bold-italic">U</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">g</mml:mi><mml:mi mathvariant="bold-italic">N</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the rated voltage at the machine end. Let the wind turbine allowable voltage offset range be <inline-formula id="ieqn-9"><mml:math id="mml-ieqn-9"><mml:mrow><mml:mo>[</mml:mo><mml:msub><mml:mi>&#x03B4;</mml:mi><mml:mrow><mml:mo movablelimits="true" form="prefix">min</mml:mo></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>&#x03B4;</mml:mi><mml:mrow><mml:mo movablelimits="true" form="prefix">max</mml:mo></mml:mrow></mml:msub><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula>; if the wind turbine voltage is not in this range, it is off-grid. Let the installed capacity of the kth wind turbine be <inline-formula id="ieqn-10"><mml:math id="mml-ieqn-10"><mml:msub><mml:mi mathvariant="bold-italic">G</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">k</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, the number of wind turbines off-grid be <inline-formula id="ieqn-11"><mml:math id="mml-ieqn-11"><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">k</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, and the total installed capacity of the wind turbine be <inline-formula id="ieqn-12"><mml:math id="mml-ieqn-12"><mml:mi mathvariant="bold-italic">G</mml:mi></mml:math></inline-formula>. Then, <xref ref-type="disp-formula" rid="eqn-5">Eq. (5)</xref> gives the proportion of off-grid wind turbine capacity to the total capacity of the wind turbine.</p>
<p><disp-formula id="eqn-5"><label>(5)</label><mml:math id="mml-eqn-5" display="block"><mml:mi>&#x03B1;</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mo>&#x2211;</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">G</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">k</mml:mi></mml:mrow></mml:msub><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">k</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mi mathvariant="bold-italic">G</mml:mi></mml:mfrac></mml:math></disp-formula></p>
<p>The formula for calculating the voltage offset entropy considering cascading failures is shown in <xref ref-type="disp-formula" rid="eqn-6">Eq. (6)</xref>.
<disp-formula id="eqn-6"><label>(6)</label><mml:math id="mml-eqn-6" display="block"><mml:mi mathvariant="bold-italic">W</mml:mi><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03B1;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:munderover><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">n</mml:mi></mml:mrow></mml:munderover><mml:mo>&#x2061;</mml:mo><mml:msub><mml:mi>&#x03B4;</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow></mml:msub><mml:mi>ln</mml:mi><mml:mo>&#x2061;</mml:mo><mml:msub><mml:mi>&#x03B4;</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow></mml:msub></mml:math></disp-formula></p>
<p>The higher the percentage of off-grid wind turbine capacity, the higher the voltage offset rate at the wind turbine end, the greater the voltage offset entropy, and the greater the risk of cascading failures in the new energy grid.</p>
</sec>
<sec id="s2_3"><label>2.3</label><title>Integrated Cascading Failure Risk Indicators</title>
<p>The new energy grid cascading failure risk analysis and evaluation should take into account the active power shift and voltage offset. We first normalize these two datasets using maximum-minimum normalization, and then transform the above active power flow entropy in lines and voltage offset entropy into a comprehensive entropy, which acts as a cascading failure risk indicator, calculated as follows:
<disp-formula id="eqn-7"><label>(7)</label><mml:math id="mml-eqn-7" display="block"><mml:mi mathvariant="bold-italic">A</mml:mi><mml:mo>=</mml:mo><mml:msub><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mi mathvariant="bold-italic">D</mml:mi><mml:mo>+</mml:mo><mml:msub><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mi mathvariant="bold-italic">W</mml:mi></mml:math></disp-formula>
<disp-formula id="eqn-8"><label>(8)</label><mml:math id="mml-eqn-8" display="block"><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left left" rowspacing=".2em" columnspacing="1em" displaystyle="false"><mml:mtr><mml:mtd><mml:msub><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mi mathvariant="bold-italic">D</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">D</mml:mi><mml:mo>+</mml:mo><mml:mi mathvariant="bold-italic">W</mml:mi></mml:mrow></mml:mfrac></mml:mstyle></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mi mathvariant="bold-italic">W</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">D</mml:mi><mml:mo>+</mml:mo><mml:mi mathvariant="bold-italic">W</mml:mi></mml:mrow></mml:mfrac></mml:mstyle></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>where different weights <inline-formula id="ieqn-13"><mml:math id="mml-ieqn-13"><mml:msub><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-14"><mml:math id="mml-ieqn-14"><mml:msub><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> are set for the two entropies, the indicator with the larger share of entropy has a greater impact on the cascading failure of the power system. The cascading failure risk indicators take into account the line load situation and the wind turbine off-grid situation, and the risk indicators of different scenarios are calculated to provide the data basis for the clustering algorithm.</p>
</sec>
</sec>
<sec id="s3"><label>3</label><title>Deep Embedding Clustering Algorithm</title>
<sec id="s3_1"><label>3.1</label><title>Autoencoder (AE)</title>
<p>An autoencoder (AE) is a deep neural network that mainly consists of an encoder and a decoder that enable unsupervised data dimensional compression and data feature representation [<xref ref-type="bibr" rid="ref-16">16</xref>]. Its structure diagram is shown in <xref ref-type="fig" rid="fig-1">Fig. 1</xref>.</p>
<fig id="fig-1"><label>Figure 1</label><caption><title>Autoencoder diagram</title></caption><graphic mimetype="image" mime-subtype="tif" xlink:href="EE_42633-fig-1.tif"/></fig>
<p>The encoder <inline-formula id="ieqn-15"><mml:math id="mml-ieqn-15"><mml:mi mathvariant="bold-italic">h</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> encodes the input sample <inline-formula id="ieqn-16"><mml:math id="mml-ieqn-16"><mml:msub><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> as <inline-formula id="ieqn-17"><mml:math id="mml-ieqn-17"><mml:msub><mml:mi mathvariant="bold-italic">z</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, and the decoder decodes <inline-formula id="ieqn-18"><mml:math id="mml-ieqn-18"><mml:msub><mml:mi mathvariant="bold-italic">z</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> as <inline-formula id="ieqn-19"><mml:math id="mml-ieqn-19"><mml:msubsup><mml:mrow><mml:mi mathvariant="bold-italic">x</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow><mml:mrow><mml:msup><mml:mi></mml:mi><mml:mrow><mml:msup><mml:mi></mml:mi><mml:mo mathvariant="bold">&#x2032;</mml:mo></mml:msup></mml:mrow></mml:msup></mml:mrow></mml:msubsup></mml:math></inline-formula>. The network goal is to make the output <inline-formula id="ieqn-20"><mml:math id="mml-ieqn-20"><mml:msubsup><mml:mrow><mml:mi mathvariant="bold-italic">x</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow><mml:mrow><mml:msup><mml:mi></mml:mi><mml:mrow><mml:msup><mml:mi></mml:mi><mml:mo mathvariant="bold">&#x2032;</mml:mo></mml:msup></mml:mrow></mml:msup></mml:mrow></mml:msubsup></mml:math></inline-formula> as similar as possible to the input <inline-formula id="ieqn-21"><mml:math id="mml-ieqn-21"><mml:msub><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. The AE learns the low-dimensional embedding representation of the input data and reduces the noise and redundancy in the data, which improves the clustering effect and the speed of the clustering algorithm [<xref ref-type="bibr" rid="ref-17">17</xref>].</p>
</sec>
<sec id="s3_2"><label>3.2</label><title>Autoencoder-Based Deep Clustering Algorithm</title>
<p>The DEC algorithm is based on a deep learning AE and K-means clustering algorithm, which uses the encoding layer of the AE to generate an embedding representation of the data and then uses the K-means algorithm to cluster the data in the embedding space.</p>
<p>The DEC algorithm converts the clustering metric into a probability value by referring to the t-distribution in t-SNE and calculates the clustering metric as follows:</p>
<p><disp-formula id="eqn-9"><label>(9)</label><mml:math id="mml-eqn-9" display="block"><mml:msub><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi><mml:mi mathvariant="bold-italic">j</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:mo>&#x2225;</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">z</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">j</mml:mi></mml:mrow></mml:msub><mml:msup><mml:mo>&#x2225;</mml:mo><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mi>&#x03B1;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mfrac><mml:mrow><mml:mi>&#x03B1;</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mn>2</mml:mn></mml:mfrac></mml:mrow></mml:msup><mml:mrow><mml:munder><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:msup><mml:mi mathvariant="bold-italic">j</mml:mi><mml:mrow><mml:msup><mml:mi></mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:msup></mml:mrow></mml:munder><mml:mo>&#x2061;</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:mo>&#x2225;</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">z</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:msup><mml:mi mathvariant="bold-italic">j</mml:mi><mml:mrow><mml:msup><mml:mi></mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:msup></mml:mrow></mml:msub><mml:msup><mml:mo>&#x2225;</mml:mo><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mi>&#x03B1;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mfrac><mml:mrow><mml:mi>&#x03B1;</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mn>2</mml:mn></mml:mfrac></mml:mrow></mml:msup></mml:mrow></mml:mfrac></mml:math></disp-formula>where <inline-formula id="ieqn-22"><mml:math id="mml-ieqn-22"><mml:msub><mml:mi mathvariant="bold-italic">z</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the representation space of the <italic>ith</italic> sample after encoder learning, <inline-formula id="ieqn-23"><mml:math id="mml-ieqn-23"><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">j</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the center of the jth class of clusters, <inline-formula id="ieqn-24"><mml:math id="mml-ieqn-24"><mml:mi>&#x03B1;</mml:mi></mml:math></inline-formula> is the number of degrees of freedom of the Student-t distribution, and <inline-formula id="ieqn-25"><mml:math id="mml-ieqn-25"><mml:msub><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi><mml:mi mathvariant="bold-italic">j</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the probability that sample <italic>i</italic> is assigned to cluster <italic>j</italic>.</p>
<p>In the DEC algorithm, an auxiliary distribution is defined, and the KL divergence is used to measure the difference two distributions and construct the loss function. The auxiliary distribution and the loss function L are calculated as follows:
<disp-formula id="eqn-10"><label>(10)</label><mml:math id="mml-eqn-10" display="block"><mml:msub><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi><mml:mi mathvariant="bold-italic">j</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:msubsup><mml:mrow><mml:mi mathvariant="bold-italic">q</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi><mml:mi mathvariant="bold-italic">j</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:munder><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow></mml:munder><mml:mo>&#x2061;</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi><mml:mi mathvariant="bold-italic">j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:munder><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">j</mml:mi></mml:mrow></mml:munder><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msubsup><mml:mrow><mml:mi mathvariant="bold-italic">q</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi><mml:mi mathvariant="bold-italic">j</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:munder><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow></mml:munder><mml:mo>&#x2061;</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi><mml:mi mathvariant="bold-italic">j</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mfrac></mml:math></disp-formula>
<disp-formula id="eqn-11"><label>(11)</label><mml:math id="mml-eqn-11" display="block"><mml:mi mathvariant="bold-italic">L</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mi mathvariant="bold-italic">K</mml:mi><mml:mi mathvariant="bold-italic">L</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">P</mml:mi><mml:mo>&#x2225;</mml:mo><mml:mi mathvariant="bold-italic">Q</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:munder><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow></mml:munder><mml:mo>&#x2061;</mml:mo><mml:munder><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">j</mml:mi></mml:mrow></mml:munder><mml:mo>&#x2061;</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi><mml:mi mathvariant="bold-italic">j</mml:mi></mml:mrow></mml:msub><mml:mi>log</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mfrac><mml:msub><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi><mml:mi mathvariant="bold-italic">j</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi><mml:mi mathvariant="bold-italic">j</mml:mi></mml:mrow></mml:msub></mml:mfrac></mml:math></disp-formula></p>
<p>The structure diagram of the DEC algorithm is shown in <xref ref-type="fig" rid="fig-2">Fig. 2</xref>. The general DEC algorithm consists of two parts: the first consists of pretraining the AE, optimizing it and reducing the reconstruction loss, while the second consists of taking the encoder part of the AE model and putting it into the clustering layer to perform clustering training. During the clustering training, the encoder is optimally trained using the clustering loss, the reconstruction loss, and the final output clustering results.</p>
<fig id="fig-2"><label>Figure 2</label><caption><title>Deep embedding clustering algorithm structure diagram</title></caption><graphic mimetype="image" mime-subtype="tif" xlink:href="EE_42633-fig-2.tif"/></fig>
<p>The advantage of the DEC algorithm over traditional clustering algorithms is that the use of AEs allows it to retain the high-dimensional data better, which not only reduces the influence of invalid features on the clustering process but also significantly improves the clustering speed [<xref ref-type="bibr" rid="ref-18">18</xref>]. The definition of the center-of-mass-based probability distribution and the use of the KL divergence as the clustering loss function in the algorithm allow it to achieve better clustering results in applications.</p>
</sec>
</sec>
<sec id="s4"><label>4</label><title>Scene Recognition Model Based on a Deep Embedding Clustering Algorithm</title>
<sec id="s4_1"><label>4.1</label><title>Clustering Criteria and Evaluation Index</title>
<p>The operating states of electrical equipment in different operating scenarios of the power grid are different, and the risk of cascading failures in a given scenario also differs. In this paper, we construct different operation scenarios of a power system by adjusting the system states, such as the grid load level, new energy output size, and grid topology.</p>
<p>By calculating the constructed cascading failure risk index of the new energy grid to as the characteristic index to describe the cascading failure risk of the scenarios and by using the DEC algorithm to cluster different operating scenarios, the grid abnormal operation scenarios with the highest cascading failure risk after clustering are analyzed as the significant scenario set. Thus, we identify high-risk scenarios of cascading failures.</p>
<p>In this paper, the standard mutual information index (NMI) and accuracy rate (ACC) are used as evaluation indices to evaluate the performance of the scene recognition model. NMI is based on the idea of information entropy, which is used to measure the degree of coincidence of two data distributions, and is calculated as follows:
<disp-formula id="eqn-12"><label>(12)</label><mml:math id="mml-eqn-12" display="block"><mml:mrow><mml:mi mathvariant="bold-italic">N</mml:mi><mml:mi mathvariant="bold-italic">M</mml:mi><mml:mi mathvariant="bold-italic">I</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mn>2</mml:mn><mml:mfrac><mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">M</mml:mi><mml:mi mathvariant="bold-italic">I</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">H</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mi mathvariant="bold-italic">H</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mfrac></mml:math></disp-formula>where <inline-formula id="ieqn-26"><mml:math id="mml-ieqn-26"><mml:mrow><mml:mi mathvariant="bold-italic">M</mml:mi><mml:mi mathvariant="bold-italic">I</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> is the degree of mutual information between the true and predicted values, and <inline-formula id="ieqn-27"><mml:math id="mml-ieqn-27"><mml:mi mathvariant="bold-italic">H</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-28"><mml:math id="mml-ieqn-28"><mml:mi mathvariant="bold-italic">H</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> denote the true and predicted entropy values, respectively. The NMI ranges from 0 to 1, with higher values representing better discrimination.</p>
<p>The accuracy rate enables a more intuitive assessment of model performance and demonstrates the clustering effect and is calculated as follows:
<disp-formula id="eqn-13"><label>(13)</label><mml:math id="mml-eqn-13" display="block"><mml:mrow><mml:mi mathvariant="bold-italic">A</mml:mi><mml:mi mathvariant="bold-italic">C</mml:mi><mml:mi mathvariant="bold-italic">C</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:munderover><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">n</mml:mi></mml:mrow></mml:munderover><mml:mo>&#x2061;</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">y</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mi mathvariant="bold-italic">N</mml:mi></mml:mfrac><mml:mo>=</mml:mo><mml:mrow><mml:mi mathvariant="bold-italic">m</mml:mi><mml:mi mathvariant="bold-italic">a</mml:mi><mml:mi mathvariant="bold-italic">p</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p><p>where <inline-formula id="ieqn-29"><mml:math id="mml-ieqn-29"><mml:mi mathvariant="bold-italic">N</mml:mi></mml:math></inline-formula> is the number of samples, <inline-formula id="ieqn-30"><mml:math id="mml-ieqn-30"><mml:msub><mml:mi mathvariant="bold-italic">y</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the true label, <inline-formula id="ieqn-31"><mml:math id="mml-ieqn-31"><mml:msub><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the label generated by clustering, and map redistributes clustered labels, which is generally performed via the Hungarian algorithm.</p>
</sec>
<sec id="s4_2"><label>4.2</label><title>Model Identification Process</title>
<p>The input of the identification model of high-risk scenarios of cascading failures in new energy grids based on the DEC algorithm is the integrated cascading failure risk indicators of different operation scenarios. The scenarios are clustered based on the risk indicators. The output is the set of significant risk scenarios with high-risk indicators and the general risk scenario set. The model identification process is as follows:
<list list-type="order">
<list-item><p>First, the grid parameters are adjusted to obtain different grid operation scenarios, and the risk values under each scenario are calculated based on the constructed new energy grid cascading failure risk index to obtain the risk scenario sample set.</p></list-item>
<list-item><p>A scene recognition model based on the DEC algorithm is constructed, and the risk scenario sample set is divided into a training set, test set, and validation set according to a ratio of 8:1:1. The training set is used to train the model, and the test set and validation set are used to evaluate the model recognition effect.</p></list-item>
<list-item><p>After the model is trained, the set of significant risk scenarios and the set of general risk scenarios are generated, and the set of significant risk scenarios is analyzed.</p></list-item>
<list-item><p>Cascading failure simulation is performed for scenarios with significant risk to verify the effectiveness of the model for identifying scenarios with a high risk of cascading failures.</p></list-item>
</list></p>
<p>The flow chart of the identification process is shown in <xref ref-type="fig" rid="fig-3">Fig. 3</xref>.</p>
<fig id="fig-3"><label>Figure 3</label><caption><title>Risk scenario identification flowchart</title></caption><graphic mimetype="image" mime-subtype="tif" xlink:href="EE_42633-fig-3.tif"/></fig>
</sec>
</sec>
<sec id="s5"><label>5</label><title>Example Analysis</title>
<p>In this paper, the IEEE39-node system is used as an example, and four of the generators are changed into wind turbines, which are transformed into a new energy grid, as shown in <xref ref-type="fig" rid="fig-4">Fig. 4</xref>. The synchronous generators G 10, G 02, G 04, G 09 connected to nodes 30, 31, 33, 38 are turned into wind farms with the same output and a new energy grid model with a new energy power grid connection ratio of 43.27&#x0025; is obtained. The power output and the connected busbars of the replacement generators are shown in <xref ref-type="table" rid="table-1">Table 1</xref>. The DEC algorithm is written in the Python language, and parameters such as unit output and load size are randomly assigned to obtain the scene sample set. The simulation is verified using Powerfactory/DIgSILENT simulation software.</p>
<fig id="fig-4"><label>Figure 4</label><caption><title>IEEE39-node new energy grid wiring diagram</title></caption><graphic mimetype="image" mime-subtype="tif" xlink:href="EE_42633-fig-4.tif"/></fig><table-wrap id="table-1"><label>Table 1</label><caption><title>Information about the replacement generators</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Replacement generators</th>
<th align="left">Connected busbar</th>
<th align="left">Active power output/MW</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">G 02</td>
<td align="left">Bus 31</td>
<td align="left">520.0</td>
</tr>
<tr>
<td align="left">G 04</td>
<td align="left">Bus 33</td>
<td align="left">632.0</td>
</tr>
<tr>
<td align="left">G 09</td>
<td align="left">Bus 38</td>
<td align="left">830.0</td>
</tr>
<tr>
<td align="left">G 10</td>
<td align="left">Bus 30</td>
<td align="left">250.0</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>In the simulation software, this paper randomly sets the initial fault N&#x2212;2 within the model. Based on the line overload situation, the next trip line is set, and the line outage probability is as follows:
<disp-formula id="eqn-14"><label>(14)</label><mml:math id="mml-eqn-14" display="block"><mml:mi mathvariant="bold-italic">P</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left left" rowspacing=".2em" columnspacing="1em" displaystyle="false"><mml:mtr><mml:mtd><mml:msub><mml:mi mathvariant="bold-italic">P</mml:mi><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mspace width="thinmathspace" /><mml:mi>&#x03B7;</mml:mi><mml:mo>&#x003C;</mml:mo><mml:mn>0.8</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mi mathvariant="bold-italic">P</mml:mi><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03B7;</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>0.8</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x00D7;</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mrow><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">P</mml:mi><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mn>0.4</mml:mn></mml:mfrac></mml:mstyle><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mspace width="thinmathspace" /><mml:mn>0.8</mml:mn><mml:mo>&#x2264;</mml:mo><mml:mi>&#x03B7;</mml:mi><mml:mo>&#x2264;</mml:mo><mml:mn>1.2</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mspace width="thinmathspace" /><mml:mi>&#x03B7;</mml:mi><mml:mo>&#x003E;</mml:mo><mml:mn>1.2</mml:mn></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>Taking <inline-formula id="ieqn-32"><mml:math id="mml-ieqn-32"><mml:msub><mml:mi mathvariant="bold-italic">P</mml:mi><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula>&#x2009;&#x003D;&#x2009;0.01, the line with a load factor <inline-formula id="ieqn-33"><mml:math id="mml-ieqn-33"><mml:mi>&#x03B7;</mml:mi></mml:math></inline-formula> greater than 1.2 is directly used as the next trip line, the simulation is stopped when the number of tripped lines is greater than 4, and the wind turbine off-grid situation is observed.</p>
<p>In this paper, a total of 200 operation scenarios are constructed, the risk indicators of all scenarios are calculated, the scenarios are clustered based on the risk indicators, and the cascading failure probabilities of the scenarios are output after 1000 random cascading failure simulations. The specific probability distribution is shown in <xref ref-type="table" rid="table-2">Table 2</xref>.</p>
<table-wrap id="table-2"><label>Table 2</label><caption><title>Operation scenario cascading failure probability distribution</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Cascading failures probability interval</th>
<th align="left">Number</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">[0, 0.01]</td>
<td align="left">183</td>
</tr>
<tr>
<td align="left">[0.01, 0.1]</td>
<td align="left">7</td>
</tr>
<tr>
<td align="left">[0.1, 0.2]</td>
<td align="left">2</td>
</tr>
<tr>
<td align="left">[0.2, 0.3]</td>
<td align="left">1</td>
</tr>
<tr>
<td align="left">[0.3, 0.4]</td>
<td align="left">3</td>
</tr>
<tr>
<td align="left">[0.4, 0.5]</td>
<td align="left">1</td>
</tr>
<tr>
<td align="left">[0.5, 0.6]</td>
<td align="left">1</td>
</tr>
<tr>
<td align="left">[0.6, 0.7]</td>
<td align="left">1</td>
</tr>
<tr>
<td align="left">[0.7, 0.8]</td>
<td align="left">1</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Based on the DEC algorithm, we set the number of clusters to 2 and output the significant scenario set of the model, whose specific information is shown in <xref ref-type="table" rid="table-2">Table 2</xref>.</p>

<p>As seen from <xref ref-type="table" rid="table-3">Table 3</xref>, the size of the risk indicators does not correspond exactly to the size of the cascading failure probability, and clustering can identify some of the missed high-risk scenarios. <xref ref-type="fig" rid="fig-5">Fig. 5</xref> shows the cascading failure probability distribution of the significant risk scenario set and the general risk scenarios, where the vertical coordinate is the cascading failure probability on a logarithmic scale and the horizontal coordinate is the scenario number. The probability of cascading failure is higher in the significant risk scenario set than in the general scenarios. All scenarios with cascading failure probabilities higher than 0.1 are identified, and overall, the model has a good recognition effect.</p>
<table-wrap id="table-3"><label>Table 3</label><caption><title>Significant scenario set information</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Serial number</th>
<th align="left">Scene number</th>
<th align="left">Risk indicators</th>
<th align="left">Cascading failure rate</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">1</td>
<td align="left">15</td>
<td align="left">0.612</td>
<td align="left">0.469</td>
</tr>
<tr>
<td align="left">2</td>
<td align="left">27</td>
<td align="left">0.269</td>
<td align="left">0.145</td>
</tr>
<tr>
<td align="left">3</td>
<td align="left">31</td>
<td align="left">0.017</td>
<td align="left">0.008</td>
</tr>
<tr>
<td align="left">4</td>
<td align="left">49</td>
<td align="left">0.303</td>
<td align="left">0.213</td>
</tr>
<tr>
<td align="left">5</td>
<td align="left">64</td>
<td align="left">0.211</td>
<td align="left">0.361</td>
</tr>
<tr>
<td align="left">6</td>
<td align="left">77</td>
<td align="left">0.385</td>
<td align="left">0.332</td>
</tr>
<tr>
<td align="left">7</td>
<td align="left">86</td>
<td align="left">0.817</td>
<td align="left">0.694</td>
</tr>
<tr>
<td align="left">8</td>
<td align="left">99</td>
<td align="left">0.278</td>
<td align="left">0.152</td>
</tr>
<tr>
<td align="left">9</td>
<td align="left">106</td>
<td align="left">0.849</td>
<td align="left">0.715</td>
</tr>
<tr>
<td align="left">10</td>
<td align="left">111</td>
<td align="left">0.457</td>
<td align="left">0.398</td>
</tr>
<tr>
<td align="left">11</td>
<td align="left">126</td>
<td align="left">0.027</td>
<td align="left">0.012</td>
</tr>
<tr>
<td align="left">12</td>
<td align="left">128</td>
<td align="left">0.464</td>
<td align="left">0.528</td>
</tr>
<tr>
<td align="left">13</td>
<td align="left">151</td>
<td align="left">0.011</td>
<td align="left">0.005</td>
</tr>
<tr>
<td align="left">14</td>
<td align="left">187</td>
<td align="left">0.010</td>
<td align="left">0.006</td>
</tr>
<tr>
<td align="left">15</td>
<td align="left">192</td>
<td align="left">0.221</td>
<td align="left">0.053</td>
</tr>
</tbody>
</table>
</table-wrap><fig id="fig-5"><label>Figure 5</label><caption><title>Probability of failure in general and significant risk scenarios</title></caption><graphic mimetype="image" mime-subtype="tif" xlink:href="EE_42633-fig-5.tif"/></fig>
<p><xref ref-type="fig" rid="fig-6">Fig. 6</xref> shows the change in the accuracy rate and loss during the model training process, and it can be seen that as the number of training rounds increases, the loss value keeps decreasing, the accuracy rate gradually increases, and the recognition effect becomes better.</p>
<fig id="fig-6"><label>Figure 6</label><caption><title>Accuracy and loss value changes during model training</title></caption><graphic mimetype="image" mime-subtype="tif" xlink:href="EE_42633-fig-6.tif"/></fig>
<p>As seen from <xref ref-type="table" rid="table-4">Table 4</xref> and <xref ref-type="fig" rid="fig-7">Fig. 7</xref>, the DEC algorithm works better than the traditional K-means clustering algorithm, and the NMI values and accuracy rates of the DEC algorithm are significantly better. The DEC algorithm to cluster high-risk scenes more efficiently identifies high-risk scenes.</p>
<table-wrap id="table-4"><label>Table 4</label><caption><title>NMI and accuracy results of different clustering algorithms</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Algorithm</th>
<th align="left">NMI value</th>
<th align="left">ACC value</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">K-means algorithm</td>
<td align="left">0.678</td>
<td align="left">0.611</td>
</tr>
<tr>
<td align="left">K-medioids algorithm</td>
<td align="left">0.736</td>
<td align="left">0.717</td>
</tr>
<tr>
<td align="left">DEC algorithm</td>
<td align="left">0.812</td>
<td align="left">0.806</td>
</tr>
</tbody>
</table>
</table-wrap><fig id="fig-7"><label>Figure 7</label><caption><title>NMI and accuracy results of different clustering algorithms</title></caption><graphic mimetype="image" mime-subtype="tif" xlink:href="EE_42633-fig-7.tif"/></fig>
</sec>
<sec id="s6"><label>6</label><title>Conclusions</title>
<p>This paper proposes a method for identifying scenarios with a high risk of cascading failures in new energy grids based on a DEC algorithm. A comprehensive risk indicator combining power flow entropy and voltage deviation entropy is established, and a clustering algorithm is employed to assess the cascading failure risk in different operating scenarios of the new energy grids. The encoder-decoder automatic coding is used for pretraining, and the Kullback-Leibler (KL) divergence is applied to fine-tune the encoder network parameters of the model. The scenario set is clustered and analyzed by this model, and the scenarios with the highest output index are defined to be the significant risk scenario set. The effectiveness of this method is verified by simulating scenarios in the improved IEEE39-node new energy grid.</p>
<p>The proposed method in this study effectively identifies cascading failure risk scenarios in the new energy grids and demonstrates higher evaluation metrics compared to other traditional clustering algorithms. However, the model training time is relatively long. In future research, different variations of autoencoders will be explored for their application in the DEC algorithm, aiming to improve the training speed and achieve better evaluation results.</p>
</sec>
</body>
<back>
<ack>
<p>The authors acknowledge the support of State Grid Shanxi Electric Power Company.</p>
</ack>
<sec><title>Funding Statement</title>
<p>This research was funded by the State Grid Limited Science and Technology Project of China, Grant Number SGSXDK00DJJS2200144.</p></sec>
<sec><title>Author Contributions</title>
<p>The authors confirm contribution to the paper as follows: study conception and design: Xueting Cheng, Ziqi Zhang, Yueshuang Bao; data collection: Xueting Cheng, Ziqi Zhang, Yueshuang Bao; analysis and interpretation of results: Xueting Cheng, Ziqi Zhang, Yueshuang Bao, Huiping Zheng; draft manuscript preparation: Xueting Cheng, Ziqi Zhang. All authors reviewed the results and approved the final version of the manuscript.</p></sec>
<sec sec-type="data-availability"><title>Availability of Data and Materials</title>
<p>Data supporting this study are included within the article.</p></sec>
<sec sec-type="COI-statement"><title>Conflicts of Interest</title>
<p>The authors declare that they have no conflicts of interest to report regarding the present study.</p></sec>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>1.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Shi</surname>, <given-names>L.</given-names></string-name>, <string-name><surname>Shi</surname>, <given-names>Z.</given-names></string-name>, <string-name><surname>Yao</surname>, <given-names>L.</given-names></string-name>, <string-name><surname>Ni</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Bazargan</surname>, <given-names>M.</given-names></string-name></person-group> (<year>2010</year>). <article-title>A review of mechanism of large cascading failure blackouts of modern power system</article-title>. <source>Power Grid Technology</source><italic>,</italic> <volume>34</volume><issue>(3)</issue><italic>,</italic> <fpage>48</fpage>&#x2013;<lpage>54</lpage>.</mixed-citation></ref>
<ref id="ref-2"><label>2.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Guo</surname>, <given-names>X.</given-names></string-name>, <string-name><surname>Liu</surname>, <given-names>Z.</given-names></string-name>, <string-name><surname>Feng</surname>, <given-names>B.</given-names></string-name>, <string-name><surname>Jiang</surname>, <given-names>B.</given-names></string-name>, <string-name><surname>Guo</surname>, <given-names>J.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2022</year>). <article-title>Research status and prospect of new-type power system risk assessment</article-title>. <source>High Voltage Technology</source><italic>,</italic> <volume>48</volume><issue>(9)</issue><italic>,</italic> <fpage>3394</fpage>&#x2013;<lpage>3404</lpage>.</mixed-citation></ref>
<ref id="ref-3"><label>3.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Ma</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Luo</surname>, <given-names>Z.</given-names></string-name>, <string-name><surname>Zhao</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>Z.</given-names></string-name>, <string-name><surname>Xie</surname>, <given-names>J.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2022</year>). <article-title>Risk assessment of a power system containing wind power and photovoltaic based on improved Monte Carlo mixed sampling</article-title>. <source>Power System Protection and Control</source><italic>,</italic> <volume>50</volume><issue>(9)</issue><italic>,</italic> <fpage>75</fpage>&#x2013;<lpage>83</lpage>.</mixed-citation></ref>
<ref id="ref-4"><label>4.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zhang</surname>, <given-names>X.</given-names></string-name>, <string-name><surname>Zhong</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Mei</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Xia</surname>, <given-names>D.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>S.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2016</year>). <article-title>Blackout risk analysis of power system integrated with DFIG wind farm</article-title>. <source>Advanced Technology of Electrical Engineering and Energy</source><italic>,</italic> <volume>35</volume><issue>(7)</issue><italic>,</italic> <fpage>1</fpage>&#x2013;<lpage>7</lpage>.</mixed-citation></ref>
<ref id="ref-5"><label>5.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Xu</surname>, <given-names>D.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>H.</given-names></string-name></person-group> (<year>2019</year>). <article-title>High risk cascading outage assessment in power systems with large-scale wind power based on stochastic power flow and value at risk</article-title>. <source>Power System Technology</source><italic>,</italic> <volume>43</volume><issue>(2)</issue><italic>,</italic> <fpage>400</fpage>&#x2013;<lpage>409</lpage>.</mixed-citation></ref>
<ref id="ref-6"><label>6.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Deng</surname>, <given-names>H.</given-names></string-name>, <string-name><surname>Zeng</surname>, <given-names>F.</given-names></string-name>, <string-name><surname>Zhang</surname>, <given-names>X.</given-names></string-name>, <string-name><surname>Zheng</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Li</surname>, <given-names>P.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2023</year>). <article-title>A multi-objective prevention strategy for grid cascading failurebased on vulnerable lines screening</article-title>. <source>Electric Power Engineering Technology</source><italic>,</italic> <volume>42</volume><issue>(2)</issue><italic>,</italic> <fpage>223</fpage>&#x2013;<lpage>231</lpage>.</mixed-citation></ref>
<ref id="ref-7"><label>7.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zhu</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Liu</surname>, <given-names>Y.</given-names></string-name></person-group> (<year>2023</year>). <article-title>Fast screening of high-risk cascading failure considering uncertainties of source and load</article-title>. <source>Automation of Electric Power Systems</source><italic>,</italic> <volume>47</volume><issue>(5)</issue><italic>,</italic> <fpage>92</fpage>&#x2013;<lpage>103</lpage>.</mixed-citation></ref>
<ref id="ref-8"><label>8.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zhu</surname>, <given-names>Z.</given-names></string-name>, <string-name><surname>Yuan</surname>, <given-names>W.</given-names></string-name>, <string-name><surname>Wu</surname>, <given-names>B.</given-names></string-name>, <string-name><surname>Yang</surname>, <given-names>X.</given-names></string-name>, <string-name><surname>Chen</surname>, <given-names>G.</given-names></string-name></person-group> (<year>2023</year>). <article-title>Method for filling missing data in power grid based on historical data mining auxiliary scenario analysis</article-title>. <source>Power System &#x0026; Automation</source><italic>,</italic> <volume>45</volume><issue>(1)</issue><italic>,</italic> <fpage>72</fpage>&#x2013;<lpage>74</lpage>.</mixed-citation></ref>
<ref id="ref-9"><label>9.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Li</surname>, <given-names>Q.</given-names></string-name>, <string-name><surname>Zhang</surname>, <given-names>N.</given-names></string-name>, <string-name><surname>Gao</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Liu</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Zhou</surname>, <given-names>Q.</given-names></string-name></person-group> (<year>2021</year>). <article-title>Modeling and application scenario analysis of power phase shift transformer based on RTDS</article-title>. <source>Electric Power Engineering Technology</source><italic>,</italic> <volume>40</volume><issue>(2)</issue><italic>,</italic> <fpage>53</fpage>&#x2013;<lpage>58</lpage>.</mixed-citation></ref>
<ref id="ref-10"><label>10.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Jiang</surname>, <given-names>H.</given-names></string-name>, <string-name><surname>Sun</surname>, <given-names>S.</given-names></string-name></person-group> (<year>2020</year>). <article-title>Comparison and scenario analysis of micro-grid grid-connected and off-grid control methods</article-title>. <source>Electrotechnics Electric</source><italic>,</italic> <volume>11</volume><italic>,</italic> <fpage>23</fpage>&#x2013;<lpage>27</lpage>.</mixed-citation></ref>
<ref id="ref-11"><label>11.</label><mixed-citation publication-type="thesis"><person-group person-group-type="author"><string-name><surname>Ma</surname>, <given-names>Q.</given-names></string-name></person-group> (<year>2019</year>). <source>Capacity planning study of optical storage microgrid based on multi-scenario analysis (M.A. Thesis)</source>. <publisher-name>Kunming University of Science and Technology</publisher-name>, <publisher-loc>China</publisher-loc>.</mixed-citation></ref>
<ref id="ref-12"><label>12.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zhou</surname>, <given-names>Z.</given-names></string-name>, <string-name><surname>Shi</surname>, <given-names>L.</given-names></string-name></person-group> (<year>2021</year>). <article-title>Risk assessment of power system cascading failure considering wind power uncertainty and system frequency modulation</article-title>. <source>Proceedings of the CSEE</source><italic>,</italic> <volume>41</volume><issue>(10)</issue><italic>,</italic> <fpage>3305</fpage>&#x2013;<lpage>3316</lpage>.</mixed-citation></ref>
<ref id="ref-13"><label>13.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Cui</surname>, <given-names>X.</given-names></string-name>, <string-name><surname>Wu</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Lei</surname>, <given-names>M.</given-names></string-name>, <string-name><surname>Zhang</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Xu</surname>, <given-names>J.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2021</year>). <article-title>Discussion on inducement and fault chain search technology of cascading failure in power system with high penetration of renewable energy</article-title>. <source>Electric Power Automation Equipment</source><italic>,</italic> <volume>41</volume><issue>(7)</issue><italic>,</italic> <fpage>135</fpage>&#x2013;<lpage>143</lpage>.</mixed-citation></ref>
<ref id="ref-14"><label>14.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Meng</surname>, <given-names>F.</given-names></string-name>, <string-name><surname>Guo</surname>, <given-names>Q.</given-names></string-name>, <string-name><surname>Kang</surname>, <given-names>H.</given-names></string-name>, <string-name><surname>Zhang</surname>, <given-names>M.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>L.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2022</year>). <article-title>Cascading failure simulation for power system with utility-scale and distributed renewable energy</article-title>. <source>High Voltage Engineering</source><italic>,</italic> <volume>48</volume><issue>(1)</issue><italic>,</italic> <fpage>189</fpage>&#x2013;<lpage>198</lpage>.</mixed-citation></ref>
<ref id="ref-15"><label>15.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zhou</surname>, <given-names>K.</given-names></string-name>, <string-name><surname>Zhang</surname>, <given-names>F.</given-names></string-name></person-group> (<year>2015</year>). <article-title>Research on differentiated lightning protection renovation sequence of transmission lines based on power flow entropy</article-title>. <source>Electric Power Science and Engineering</source><italic>,</italic> <volume>31</volume><issue>(11)</issue><italic>,</italic> <fpage>35</fpage>&#x2013;<lpage>39</lpage>.</mixed-citation></ref>
<ref id="ref-16"><label>16.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Bengio</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Courville</surname>, <given-names>A.</given-names></string-name>, <string-name><surname>Vincent</surname>, <given-names>P.</given-names></string-name></person-group> (<year>2013</year>). <article-title>Representation learning: A review and new perspectives</article-title>. <source>IEEE Transactions on Pattern Analysis and Machine Intelligence</source><italic>,</italic> <volume>35</volume><issue>(8)</issue><italic>,</italic> <fpage>1798</fpage>&#x2013;<lpage>1828</lpage>; <pub-id pub-id-type="pmid">23787338</pub-id></mixed-citation></ref>
<ref id="ref-17"><label>17.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Xie</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Girshick</surname>, <given-names>R.</given-names></string-name>, <string-name><surname>Farhadi</surname>, <given-names>A.</given-names></string-name></person-group> (<year>2016</year>). <article-title>Unsupervised deep embedding for clustering analysis</article-title>. <conf-name>Proceedings of the 33rd International Conference on Machine Learning</conf-name>, pp. <fpage>478</fpage>&#x2013;<lpage>487</lpage>. <conf-loc>New York, USA</conf-loc>.</mixed-citation></ref>
<ref id="ref-18"><label>18.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Tao</surname>, <given-names>W.</given-names></string-name>, <string-name><surname>Qian</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Zhang</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Ma</surname>, <given-names>H.</given-names></string-name>, <string-name><surname>Leng</surname>, <given-names>H.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2022</year>). <article-title>Survey of deep clustering algorithm based on autoencoder</article-title>. <source>Computer Engineering and Applications</source><italic>,</italic> <volume>58</volume><issue>(18)</issue><italic>,</italic> <fpage>16</fpage>&#x2013;<lpage>25</lpage>.</mixed-citation></ref>
</ref-list>
</back></article>