Union subgraph neural networks
Graph Neural Networks (GNNs) are widely used for graph representation learning in many application domains. The expressiveness of vanilla GNNs is upper-bounded by 1-dimensional Weisfeiler-Leman (1-WL) test as they operate on rooted subtrees through iterative message passing. In this paper, we empowe...
Saved in:
Main Authors: | Xu, Jiaxing, Zhang, Aihu, Bian, Qingtian, Dwivedi, Vijay Prakash, Ke, Yiping |
---|---|
Other Authors: | School of Computer Science and Engineering |
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2024
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/173329 https://aaai.org/aaai-conference/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Contrastive graph pooling for explainable classification of brain networks
by: Xu, Jiaxing, et al.
Published: (2024) -
Learning to count isomorphisms with graph neural networks
by: YU, Xingtong, et al.
Published: (2023) -
A class-aware representation refinement framework for graph classification
by: Xu, Jiaxing, et al.
Published: (2024) -
Deep learning for graph structured data
by: Dwivedi Vijay Prakash
Published: (2024) -
CPMR: context-aware incremental sequential recommendation with pseudo-multi-task learning
by: Bian, Qingtian, et al.
Published: (2023)