Your explanation is the one that did it to my head. Thank you.
@Shivablue9 жыл бұрын
Comming from an Arts background, maths have always represented a challenge to me. But you have a gift explaining things! Oh it is so nice that you took the time to do this! Thank you so much!
@nishadt6 жыл бұрын
A very nice explanation, I would love to see the video on Null model and resolution limit using modularity for community detection
@XORBob3 жыл бұрын
Super helpful, Matthew. Thanks for posting!
@myWorldDiscover9 жыл бұрын
Could you please explain why you use the square ? in the second part of the equation?
@rohitariq37794 жыл бұрын
Yes why they take square??
@anisterki1116 Жыл бұрын
Thanks
@hamidkazemiroodbali95067 жыл бұрын
Very neat and clean video. Thank you very much.
@csaa76594 жыл бұрын
Great explanation. Thank you so much for this video.
@shwetasinghmeena54726 жыл бұрын
Sir, can you please upload a video on the example of louvain algorithm with a suitable graph?
@kidinmind6 жыл бұрын
It is the best explanation of modularity thanks.
@cristijora14378 жыл бұрын
Thanks so much. This saved me some hours of reading. Very nicely explained
@anaisanais37695 жыл бұрын
is it possible to use the same formula for all community detection algorithms !!??
@rohitariq37794 жыл бұрын
Wawoo very informative.. thank you sir . Please could you upload such vedio for conductance metrics in community detection.
@leilasamandari40785 жыл бұрын
thank you so much for this wonderful video
@lananhpro273410 жыл бұрын
thank you so very much! This video is awesome!
@vibesneverlie72128 жыл бұрын
its a goood explanation for modularity calculation..very good video..
@dheerajnair19987 жыл бұрын
Thanks for the video! Helped me out in the last minute :)
@MrLeugim335 жыл бұрын
Thank you a lot for this video. It has helped me a lot ^^
@sonamgupta90795 жыл бұрын
very well explained thank you so much :) can you upload video on BRIM and LP(label Propagation). it will be very helpful for me
@shwetasinghmeena54726 жыл бұрын
why have you divided expected number by (2L) not by L ??
@joshisanonymous6 жыл бұрын
I'm pretty sure this is done because that term is dealing with degree, not simply the total number of edges (L). Since an edge is always connected to two vertices, you can get the sum of the degrees for the whole graph by counting up all the edges and multiplying them by 2.