A Novel Higher-Order Weisfeiler-Lehman Graph Convolution
Abstract
Current GNN architectures use a vertex neighborhood aggregation scheme, which limits their discriminative power to that of the 1-dimensional Weisfeiler-Lehman (WL) graph isomorphism test. Here, we propose a novel graph convolution operator that is based on the 2-dimensional WL test. We formally show that the resulting 2-WL-GNN architecture is more discriminative than existing GNN approaches. This theoretical result is complemented by experimental studies using synthetic and real data. On multiple common graph classification benchmarks, we demonstrate that the proposed model is competitive with state-of-the-art graph kernels and GNNs.
Cite
Text
Damke et al. "A Novel Higher-Order Weisfeiler-Lehman Graph Convolution." Proceedings of The 12th Asian Conference on Machine Learning, 2020.Markdown
[Damke et al. "A Novel Higher-Order Weisfeiler-Lehman Graph Convolution." Proceedings of The 12th Asian Conference on Machine Learning, 2020.](https://mlanthology.org/acml/2020/damke2020acml-novel/)BibTeX
@inproceedings{damke2020acml-novel,
title = {{A Novel Higher-Order Weisfeiler-Lehman Graph Convolution}},
author = {Damke, Clemens and Melnikov, Vitalik and Hüllermeier, Eyke},
booktitle = {Proceedings of The 12th Asian Conference on Machine Learning},
year = {2020},
pages = {49-64},
volume = {129},
url = {https://mlanthology.org/acml/2020/damke2020acml-novel/}
}