🎞 Machine Learning with Graphs: Community Detection in Network, Network Communities, Louvain Algorithm, Detecting Overlapping Communities

💥Free recorded course by Jure Leskovec, Computer Science, PhD

💥In this lecture, 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..


📽 Watch: part1 part2 part3 part4

📲Channel: @ComplexNetworkAnalysis

#video #course #Graph #Machine_Learning #Community_Detection