Overlapping Community and Node Discovery Algorithm Based on Edge Similarity

Abstract

Most of community detection algorithms are designed from the perspective of nodes, which usually neglect the overlapping structure in networks. Whereas some of them hold the weakness of high complexity, inaccuracy and low stability. To solve the above issues, an overlapping community and node discovery algorithm based on edge similarity is proposed. In this paper, is established according to the incidence matrix. Then the algorithm is proceeding on line graph and finally the community detection results are restored to the original network, thus overlapping community and nodes are discovered. Several experiments are carried out on different datasets, demonstrating that the proposed algorithm is effective.