A strong coreset algorithm to accelerate OPF as a graph-based machine learning in large-scale problems

DOI10.1016/J.INS.2020.10.009MaRDI QIDQ2124197zbMATH OpenOpenAlexFDO

Authors Hamid Bostani, Mansour Sheikhan, B. Mahboobi

Publication date 14 April 2022

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2020.10.009

zbMATH Keywords

large-scale problemsoptimum-path forestcoresetmassive datasets

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computational aspects of data analysis and big data (68T09)

Recommendations

• A Hierarchical Optimization Architecture for Large-Scale Power Networks
• Graph coarsening: from scientific computing to machine learning
• A robust and informative method for solving large-scale power flow problems
• Graphical models for optimal power flow
• Graph-based optimization approaches for machine learning, uncertainty quantification and networks
• Optimization over decision trees: a case study for the design of stable direct-current electricity networks
• An ordinal optimization theory-based algorithm for large distributed power systems
• On the robustness and scalability of semidefinite relaxation for optimal power flow problems
• \(L_1\) optimization for sparse structure machine learning based electricity demand prediction

Cites work

• scientific article; zbMATH DE number 5019895 (Why is no real title available?)
• A FAST k-MEANS IMPLEMENTATION USING CORESETS
• A PTAS for k-means clustering based on weak coresets
• A nature-inspired approach to speed up optimum-path forest clustering and its application to intrusion detection in computer networks
• An incremental linear-time learning algorithm for the optimum-path forest classifier
• Coresets in dynamic geometric data streams
• Multi-label semi-supervised classification through optimum-path forest
• On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their Applications
• Path-value functions for which Dijkstra's algorithm returns optimal mapping
• Practical methods for shape fitting and kinetic data structures using coresets
• Robust shape fitting via peeling and grating coresets
• Smaller coresets for k-median and k-means clustering

Cited in

(1)

• A Learning Algorithm for the Optimum-Path Forest Classifier

This page was built for publication: A strong coreset algorithm to accelerate OPF as a graph-based machine learning in large-scale problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2124197)