Bhanuteja Gullapalli

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
In this paper, we present a new algorithm to identify non-overlapping like-minded communities in a social network and compare its performance with Girvan-Newman algorithm, Lovain method and some well-known hierarchical clustering algorithms on Twitter and Filmtipset datasets.
Community detection in large social, biological or information network is an important problem since it helps uncover hidden structural properties in the network. For detecting communities, one typically defines or chooses an objective function such that a higher value corresponds to clusters densely connected inside and sparsely connected to nodes outside(More)
  • 1