GraphPMU: Event Clustering via Graph Representation Learning Using Locationally-Scarce Distribution-Level Fundamental and Harmonic PMU Measurements
This paper is concerned with the complex task of identifying the type and cause of the events that are captured by distribution-level phasor measurement units (D-PMUs) in order to enhance situational awareness in power distribution systems. Our goal is to address two fundamental challenges in this field: a) scarcity in measurement locations due to the high cost of purchasing, installing, and streaming data from D-PMUs; b) limited prior knowledge about the event signatures due to the fact that the events are diverse, infrequent, and inherently unscheduled. To tackle these challenges, we propose an unsupervised graph-representation learning method, called GraphPMU, to significantly improve the performance in event clustering under locationally-scarce data availability by proposing the following two new directions: 1) using the topological information about the relative location of the few available phasor measurement units on the graph of the power distribution network; 2) utilizing not only the commonly used fundamental phasor measurements, bus also the less explored harmonic phasor measurements in the process of analyzing the signatures of various events. Through a detailed analysis of several case studies, we show that GraphPMU can highly outperform the prevalent methods in the literature.
Code (0)
등록된 구현이 없습니다.
Tasks
Graph Representation LearningRepresentation LearningSimilar Papers 제목 키워드 기반
Improving Event Representation via Simultaneous Weakly Supervised Contrastive Learning and Clustering
Representations of events described in text are important for various tasks. In this work, we present SWCC: a Simultaneous Weakly supervised Contrastive learning and Clustering framework for event representation learning…
ClusteringContrastive LearningRepresentation LearningSentence+1Resolving Event Coreference with Supervised Representation Learning and Clustering-Oriented Regularization
We present an approach to event coreference resolution by developing a general framework for clustering that uses supervised representation learning. We propose a neural network architecture with novel Clustering-Oriente…
Clusteringcoreference-resolutionCoreference ResolutionEvent Coreference Resolution+1CARL-G: Clustering-Accelerated Representation Learning on Graphs
Self-supervised learning on graphs has made large strides in achieving great performance in various downstream tasks. However, many state-of-the-art methods suffer from a number of impediments, which prevent them from re…
ClusteringContrastive LearningGraph Representation LearningNode Classification+3Conventional clustering-based method for event detection on social networks
Social networks are becoming the preferred channel to report and discuss events happening around the world. The information stream such channels contain can be used to detect and describe the ongoing events to take infor…
ClusteringEvent DetectionSymmetric Graph Convolutional Autoencoder for Unsupervised Graph Representation Learning
We propose a symmetric graph convolutional autoencoder which produces a low-dimensional latent representation from a graph. In contrast to the existing graph autoencoders with asymmetric decoder parts, the proposed autoe…
ClusteringDecoderGraph ClusteringGraph Representation Learning+3