{"type":"ScholarlyArticle","title":"The Power of the Weisfeiler-Leman Algorithm for Machine Learning with Graphs","authors":[{"name":"Christopher Morris","slug":"christopher-morris","given":"Christopher","family":"Morris","affiliation":""},{"name":"Matthias Fey","slug":"matthias-fey","given":"Matthias","family":"Fey","affiliation":""},{"name":"Nils Kriege","slug":"nils-kriege","given":"Nils","family":"Kriege","affiliation":""}],"abstract":"In recent years, algorithms and neural architectures based on the Weisfeiler-Leman algorithm, a well-known heuristic for the graph isomorphism problem, emerged as a powerful tool for (supervised) machine learning with graphs and relational data. Here, we give a comprehensive overview of the algorithm's use in a machine learning setting. We discuss the theoretical background, show how to use it for supervised graph- and node classification, discuss recent extensions, and its connection to neural architectures. Moreover, we give an overview of current applications and future directions to stimulate research.","doi":"10.24963/ijcai.2021/618","url":"https://ijcai.org/proceedings/2021/618","pdf":"https://ijcai.org/proceedings/2021/0618.pdf","markdown":"https://ijcai.org/proceedings/2021/618.md","bibtex":"https://ijcai.org/proceedings/2021/bibtex/618","volume":{"slug":"2021","title":"Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2021","url":"https://ijcai.org/proceedings/2021/","year":2021,"location":"Montreal","dates":"19-27 August 2021","editors":"Prof. Zhi-Hua Zhou","isbn":"978-0-9992411-9-6","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2021"},"section":"Survey Track","track":"Survey Track","number":618,"pages":{"first":4543,"last":4550},"keywords":["Machine learning: General"],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}