TL;DR
This paper introduces novel graph convolutional network models for wind speed prediction that learn the spatial relationships between weather stations and incorporate temporal data, outperforming existing baselines on real datasets.
Contribution
The paper proposes new GCN-based models with learnable adjacency matrices and self-loop mechanisms for improved wind speed forecasting.
Findings
Models outperform baseline methods on real datasets.
Learned adjacency matrices reveal station relationships.
Incorporating temporal convolution enhances predictions.
Abstract
Wind speed prediction and forecasting is important for various business and management sectors. In this paper, we introduce new models for wind speed prediction based on graph convolutional networks (GCNs). Given hourly data of several weather variables acquired from multiple weather stations, wind speed values are predicted for multiple time steps ahead. In particular, the weather stations are treated as nodes of a graph whose associated adjacency matrix is learnable. In this way, the network learns the graph spatial structure and determines the strength of relations between the weather stations based on the historical weather data. We add a self-loop connection to the learnt adjacency matrix and normalize the adjacency matrix. We examine two scenarios with the self-loop connection setting (two separate models). In the first scenario, the self-loop connection is imposed as a constant…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsGraph Convolutional Networks · Convolution
