paper-with-me

Papers

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

2024-12-08 · Yiyan Li, Zhenghao Zhou, Jian Ping, Xiaoyuan Xu, Zheng Yan, Jianzhong Wu

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.

📄 PDF Abstract BibTeX arXiv:2412.05957

Code (0)

등록된 구현이 없습니다.

Tasks

Representation Learning

Methods 이 논문이 사용한 방법론

Softmax The Softmax output function transforms a previous layer's output into a vector of probabilities. It is commonly used for multiclass classification. Given an input vector $x$…
Attention 설명 없음

Similar Papers 제목 키워드 기반

Claude Code-Driving Scenario Mining for the Argoverse 2 Challenge

2026-06-08 · Wei Deng, Caoshengzhe Xue, Shuaikun Liu, Zhaohong Liu 외 arxiv

We present our submission to the CVPR 2026 Argoverse 2 Scenario Mining Challenge. Our system uses a four-stage pipeline: (1) autonomous code generation via a Claude Code agent powered by GLM~5.1, (2) iterative training s…

Code Generation

Approximate Network Motif Mining Via Graph Learning

2022-06-02 · Carlos Oliver, Dexiong Chen, Vincent Mallet, Pericles Philippopoulos 외

Frequent and structurally related subgraphs, also known as network motifs, are valuable features of many graph datasets. However, the high computational complexity of identifying motif sets in arbitrary datasets (motif m…

BIG-bench Machine LearningGraph ClassificationGraph Learning

Crowd-Powered Data Mining

2018-06-13 · Chengliang Chai, Ju Fan, Guoliang Li, Jiannan Wang 외

Many data mining tasks cannot be completely addressed by auto- mated processes, such as sentiment analysis and image classification. Crowdsourcing is an effective way to harness the human cognitive ability to process the…

ClusteringGeneral Classificationimage-classificationImage Classification+2

META: Metadata-Empowered Weak Supervision for Text Classification

2020-11-01 · EMNLP 2020 11 · Dheeraj Mekala, Xinyang Zhang, Jingbo Shang

Recent advances in weakly supervised learning enable training high-quality text classifiers by only providing a few user-provided seed words. Existing methods mainly use text data alone to generate pseudo-labels despite …

ClassificationGeneral Classificationtext-classificationText Classification+1

Towards a Near Universal Time Series Data Mining Tool: Introducing the Matrix Profile

2018-11-05 · Chin-Chia Michael Yeh

The last decade has seen a flurry of research on all-pairs-similarity-search (or, self-join) for text, DNA, and a handful of other datatypes, and these systems have been applied to many diverse data mining problems. Surp…

ClusteringRepresentation LearningSemantic SegmentationTime Series+2