The reviewed record of science sign in
Pith

arxiv: 2412.05957 · v1 · pith:VRVEUFS4 · submitted 2024-12-08 · eess.SY · cs.SY

A Two-Stage AI-Powered Motif Mining Method for Efficient Power System Topological Analysis

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:VRVEUFS4record.jsonopen to challenge →

classification eess.SY cs.SY
keywords motifpowersystemanalysismethodgraphai-poweredefficient
0
0 comments X
read the original abstract

Graph motif, defined as the microstructure that appears repeatedly in a large graph, reveals important topological characteristics of the large graph and has gained increasing attention in power system analysis regarding reliability, vulnerability and resiliency. However, searching motifs within the large-scale power system is extremely computationally challenging and even infeasible, which undermines the value of motif analysis in practice. In this paper, we introduce a two-stage AI-powered motif mining method to enable efficient and wide-range motif analysis in power systems. In the first stage, a representation learning method with specially designed network structure and loss function is proposed to achieve ordered embedding for the power system topology, simplifying the subgraph isomorphic problem into a vector comparison problem. In the second stage, under the guidance of the ordered embedding space, a greedy-search-based motif growing algorithm is introduced to quickly obtain the motifs without traversal searching. A case study based on a power system database including 61 circuit models demonstrates the effectiveness of the proposed method.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.