The Overlapping Community Discovery Algorithm Base on Link Strength

In this paper, an overlapping community discovery algorithm ODBLS based on network connection strength is proposed. The main idea of the algorithm is: first, the local area coincidence near the node is used to get the importance of each node, and the node with the most important degree is regarded as the cluster center of the initial community. The aim is to locate the initial community position in the network accurately; secondly, calculate the network connection strength matrix, and then through the link strength of the community around the community to calculate the attribution of the community, and ultimately through the objective function to get a complete community. ODBLS does not have the number of pre-defined communities, we verify the performance of the ODBLS algorithm on the artificial simulation network and the real network respectively. The experimental results show that it has not only better time efficiency than other representative algorithms, but also can find Higher quality overlapping community structure.