On the substructure countability of graph neural networks
With the empirical success of Graph Neural Networks (GNNs) on graph-related tasks, it is intriguing to investigate their theoretical power on these tasks. In this paper, we focus on GNNs' theoretical power on substructure counting, a fundamental yet challenging task in many applications. Previo...
Saved in:
Main Authors: | XIA, Wenwen, LI, Yuchen, LI, Shenghong |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2022
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/7623 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Forecasting interaction order on temporal graphs
by: XIA, Wenwen, et al.
Published: (2021) -
Multi-channel graph neural network for entity alignment
by: CAO, Yixin, et al.
Published: (2019) -
ShellNet: Efficient point cloud convolutional neural networks using concentric shells statistics
by: ZHANG, Zhiyuan, et al.
Published: (2019) -
Task relation networks
by: LI, Jianshu, et al.
Published: (2019) -
TENet: Triple Excitation Network for video salient object detection
by: REN, Sucheng, et al.
Published: (2020)