Unified scheme for finding disjoint and overlapping communities in social networks using strength of ties

摘要

In this paper, we have defined a metric that measures the strength of a link (SOL) in the network to calculate the degree to which it is considered to be part of a community. Higher the strength value of a link, more likely it is to be an integral part of a community whereas links with lesser strength value, such as bridges, are considered to be on the border of the communities. Based on the strength of the links, first we have devised a disjoint community detection technique and then we have extended it to form a unified scheme capable of detecting both disjoint and overlapping communities. This method does not need any predefined number of communities as input and shows the best set of clusters as output. Proposed methods produce results closer to ground truth compared to some popular community detection methods and has a high clique retention index.