An Efficient Subgraph GNN with Provable Substructure Counting Power-Reference-Cited by-同舟云学术

An Efficient Subgraph GNN with Provable Substructure Counting Power

Published:2024-08-24 Issue: Volume:34 Page:3702-3713
ISSN:
Container-title:Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining
language:
Short-container-title:

Author:

Yan Zuoyu¹^ORCID,Zhou Junru²^ORCID,Gao Liangcai¹^ORCID,Tang Zhi¹^ORCID,Zhang Muhan³^ORCID

Affiliation:

1. Wangxuan Institute of Computer Technology, Peking University, Beijing, China

2. Institute for Artificial Intelligence, Peking University, Beijing, China

3. Beijing Institute for General Artificial Intelligence, Peking University, Beijing, China

Funder

National Science and Technology Major Project

National Natural Science Foundation of China

National Key R&D Program of China

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3637528.3671731

Reference85 articles.

1. Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence

2. Sami Abu-El-Haija, Bryan Perozzi, Amol Kapoor, Nazanin Alipourfard, Kristina Lerman, Hrayr Harutyunyan, Greg Ver Steeg, and Aram Galstyan. 2019. Mixhop: Higher-order graph convolutional architectures via sparsified neighborhood mixing. In international conference on machine learning. PMLR, 21--29.

3. On Weisfeiler-Leman invariance: Subgraph counts and related graph properties

4. László Babai, Paul Erdos, and Stanley M Selkow. 1980. Random graph isomorphism. SIaM Journal on computing, Vol. 9, 3 (1980), 628--635.

5. Muhammet Balcilar, Pierre Héroux, Benoit Gauzere, Pascal Vasseur, Sébastien Adam, and Paul Honeine. 2021. Breaking the limits of message passing graph neural networks. In International Conference on Machine Learning. PMLR, 599--608.