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

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	arXiv.org (Dec 8, 2024), p. n/a
1. Verfasser:	Li, Yiyan
Weitere Verfasser:	Zhou, Zhenghao, Ping, Jian, Xu, Xiaoyuan, Zheng, Yan, Wu, Jianzhong
Veröffentlicht:	Cornell University Library, arXiv.org
Schlagworte:	Search algorithms Systems analysis Machine learning Graph theory Reliability Embedding Greedy algorithms Topology
Online-Zugang:	Citation/Abstract Full text outside of ProQuest
Tags:	Tag hinzufügen Keine Tags, Fügen Sie das erste Tag hinzu!

Beschreibung
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.
ISSN:	2331-8422
Quelle:	Engineering Database