Weisfeiler and leman go neural: Higher-order graph neural networks. Morris, C., Ritzert, M., Fey, M., Hamilton, W., L., Lenssen, J., E., Rattan, G., & Grohe, M. 33rd AAAI Conference on Artificial Intelligence, AAAI 2019, 31st Innovative Applications of Artificial Intelligence Conference, IAAI 2019 and the 9th AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2019, 2019. ![Weisfeiler and leman go neural: Higher-order graph neural networks [pdf]](https://bibbase.org/img/filetypes/pdf.svg "pdf")
Paper doi abstract bibtex In recent years, graph neural networks (GNNs) have emerged as a powerful neural architecture to learn vector representations of nodes and graphs in a supervised, end-to-end fashion. Up to now, GNNs have only been evaluated empirically-showing promising results. The following work investigates GNNs from a theoretical point of view and relates them to the 1-dimensional Weisfeiler-Leman graph isomorphism heuristic (1-WL). We show that GNNs have the same expressiveness as the 1-WL in terms of distinguishing non-isomorphic (sub-)graphs. Hence, both algorithms also have the same shortcomings. Based on this, we propose a generalization of GNNs, so-called k-dimensional GNNs (k-GNNs), which can take higher-order graph structures at multiple scales into account. These higher-order structures play an essential role in the characterization of social networks and molecule graphs. Our experimental evaluation confirms our theoretical findings as well as confirms that higher-order information is useful in the task of graph classification and regression.
@article{
title = {Weisfeiler and leman go neural: Higher-order graph neural networks},
type = {article},
year = {2019},
pages = {4602-4609},
id = {8c7ef763-64c1-3cda-900a-0d36d508e894},
created = {2021-07-12T10:19:36.814Z},
file_attached = {true},
profile_id = {ad172e55-c0e8-3aa4-8465-09fac4d5f5c8},
group_id = {1ff583c0-be37-34fa-9c04-73c69437d354},
last_modified = {2021-07-12T10:20:04.991Z},
read = {false},
starred = {false},
authored = {false},
confirmed = {true},
hidden = {false},
folder_uuids = {20ccb950-fef9-4ee1-800c-a60ba9f1df16},
private_publication = {false},
abstract = {In recent years, graph neural networks (GNNs) have emerged as a powerful neural architecture to learn vector representations of nodes and graphs in a supervised, end-to-end fashion. Up to now, GNNs have only been evaluated empirically-showing promising results. The following work investigates GNNs from a theoretical point of view and relates them to the 1-dimensional Weisfeiler-Leman graph isomorphism heuristic (1-WL). We show that GNNs have the same expressiveness as the 1-WL in terms of distinguishing non-isomorphic (sub-)graphs. Hence, both algorithms also have the same shortcomings. Based on this, we propose a generalization of GNNs, so-called k-dimensional GNNs (k-GNNs), which can take higher-order graph structures at multiple scales into account. These higher-order structures play an essential role in the characterization of social networks and molecule graphs. Our experimental evaluation confirms our theoretical findings as well as confirms that higher-order information is useful in the task of graph classification and regression.},
bibtype = {article},
author = {Morris, Christopher and Ritzert, Martin and Fey, Matthias and Hamilton, William L. and Lenssen, Jan Eric and Rattan, Gaurav and Grohe, Martin},
doi = {10.1609/aaai.v33i01.33014602},
journal = {33rd AAAI Conference on Artificial Intelligence, AAAI 2019, 31st Innovative Applications of Artificial Intelligence Conference, IAAI 2019 and the 9th AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2019}
}
Downloads: 0
{"_id":"ma5M5HiyzfJB7wFpz","bibbaseid":"morris-ritzert-fey-hamilton-lenssen-rattan-grohe-weisfeilerandlemangoneuralhigherordergraphneuralnetworks-2019","authorIDs":["oWamqdovFccHcFdCZ"],"author_short":["Morris, C.","Ritzert, M.","Fey, M.","Hamilton, W., L.","Lenssen, J., E.","Rattan, G.","Grohe, M."],"bibdata":{"title":"Weisfeiler and leman go neural: Higher-order graph neural networks","type":"article","year":"2019","pages":"4602-4609","id":"8c7ef763-64c1-3cda-900a-0d36d508e894","created":"2021-07-12T10:19:36.814Z","file_attached":"true","profile_id":"ad172e55-c0e8-3aa4-8465-09fac4d5f5c8","group_id":"1ff583c0-be37-34fa-9c04-73c69437d354","last_modified":"2021-07-12T10:20:04.991Z","read":false,"starred":false,"authored":false,"confirmed":"true","hidden":false,"folder_uuids":"20ccb950-fef9-4ee1-800c-a60ba9f1df16","private_publication":false,"abstract":"In recent years, graph neural networks (GNNs) have emerged as a powerful neural architecture to learn vector representations of nodes and graphs in a supervised, end-to-end fashion. Up to now, GNNs have only been evaluated empirically-showing promising results. The following work investigates GNNs from a theoretical point of view and relates them to the 1-dimensional Weisfeiler-Leman graph isomorphism heuristic (1-WL). We show that GNNs have the same expressiveness as the 1-WL in terms of distinguishing non-isomorphic (sub-)graphs. Hence, both algorithms also have the same shortcomings. Based on this, we propose a generalization of GNNs, so-called k-dimensional GNNs (k-GNNs), which can take higher-order graph structures at multiple scales into account. These higher-order structures play an essential role in the characterization of social networks and molecule graphs. Our experimental evaluation confirms our theoretical findings as well as confirms that higher-order information is useful in the task of graph classification and regression.","bibtype":"article","author":"Morris, Christopher and Ritzert, Martin and Fey, Matthias and Hamilton, William L. and Lenssen, Jan Eric and Rattan, Gaurav and Grohe, Martin","doi":"10.1609/aaai.v33i01.33014602","journal":"33rd AAAI Conference on Artificial Intelligence, AAAI 2019, 31st Innovative Applications of Artificial Intelligence Conference, IAAI 2019 and the 9th AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2019","bibtex":"@article{\n title = {Weisfeiler and leman go neural: Higher-order graph neural networks},\n type = {article},\n year = {2019},\n pages = {4602-4609},\n id = {8c7ef763-64c1-3cda-900a-0d36d508e894},\n created = {2021-07-12T10:19:36.814Z},\n file_attached = {true},\n profile_id = {ad172e55-c0e8-3aa4-8465-09fac4d5f5c8},\n group_id = {1ff583c0-be37-34fa-9c04-73c69437d354},\n last_modified = {2021-07-12T10:20:04.991Z},\n read = {false},\n starred = {false},\n authored = {false},\n confirmed = {true},\n hidden = {false},\n folder_uuids = {20ccb950-fef9-4ee1-800c-a60ba9f1df16},\n private_publication = {false},\n abstract = {In recent years, graph neural networks (GNNs) have emerged as a powerful neural architecture to learn vector representations of nodes and graphs in a supervised, end-to-end fashion. Up to now, GNNs have only been evaluated empirically-showing promising results. The following work investigates GNNs from a theoretical point of view and relates them to the 1-dimensional Weisfeiler-Leman graph isomorphism heuristic (1-WL). We show that GNNs have the same expressiveness as the 1-WL in terms of distinguishing non-isomorphic (sub-)graphs. Hence, both algorithms also have the same shortcomings. Based on this, we propose a generalization of GNNs, so-called k-dimensional GNNs (k-GNNs), which can take higher-order graph structures at multiple scales into account. These higher-order structures play an essential role in the characterization of social networks and molecule graphs. Our experimental evaluation confirms our theoretical findings as well as confirms that higher-order information is useful in the task of graph classification and regression.},\n bibtype = {article},\n author = {Morris, Christopher and Ritzert, Martin and Fey, Matthias and Hamilton, William L. and Lenssen, Jan Eric and Rattan, Gaurav and Grohe, Martin},\n doi = {10.1609/aaai.v33i01.33014602},\n journal = {33rd AAAI Conference on Artificial Intelligence, AAAI 2019, 31st Innovative Applications of Artificial Intelligence Conference, IAAI 2019 and the 9th AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2019}\n}","author_short":["Morris, C.","Ritzert, M.","Fey, M.","Hamilton, W., L.","Lenssen, J., E.","Rattan, G.","Grohe, M."],"urls":{"Paper":"https://bibbase.org/service/mendeley/bfbbf840-4c42-3914-a463-19024f50b30c/file/264f86af-a892-78f5-59a3-73ec8f2ae7d6/4384_Article_Text_7423_1_10_20190706.pdf.pdf"},"biburl":"https://bibbase.org/service/mendeley/bfbbf840-4c42-3914-a463-19024f50b30c","bibbaseid":"morris-ritzert-fey-hamilton-lenssen-rattan-grohe-weisfeilerandlemangoneuralhigherordergraphneuralnetworks-2019","role":"author","metadata":{"authorlinks":{}},"downloads":0},"bibtype":"article","biburl":"https://bibbase.org/service/mendeley/bfbbf840-4c42-3914-a463-19024f50b30c","creationDate":"2020-03-03T06:11:20.269Z","downloads":0,"keywords":[],"search_terms":["weisfeiler","leman","neural","higher","order","graph","neural","networks","morris","ritzert","fey","hamilton","lenssen","rattan","grohe"],"title":"Weisfeiler and leman go neural: Higher-order graph neural networks","year":2019,"dataSources":["jS7oF7ycnJjCpQRs7","ya2CyA73rpZseyrZ8","2252seNhipfTmjEBQ"]}