Polarized message-passing in graph neural networks

DOI10.1016/J.ARTINT.2024.104129MaRDI QIDQ6566646zbMATHzbMATHFDO

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)

zbMATH Keywords

graph analysisrepresentation learninggraph neural networksmessage-passing graph neural networks

Mathematics Subject Classification ID

Artificial neural networks and deep learning (68T07) Graph theory (including graph drawing) in computer science (68R10)

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

Cites work

• Clustering ensemble based on sample's stability
• Multi-view graph convolutional networks with attention mechanism

Cited in

(2)

• Revisiting graph neural networks from hybrid regularized graph signal reconstruction
• GPNet: simplifying graph neural networks via multi-channel geometric polynomials

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)