A Persistent WeisfeilerLehman Procedure for Graph Classifjcation - - PowerPoint PPT Presentation
A Persistent WeisfeilerLehman Procedure for Graph Classifjcation Bastian Rieck Christian Bock Karsten Borgwardt Graph classifjcation Graph Potential labels A Persistent WeisfeilerLehman Procedure for Graph Classifjcation Bastian Rieck,
Bastian Rieck Christian Bock Karsten Borgwardt
Graph Potential labels
A Persistent Weisfeiler–Lehman Procedure for Graph Classifjcation Bastian Rieck, Christian Bock, Karsten Borgwardt 11 June 2019
Neighbourhood aggregation
A Persistent Weisfeiler–Lehman Procedure for Graph Classifjcation Bastian Rieck, Christian Bock, Karsten Borgwardt 11 June 2019
A Persistent Weisfeiler–Lehman Procedure for Graph Classifjcation Bastian Rieck, Christian Bock, Karsten Borgwardt 11 June 2019
Connected components and cycles
Graph A connected component
1 2
Cycles
A Persistent Weisfeiler–Lehman Procedure for Graph Classifjcation Bastian Rieck, Christian Bock, Karsten Borgwardt 11 June 2019
Calculating the persistent homology of a weighted graph
Labelled graph
A Persistent Weisfeiler–Lehman Procedure for Graph Classifjcation Bastian Rieck, Christian Bock, Karsten Borgwardt 11 June 2019
Calculating the persistent homology of a weighted graph
Weisfeiler–Lehman aggregation
A Persistent Weisfeiler–Lehman Procedure for Graph Classifjcation Bastian Rieck, Christian Bock, Karsten Borgwardt 11 June 2019
Calculating the persistent homology of a weighted graph
Label multisets
A Persistent Weisfeiler–Lehman Procedure for Graph Classifjcation Bastian Rieck, Christian Bock, Karsten Borgwardt 11 June 2019
Calculating the persistent homology of a weighted graph
Weighted graph
A Persistent Weisfeiler–Lehman Procedure for Graph Classifjcation Bastian Rieck, Christian Bock, Karsten Borgwardt 11 June 2019
Calculating the persistent homology of a weighted graph
Weighted graph Graph fjltration Topological feature descriptor
A Persistent Weisfeiler–Lehman Procedure for Graph Classifjcation Bastian Rieck, Christian Bock, Karsten Borgwardt 11 June 2019
Calculating the persistent homology of a weighted graph
Weighted graph Graph fjltration Topological feature descriptor
A Persistent Weisfeiler–Lehman Procedure for Graph Classifjcation Bastian Rieck, Christian Bock, Karsten Borgwardt 11 June 2019
Calculating the persistent homology of a weighted graph
Weighted graph Graph fjltration Topological feature descriptor
A Persistent Weisfeiler–Lehman Procedure for Graph Classifjcation Bastian Rieck, Christian Bock, Karsten Borgwardt 11 June 2019
Calculating the persistent homology of a weighted graph
Weighted graph Graph fjltration Topological feature descriptor
A Persistent Weisfeiler–Lehman Procedure for Graph Classifjcation Bastian Rieck, Christian Bock, Karsten Borgwardt 11 June 2019
Calculating the persistent homology of a weighted graph
Weighted graph Graph fjltration Topological feature descriptor
A Persistent Weisfeiler–Lehman Procedure for Graph Classifjcation Bastian Rieck, Christian Bock, Karsten Borgwardt 11 June 2019
Calculating the persistent homology of a weighted graph
Weighted graph Graph fjltration Topological feature descriptor
A Persistent Weisfeiler–Lehman Procedure for Graph Classifjcation Bastian Rieck, Christian Bock, Karsten Borgwardt 11 June 2019
P-WL… …is almost as effjcient as the Weisfeiler–Lehman kernel …exhibits favourable performance …outperforms “deep” graph kernels …shows the potential of topological data analysis (TDA)
A Persistent Weisfeiler–Lehman Procedure for Graph Classifjcation Bastian Rieck, Christian Bock, Karsten Borgwardt 11 June 2019