Data-Optimized Contingency Screening: A Machine Learning Approach to Power System Security

• URL: http://arxiv.org/abs/2609.04300v1
• Date: Thu, 03 Sep 2026 17:04:38 GMT
• Title: Data-Optimized Contingency Screening: A Machine Learning Approach to Power System Security
• Abstract summary: This study explores the use of machine learning algorithms to classify security levels of contingencies in power systems into safe, moderate or severe classes.<n>Newton-Raphson load flow method extracts system data from contingency scenarios.<n>Performance is assessed by precision, recall and F1 score, with priority given to the severe contingency classes.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Ensuring the security of the power system is essential for stability and reliability, especially in the event of disruption. Effective classification of contingency in power systems enables proactive decision-making and mitigates large-scale breakdowns and failures. This study explores the use of machine learning algorithms to classify security levels of contingencies in power systems into safe, moderate or severe classes. For this approach, Newton-Raphson load flow method extracts system data from contingency scenarios, using Overall Performance Index (OPI) as safety measure. For data pre-processing, Synthetic Minority Over-Sampling Technique (SMOTE) and Principal Component Analysis (PCA) is used to address class imbalance and reduce dimensionality, respectively. K-Nearest Neighbours (KNN), Random Forest (RF) and Support Vector Machines (SVM) is trained and evaluated on datasets generated through N-k contingency scenarios for k equal 1, 2, and 3 on IEEE-14 and IEEE-30 bus systems using four hybrid pre-processing configurations: normalized, SMOTE-balanced, PCA-transformed, and a combined SMOTE PCA-transformed. Performance is assessed by precision, recall and F1 score, with priority given to the severe contingency classes. The RF achieved the highest F1 scores of 0.97 in IEEE-30 and 0.86 in IEEE-14, SVM benefits significantly from PCA and improves the accuracy of the classification, while KNN is best suited for SMOTE and PCA conversion. The findings show that PCA contributes more than SMOTE to the overall performance of the model. However, SMOTE improves recall but can introduce false positives and is therefore a compromise of accuracy. This study highlights machine learning as a scalable and powerful alternative to traditional contingency analysis, which improves the assessment of security in real time.

Related papers

• nCMD: Benign-Anchored Feature Selection for Imbalanced Network Intrusion Detection [0.0]
  We propose benign-anchored Classwise Mean Deviation (nCMD) to rank features in intrusion detection systems.<n>nCMD scores feature relevance based on the deviation of attack-class distributions from the benign-class mean, rather than a globally biased reference.<n>This approach aligns feature selection with the operational semantics of NIDS at no additional computational cost.
  arXiv  Detail & Related papers  (2026-06-07T19:01:05Z)
• Multimodal Learning on Low-Quality Data with Conformal Predictive Self-Calibration [72.0672328514289]
  Multimodal learning often grapples with the challenge of low-quality data.<n>We propose a unified framework, termed Conformal Predictive Self-Calibration.<n>Our framework consistently outperforms existing state-of-the-art methods.
  arXiv  Detail & Related papers  (2026-05-05T14:48:52Z)
• Taming the Instability: A Robust Second-Order Optimizer for Federated Learning over Non-IID Data [77.19117648492104]
  We present Federated Robust Curvature Optimization (FedRCO), a novel second-order optimization framework designed to improve convergence speed and reduce communication cost.<n>FedRCO addresses these challenges by integrating an efficient approximate curvature with a provable stability mechanism.<n>We show that FedRCO achieves superior robustness against diverse non-IID scenarios while achieving higher accuracy and faster convergence than both state-of-the-art first-order and second-order methods.
  arXiv  Detail & Related papers  (2026-03-30T11:37:46Z)
• Safeguarding LLM Fine-tuning via Push-Pull Distributional Alignment [45.772620696660034]
  Safety Optimal Transport (SOT) is a novel framework that reframes safe fine-tuning from an instance-level filtering challenge to a distribution-level alignment task grounded in Optimal Transport (OT)<n>SOT prioritizes sample importance by actively pulling the downstream distribution towards a trusted safe anchor while simultaneously pushing it away from a general harmful reference.<n>Experiments across diverse model families and domains demonstrate that SOT significantly enhances model safety while maintaining competitive downstream performance.
  arXiv  Detail & Related papers  (2026-01-12T04:48:02Z)
• Robustness Evaluation of Machine Learning Models for Fault Classification and Localization In Power System Protection [5.539105299550525]
  This work introduces a unified framework for evaluating the robustness of machine learning models in power system protection.<n>High-fidelity EMT simulations are used to model realistic degradation scenarios, including sensor outages, reduced sampling rates, and transient communication losses.<n>Results show that FC remains highly stable under most degradation types but drops by about 13% under single-phase loss, while FL is more sensitive overall, with voltage loss increasing localization error by over 150%.
  arXiv  Detail & Related papers  (2025-12-17T12:38:53Z)
• Benchmarking Foundation Models and Parameter-Efficient Fine-Tuning for Prognosis Prediction in Medical Imaging [40.35825564674249]
  This study introduces the first structured benchmark to assess the robustness and efficiency of transfer learning strategies for Foundation Models.<n>Four publicly available COVID-19 chest X-ray datasets were used, covering mortality, severity, and admission.<n>CNNs pretrained on ImageNet and FMs pretrained on general or biomedical datasets were adapted using full finetuning, linear probing, and parameter-efficient methods.
  arXiv  Detail & Related papers  (2025-06-23T09:16:04Z)
• EVA-S2PMLP: Secure and Scalable Two-Party MLP via Spatial Transformation [0.0]
  This paper presents textbfEVA-S2PMLP, an Efficient, Verifiable, and Accurate Secure Two-Party Multi-Layer Perceptron framework.<n> EVA-S2PMLP achieves high inference accuracy and significantly reduced communication overhead, with up to $12.3times$ improvement over baselines.<n>It is a practical solution for privacy-preserving neural network training in finance, healthcare, and cross-organizational AI applications.
  arXiv  Detail & Related papers  (2025-06-18T03:18:35Z)
• Efficient Safety Alignment of Large Language Models via Preference Re-ranking and Representation-based Reward Modeling [84.00480999255628]
  Reinforcement Learning algorithms for safety alignment of Large Language Models (LLMs) encounter the challenge of distribution shift.<n>Current approaches typically address this issue through online sampling from the target policy.<n>We propose a new framework that leverages the model's intrinsic safety judgment capability to extract reward signals.
  arXiv  Detail & Related papers  (2025-03-13T06:40:34Z)
• EVA-S2PLoR: Decentralized Secure 2-party Logistic Regression with A Subtly Hadamard Product Protocol (Full Version) [2.1010315462623184]
  This paper proposes an efficient, verifiable, and accurate security 2-party logistic regression framework (EVA-S2PLoR)<n>It achieves accurate nonlinear function through a subtly secure hadamard product protocol and its derived protocols.<n>High efficiency and precision are guaranteed by the asynchronous flow on floating point numbers and the few number of fixed communication rounds.
  arXiv  Detail & Related papers  (2025-01-09T13:19:59Z)
• Learnable Scaled Gradient Descent for Guaranteed Robust Tensor PCA [39.084456109467204]
  We propose an efficient scaled gradient descent (SGD) approach within the t-SVD framework for the first time.<n>We show that RTPCA-SGD achieves linear convergence to the true low-rank tensor at a constant rate, independent of the condition number.
  arXiv  Detail & Related papers  (2025-01-08T15:25:19Z)
• Age-Based Device Selection and Transmit Power Optimization in Over-the-Air Federated Learning [44.04728314657621]
  Over-the-air federated learning (FL) has attracted significant attention for its ability to enhance communication efficiency.<n>In particular, neglecting straggler devices in FL can lead to a decline in the fairness of model updates and amplify the global model's bias toward certain devices' data.<n>We propose a joint device selection and transmit power optimization framework that ensures the appropriate participation of straggler devices, maintains efficient training performance, and guarantees timely updates.
  arXiv  Detail & Related papers  (2025-01-03T14:27:13Z)
• Deep learning based on Transformer architecture for power system short-term voltage stability assessment with class imbalance [13.3281651745186]
  In practical applications, short-term voltage instability following a disturbance is minimal, leading to a significant class imbalance problem. This work proposes a Transformer-based STVSA method to address this challenge. To combat the negative impact of imbalanced datasets, this work employs a conditional Wasserstein generative adversarial network with gradient penalty.
  arXiv  Detail & Related papers  (2023-10-18T03:36:10Z)
• Bayesian Optimization with Machine Learning Algorithms Towards Anomaly Detection [66.05992706105224]
  In this paper, an effective anomaly detection framework is proposed utilizing Bayesian Optimization technique. The performance of the considered algorithms is evaluated using the ISCX 2012 dataset. Experimental results show the effectiveness of the proposed framework in term of accuracy rate, precision, low-false alarm rate, and recall.
  arXiv  Detail & Related papers  (2020-08-05T19:29:35Z)

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.