Graph Clustering Algorithms (September 28, 2017)

[@Wanderschwamm]

I sometimes have the problem, that some of the clusters are not totally interconnected (one node is only accessible over nodes that are in other clusters ). How can I improve the algorithm, that this won't happen anymore? Is there any correlation between the number of clusters (K) and the number of eigenvectors i should use?

[@stomerh]

Did you said MANSPLAINING (in 1:35) ???

[@andrewchavarria9227]

LMAOOO she did

[@russp622]

Quite a stupid thing to come out of the mouth of someone of her caliber!

[@smiletolerantly]

@@russp622 Or, you know... It's a deliberate joke.

[@Raven-bi3xn]

Hahaha she is hilarious!

[@paul_tee]

lmaoo

[@gpprudhvi]

Awesome explanation!

[@Raven-bi3xn]

Great talk!

[@mumbaicarnaticmusic2021]

Thanks a lot

[@hos42]

This helped me a lot

[@samirzerrouki9140]

thank you