A Persistent Weisfeiler–Lehman Procedure for Graph Classifjcation Bastian Rieck Christian Bock Karsten Borgwardt
Graph classifjcation Graph Potential labels A Persistent Weisfeiler–Lehman Procedure for Graph Classifjcation Bastian Rieck, Christian Bock, Karsten Borgwardt 11 June 2019
Graph classifjcation Neighbourhood aggregation A Persistent Weisfeiler–Lehman Procedure for Graph Classifjcation Bastian Rieck, Christian Bock, Karsten Borgwardt 11 June 2019
Our proposed method “P-WL = WL + TDA” A Persistent Weisfeiler–Lehman Procedure for Graph Classifjcation Bastian Rieck, Christian Bock, Karsten Borgwardt 11 June 2019
Topological features in graphs Connected components and cycles Graph A connected component Cycles A Persistent Weisfeiler–Lehman Procedure for Graph Classifjcation Bastian Rieck, Christian Bock, Karsten Borgwardt 11 June 2019 1 2
Finding topological features 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
Finding topological features 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
Finding topological features 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
Finding topological features 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
Finding topological features 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
Finding topological features 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
Finding topological features 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
Finding topological features 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
Finding topological features 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
Finding topological features 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
Conclusion 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) Poster #224 A Persistent Weisfeiler–Lehman Procedure for Graph Classifjcation Bastian Rieck, Christian Bock, Karsten Borgwardt 11 June 2019
Recommend
More recommend