Community detection in graphs using singular value decomposition.

@article{Sarkar2011CommunityDI,
  title={Community detection in graphs using singular value decomposition.},
  author={Somwrita Sarkar and Andy Dong},
  journal={Physical review. E, Statistical, nonlinear, and soft matter physics},
  year={2011},
  volume={83 4 Pt 2},
  pages={
          046114
        }
}
A spectral algorithm for community detection is presented. The algorithm consists of three stages: (1) matrix factorization of two matrix forms, square signless Laplacian for unipartite graphs and rectangular adjacency matrix for bipartite graphs, using singular value decompostion (SVD); (2) dimensionality reduction using an optimal linear approximation; and (3) clustering vertices using dot products in reduced dimensional space. The algorithm reveals communities in graphs without placing any… CONTINUE READING
BETA

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 23 CITATIONS

Similar Papers

Loading similar papers…