MagNet: A Neural Network for Directed Graphs
- PMID: 36046111
- PMCID: PMC9425115
MagNet: A Neural Network for Directed Graphs
Abstract
The prevalence of graph-based data has spurred the rapid development of graph neural networks (GNNs) and related machine learning algorithms. Yet, despite the many datasets naturally modeled as directed graphs, including citation, website, and traffic networks, the vast majority of this research focuses on undirected graphs. In this paper, we propose MagNet, a GNN for directed graphs based on a complex Hermitian matrix known as the magnetic Laplacian. This matrix encodes undirected geometric structure in the magnitude of its entries and directional information in their phase. A "charge" parameter attunes spectral information to variation among directed cycles. We apply our network to a variety of directed graph node classification and link prediction tasks showing that MagNet performs well on all tasks and that its performance exceeds all other methods on a majority of such tasks. The underlying principles of MagNet are such that it can be adapted to other GNN architectures.
Figures
References
-
- Atwood James and Towsley Don. Diffusion-convolutional neural networks. In Lee D, Sugiyama M, Luxburg U, Guyon I, and Garnett R, editors, Advances in Neural Information Processing Systems, volume 29, pages 1993–2001. Curran Associates, Inc., 2016.
-
- Belkin Mikhail and Niyogi Partha. Laplacian eigenmaps for dimensionality reduction and data representation. Neural computation, 15(6):1373–1396, 2003.
-
- Bojchevski Aleksandar and Günnemann Stephan. Deep Gaussian embedding of graphs: Unsupervised inductive learning via ranking. In ICLR Workshop on Representation Learning on Graphs and Manifolds, 2017.
-
- Bovet Alexandre and Grindrod Peter. The activity of the far right on telegram. https://www.researchgate.net/publication/346968575_The_Activity_of_the_F..., 2020.
Grants and funding
LinkOut - more resources
Full Text Sources
Other Literature Sources