Stanford CS224W: Machine Learning with Graphs - Stanford CS224W: Machine Learning with Graphs | 2021 | Lecture 13.2 - Network Communities

For more information about Stanford’s Artificial Intelligence professional and graduate programs, visit: https://stanford.io/3nzmJ6U Jure Leskovec Computer Science, PhD We introduce methods that build on the intuitions presented in the previous part to identify clusters within networks. We define modularity score Q that measures how well a network is partitioned into communities. We also introduce null models to measure expected number of edges between nodes to compute the score. Using this idea, we then give a mathematical expression to calculate the modularity score. Finally, we can develop an algorithm to find communities by maximizing the modularity. To follow along with the course schedule and syllabus, visit: http://web.stanford.edu/class/cs224w/ #machinelearning #machinelearningcourse