CGraM: Enhanced Algorithm for Community Detection in Social Networks

Community Detection is used to discover a non-trivial organization of the network and to extract the special relations among the nodes which can help in understanding the structure and the function of the networks. However, community detection in social networks is a vast and challenging task, in terms of detected communities accuracy and computational overheads. In this paper, we propose a new algorithm Enhanced Algorithm for Community Detection in Social Networks – CGraM, for community detection using the graph measures eccentricity, harmonic centrality and modularity. First, the centre nodes are identified by using the eccentricity and harmonic centrality, next a preliminary community structure is formed by finding the similar nodes using the jaccard coefficient. Later communities are selected from the preliminary community structure based on the number of inter-community and intra-community edges between them. Then the selected communities are merged till the modularity improves to form the better resultant community structure. This method is tested on the real networks and the results are evaluated using the evaluation metrics modularity and Normalized Mutual Information (NMI). The results are visualized and also compared with the state-of-the-art algorithms that covers louvian, walktrap, infomap, label propagation, fast greedy and eigen vector for more accurate analysis. CGraM achieved the better modularity and improved NMI values comparatively with other algorithms and gives improved results collaboratively when compared to previous methods.