• Anupama Chowdhary

Online social network is a universal set of sets of people connected via each other densely and in turn these set are connected with each other sparsely. In the graph structure these dense sets are known as communities. Although in literature there is a variety of community definitions based on network structures. Community detecting methods that have appeared in literature are even larger. In this paper we have discussed promising algorithms to detect communities in social networks.

centrality, betweenness, modularity, graph partition, hierarchical clustering, spectral clustering, potts model, random walk.

"Community Detection in Social Networks : Promising Algorithms.", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.4, Issue 12, page no.480-484, December-2017, Available :http://www.jetir.org/papers/JETIR1712090.pdf

"Community Detection in Social Networks : Promising Algorithms.", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.4, Issue 12, page no. pp480-484, December-2017, Available at : http://www.jetir.org/papers/JETIR1712090.pdf