A Two-Stage AI-Powered Motif Mining Method for Efficient Power System Topological Analysis
Збережено в:
| Опубліковано в:: | arXiv.org (Dec 8, 2024), p. n/a |
|---|---|
| Автор: | |
| Інші автори: | , , , , |
| Опубліковано: |
Cornell University Library, arXiv.org
|
| Предмети: | |
| Онлайн доступ: | Citation/Abstract Full text outside of ProQuest |
| Теги: |
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Короткий огляд: | 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 |
| Джерело: | Engineering Database |