Polarized message-passing in graph neural networks
From MaRDI portal
Publication:6566646
DOI10.1016/J.ARTINT.2024.104129zbMATH Open1542.6818MaRDI QIDQ6566646FDOQ6566646
Authors: Tiantian He, Yang Liu, Y. S. Ong, Xiaohu Wu, Xin Luo
Publication date: 3 July 2024
Published in: Artificial Intelligence (Search for Journal in Brave)
Recommendations
- Understanding the message passing in graph neural networks via power iteration clustering
- Path integral based convolution and pooling for graph neural networks*
- Revisiting graph neural networks from hybrid regularized graph signal reconstruction
- Theory of graph neural networks: representation and learning
- GPNet: simplifying graph neural networks via multi-channel geometric polynomials
Artificial neural networks and deep learning (68T07) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
Cited In (2)
This page was built for publication: Polarized message-passing in graph neural networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6566646)