DPFAGA-Dynamic Power Flow Analysis and Fault Characteristics: A Graph Attention Neural Network

• URL: http://arxiv.org/abs/2503.15563v2
• Date: Sun, 23 Mar 2025 04:30:41 GMT
• Title: DPFAGA-Dynamic Power Flow Analysis and Fault Characteristics: A Graph Attention Neural Network
• Authors: Tan Le, Van Le,
• Abstract summary: We propose the joint graph attention neural network (GAT) and clustering with adaptive neighbors (CAN) for dynamic power flow analysis and fault characteristics.<n>We then evaluate the proposed framework in the use-case application in smart grid and make a fair comparison to the existing methods.
• Score: 0.19439126568870457
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We propose the joint graph attention neural network (GAT), clustering with adaptive neighbors (CAN) and probabilistic graphical model for dynamic power flow analysis and fault characteristics. In fact, computational efficiency is the main focus to enhance, whilst we ensure the performance accuracy at the accepted level. Note that Machine Learning (ML) based schemes have a requirement of sufficient labeled data during training, which is not easily satisfied in practical applications. Also, there are unknown data due to new arrived measurements or incompatible smart devices in complex smart grid systems. These problems would be resolved by our proposed GAT based framework, which models the label dependency between the network data and learns object representations such that it could achieve the semi-supervised fault diagnosis. To create the joint label dependency, we develop the graph construction from the raw acquired signals by using CAN. Next, we develop the probabilistic graphical model of Markov random field for graph representation, which supports for the GAT based framework. We then evaluate the proposed framework in the use-case application in smart grid and make a fair comparison to the existing methods.

Related papers

• Non-Euclidean Hierarchical Representational Learning using Hyperbolic Graph Neural Networks for Environmental Claim Detection [1.3673890873313355]
  Transformer-based models dominate NLP tasks like sentiment analysis, machine translation, and claim verification.<n>In this work, we explore Graph Neural Networks (GNNs) and Hyperbolic Graph Neural Networks (HGNNs) as lightweight yet effective alternatives for Environmental Claim Detection.
  arXiv  Detail & Related papers  (2025-02-19T11:04:59Z)
• Revisiting Graph Neural Networks on Graph-level Tasks: Comprehensive Experiments, Analysis, and Improvements [54.006506479865344]
  We propose a unified evaluation framework for graph-level Graph Neural Networks (GNNs)<n>This framework provides a standardized setting to evaluate GNNs across diverse datasets.<n>We also propose a novel GNN model with enhanced expressivity and generalization capabilities.
  arXiv  Detail & Related papers  (2025-01-01T08:48:53Z)
• A Heterogeneous Graph-Based Multi-Task Learning for Fault Event Diagnosis in Smart Grid [1.6385815610837167]
  We propose a heterogeneous multi-task learning graph neural network (MTL-GNN) capable of detecting, locating and classifying faults. Using a graph neural network (GNN) allows for learning the topological representation of the distribution system. This work also proposes a novel GNN-based explainability method to identify key nodes in the distribution system.
  arXiv  Detail & Related papers  (2023-09-18T16:35:30Z)
• Energy-based Out-of-Distribution Detection for Graph Neural Networks [76.0242218180483]
  We propose a simple, powerful and efficient OOD detection model for GNN-based learning on graphs, which we call GNNSafe. GNNSafe achieves up to $17.0%$ AUROC improvement over state-of-the-arts and it could serve as simple yet strong baselines in such an under-developed area.
  arXiv  Detail & Related papers  (2023-02-06T16:38:43Z)
• Distributionally Robust Semi-Supervised Learning Over Graphs [68.29280230284712]
  Semi-supervised learning (SSL) over graph-structured data emerges in many network science applications. To efficiently manage learning over graphs, variants of graph neural networks (GNNs) have been developed recently. Despite their success in practice, most of existing methods are unable to handle graphs with uncertain nodal attributes. Challenges also arise due to distributional uncertainties associated with data acquired by noisy measurements. A distributionally robust learning framework is developed, where the objective is to train models that exhibit quantifiable robustness against perturbations.
  arXiv  Detail & Related papers  (2021-10-20T14:23:54Z)
• Discriminability of Single-Layer Graph Neural Networks [172.5042368548269]
  Graph neural networks (GNNs) have exhibited promising performance on a wide range of problems. We focus on the property of discriminability and establish conditions under which the inclusion of pointwise nonlinearities to a stable graph filter bank leads to an increased discriminative capacity for high-eigenvalue content.
  arXiv  Detail & Related papers  (2020-10-17T18:52:34Z)
• Hierarchical BiGraph Neural Network as Recommendation Systems [0.0]
  We propose a hierarchical approach of using GNNs as recommendation systems and structuring the user-item features using a bigraph framework. Our experimental results show competitive performance with current recommendation system methods and transferability.
  arXiv  Detail & Related papers  (2020-07-27T18:01:41Z)
• Active Learning on Attributed Graphs via Graph Cognizant Logistic Regression and Preemptive Query Generation [37.742218733235084]
  We propose a novel graph-based active learning algorithm for the task of node classification in attributed graphs. Our algorithm uses graph cognizant logistic regression, equivalent to a linearized graph convolutional neural network (GCN) for the prediction phase and maximizes the expected error reduction in the query phase. We conduct experiments on five public benchmark datasets, demonstrating a significant improvement over state-of-the-art approaches.
  arXiv  Detail & Related papers  (2020-07-09T18:00:53Z)
• Graph Neural Networks for Leveraging Industrial Equipment Structure: An application to Remaining Useful Life Estimation [21.297461316329453]
  We propose to capture the structure of a complex equipment in the form of a graph, and use graph neural networks (GNNs) to model multi-sensor time-series data. We observe that the proposed GNN-based RUL estimation model compares favorably to several strong baselines from literature such as those based on RNNs and CNNs.
  arXiv  Detail & Related papers  (2020-06-30T06:38:08Z)
• Neural Stochastic Block Model & Scalable Community-Based Graph Learning [8.00785050036369]
  This paper proposes a scalable community-based neural framework for graph learning. The framework learns the graph topology through the task of community detection and link prediction. We look into two particular applications, the graph alignment and the anomalous correlation detection.
  arXiv  Detail & Related papers  (2020-05-16T03:28:50Z)
• Tensor Graph Convolutional Networks for Multi-relational and Robust Learning [74.05478502080658]
  This paper introduces a tensor-graph convolutional network (TGCN) for scalable semi-supervised learning (SSL) from data associated with a collection of graphs, that are represented by a tensor. The proposed architecture achieves markedly improved performance relative to standard GCNs, copes with state-of-the-art adversarial attacks, and leads to remarkable SSL performance over protein-to-protein interaction networks.
  arXiv  Detail & Related papers  (2020-03-15T02:33:21Z)
• Block-Approximated Exponential Random Graphs [77.4792558024487]
  An important challenge in the field of exponential random graphs (ERGs) is the fitting of non-trivial ERGs on large graphs. We propose an approximative framework to such non-trivial ERGs that result in dyadic independence (i.e., edge independent) distributions. Our methods are scalable to sparse graphs consisting of millions of nodes.
  arXiv  Detail & Related papers  (2020-02-14T11:42:16Z)
• Data-Driven Factor Graphs for Deep Symbol Detection [107.63351413549992]
  We propose to implement factor graph methods in a data-driven manner. In particular, we propose to use machine learning (ML) tools to learn the factor graph. We demonstrate that the proposed system, referred to as BCJRNet, learns to implement the BCJR algorithm from a small training set.
  arXiv  Detail & Related papers  (2020-01-31T09:23:52Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.