IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0326709.html

A load forecasting method based on edge graph attention network

Author

Listed:
  • Mengze Gu
  • Xueping Li
  • Yao Cai

Abstract

Given the increasing demand for high-accuracy power load forecasting, traditional load forecasting methods can capture long-term dependencies in time series, but cannot fully capture the complex relationships between multi-dimensional features. This paper proposes an innovative method to convert time series data into graph features. By constructing a graph structure based on time nodes, the time series forecasting problem is transformed into a graph-based load forecasting problem. On this basis, the Edge Graph Attention Network (EGAT) is used to combine the feature information of nodes and edges to further enhance the ability to represent feature interactions and improve the accuracy of load forecasting. This paper compares the EGAT model with common load forecasting methods, including gated recurrent units (GRU), multi-layer perceptron networks (MLP) and long short-term memory (LSTM). The results show that EGAT is effective at finding important features and understanding complex time patterns, which means it shows strong potential in predicting energy demand. A limitation of the proposed approach is its increased computational cost introduced by graph construction and attention-based aggregation, which may raise training time and memory usage for large-scale graphs. In addition, the forecasting performance can be influenced by the design of the time-series graph (e.g., connectivity patterns) and the availability/quality of edge features.

Suggested Citation

  • Mengze Gu & Xueping Li & Yao Cai, 2026. "A load forecasting method based on edge graph attention network," PLOS ONE, Public Library of Science, vol. 21(4), pages 1-23, April.
  • Handle: RePEc:plo:pone00:0326709
    DOI: 10.1371/journal.pone.0326709
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0326709
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0326709&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0326709?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:plo:pone00:0326709. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.