A Graph Clustering algorithm based on shared neighbors and connectivity

Graph Clustering algorithm is useful to detect clusters in a graph. However, the existing algorithms are mainly focus on connectivity or attributes of vertices. In this paper, we propose a new algorithm called SNGC that both consider shared neighbors and connectivity between vertices. Furthermore, we implement this algorithm and test it in several experiments. The results show that the performance of SNGC algorithm is pretty well.