Commfind (CF by Donetti and Muñoz) - SergiuTripon/msc-thesis-na-epsrc GitHub Wiki

Home ▸ Algorithms ▸ Commfind (CF by Donetti and Muñoz)

---

It combines the analysis of the Laplacian matrix eigenvectors used in classic graph partitioning with a cluster analysis step. Instead of using the best eigenvector to iteratively perform bisections of the network, it takes advantage of the
best ones. Communities are obtained by a cluster analysis of the projected nodes in this dimensional space.

Back to Top