Weisfeiler Lehman Graph Kernel | Solved Example | Network Science

In this video, you will understand the various topics related to Weisfeiler Lehman Graph Kernels. These concepts are discussed in context of calculations involved in the identification of similarity between two or more graphs and using them to find the conclusion to Graph Based Characteristics. I have taken several illustrative examples to explain the concepts in depth.

If you are facing any issues do let me know in the comment section below, I am here to help ❤️
If you found this video useful then please consider subscribing to my channel 🙏

Chapters in the Video
0:00 Introduction
0:33 Problem Statement
1:20 Defining Weisfeiler Lehman Kernel
2:03 Real World Application
2:35 Process Outline
3:28 Aggregate Neighbour Colours
4:14 Creating Measurable Metrics
5:02 Injective Hashing
6:19 Insert Hashes into the Graph
7:19 Important Observation
8:23 The iterative steps
9:25 Understanding Results
10:11 Hashing After Aggregation
12:10 Verifying Stable Colouring
12:40 Calculate the Colour Count Vector
13:30 Calculate the Inner Product
14:01 Similarity of Graphs
14:45 Conclusion

Background Music Credits (in order of use)
Outro Music Credit:
Spirit by Sappheiros:
"Spirit by Sappheiros" is under a Creative Commons ( cc-by ) license
Music promoted by BreakingCopyright: https://bit.ly/sappheiros-spirit